Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Linux > COMP6452 > Flashcards

COMP6452 Flashcards

1
Q

Asset Tokenisation =

A

representing the ownership rights of real-world assets as digital tokens on a blockchain.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Minting an NFT

A

publishing a unique instance of your ERC721 token on the blockchain

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Ledger =

A

shared append-only database of blocks of TXs. It is one list, but operators are in a peer-to-peer network

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are the types of DLT Systems

A

permissionless, permissioned, public, private

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is the goal of a distributed ledger?

A

Decentralised trustless environment achieved through replication, transparency and cross checked-data. Don’t trust any individual node, but the whole network.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Full vs distributed ledger

A

Full means the whole ledger is replicated at all parties, while shared means parts are replicated across multiple parties.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

With multiple copies of a ledger, need to

A

ensure it is maintained and consistent.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

The double spending problem could arise if

A

the ledger synchronisation is built to accomodate inconsistencies.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Sender times are not reliable due to

A

drift and skew, and could be changed to game the system

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Instead of relying on sender times, should rely on

A

nodes/replicas to agree on a global ordering of transactions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

CAP theorem states

A

it is impossible for a web service to provide consistency, availability and partition-tolerance at the same time.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is mandatory in distributed systems?

A

Partition tolerance

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Describe the structure of a blockchain

A

Collection of ordered TXs from a block’s body
Summary of those TXs & hash of previous block forms a block’s header
Collection of blocks form a blockchain
- blocks are built through distributed set of nodes via mining
- nodes agree on contents of a block, order of blocks & who has the right to build a block

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Describe the node network infrastructure

A

Peer to peer network of nodes, each with same rights to update the ledger

Each node hosts a replica of the ledger which allows high availability and efficient read access

Communicate via gossip protocol for TX propogation and consensus protocol for agreement (generally super majoritty agreemnet i.e. 2/3 is required to detemine what changes are needed)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Non functional properties of blockchains

A

+ Integrity, non-repudiation
+ read / - write availability
+ read / - write latency
- confidentiality
- modifiability
- throughput, scalability, big data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What roles can blockchains play in an arhcitecture?

A

Storage, Communication, Computation, Achritectural, and asset management and control

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Replicated and distributed ledger is kind of like

A

a linked list with hash pointers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

hashing =

A

converts a large volume of data into a small datum, i.e. maps arbitrary-sized data to fixed-size data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Properties of cryptographic hash functions =

A

deterministic
small change -> massive change in hash value
quick to compute
one-way function, cannot invert it
infeasible to hash-collision

20
Q

Merkle tree =

A

binary tree built using hashes
Alllows efficient and secure verification of contents of large data structures
Can efficiently demonstrate a leaf node is part of a given hash tree

For BCs,
leaves of the tree are hashes of TXs
You concatenate two leaves and calculate another hash and continue this until the root of the tree is reached

21
Q

Public Key Cryptography =

A

System that uses a public key which may be disseminated widely and a private key that is only known to the owner i.e. assymetric cryptography

22
Q

What is the one base cryptocurrency that a platform has called?

A

Native currency

23
Q

native currency can only be acquired by?

A

mining or purchasing from cryptocurrency exchanges

24
Q

What is a 1st Gen Blockchain?

A

Bitcoin!

Where users create, sign and announce TXs to the netwrok
Miners then receive the TXs, include them in a new block and then try to append them to the chain of blocks. Once, the TX is part of the data structure it has officially taken place.

25
Q

What is the state of the blockchain?

A

Account of balances of all users
Result from the genesis block and set of TXs included since
As TXs are grouped into blocks, when a new block is adde, the entire system moves from one descrete state to anotehr

26
Q

What is a TX Fee?

A

It is where the sum of outputs is less than the sum of inputs and is given as incentives for miners to contribute computing power and storage

27
Q

TX output is bound to

A

Owner’s public key

28
Q

Describe the format of TXs

A

Outputs of TXs become inputs of a new TX, such that they form a link
Balance of an address/account is the sum of all of UTXOs associated with the address
State of the blockchain = all the UTXO’s in system

29
Q

What does a block contain

A

Container of TXs
Identified by a hash
linked to previous block
includes a (not very accurate) timestamp
includes a nonce, which is the proof of the ability to produce the block
Uses a merkle tree to capture ordered list of TXs

30
Q

What is the overall process of creating a new block through mining?

A

Recieve a new block ->
Aggregation ->
Header Construction ->
Solve Puzzle ->
Propagation

31
Q

What happens in the aggregation stage of creating a new block>

A

Remove TXs that are included in teh newly annoucned block from the pool of TXs
Aggregate a subset of the remaining valid TXs and add coinbase TX as the 1st TX of the next block

32
Q

What happens in the header construction stage of create a new block?

A

Construct a merkele tree to summarise all included TXs
Include hash of previous block

33
Q

What happens in the solving puzzle stage of creating a new block?

A

Find solution to Proof-of-work algorithm called hashcash
Result will be inserted into the block header if successful

34
Q

What happens in the propogation stage of creating a new block>

A

Immediately propogate new block to other nodes

35
Q

Characteistics of PoW

A

difficult to complete answer, easy to validate
difficulty of problem is automically adjusted with time
It basically involves sending different nonces until one matches.

36
Q

How can a tie be broken in the announcement of a new block?

A

Take the longest history of blocks as the main chain, that is, the one that recieved the most computation

37
Q

Nakamoto Consensus

A

Wait for several new blocks to be added after the 1st inclusion of the TX in a block. This allows forks to be resolved. It bitcoin 6 blocks is sufificent which is currently 1 hour long.

38
Q

What are the two rewards for a miner?

A

Block reward = new cryptocurrencies generate as part of block generation are assigned to the miner.
TX fees = fees paid by users to get their TXs included in the block

39
Q

How can you increase the chance of getting your TX included in a block?

A

Higher TX fee

40
Q

What is a 2nd generation blockchain?

A

It is a ledger that can store/transact any kind of data
Blockchain that fully supports smart contracts

41
Q

On Sep 15, 2022 what did ethereum switch?

A

Its consenus algorithm, from PoW to Proof of Stake.
PoS = protocols which select validatros / miners in proportion to their quantity of holdings in their associated cryptocurrency i.e. ETH.
instead of selecting a miner to build the next block based on its computing power, a miner is selected based on the amount of ETH it stakes.

42
Q

Bitcoin uses UTXO, while ethereum uses

A

Account-balance model where the ledger maintains the balance of each account

Each account is bound to the owner’s public key

43
Q

How are transactions structures in 2nd Gen Ethereum

A

TXs and blocks are uniquely identified by their hashes

Txs from the same account are ordered by a sequence called the nonce.

44
Q

How is TX fee calculated in ethereum?

A

gas limit x gas price

45
Q

Describe the block format structure in ethereum

A

Maintains state of all accounts (world state)
-> Includes account balances, data stored and smart contracts
Has the list of TXs
List of TX receipts
Ethereum uses 3 Merkle trees, one each for intergity of World state, TXs, TX receipts.

Linux (4 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions