Blockchain Flashcards
1
Q
Distributed Ledger (Computer Science)
A
- All participants share a consistent copy of the database, there is no central server
-> Some participants might not have a full copy - Network connections are peer-to-peer
- Using a type of consensus protocol, to agree on validity of a given transaction
- Transaction - could be financial and/or exchanging of assets and/or services
- Uses digital signatures (private/public key) to sign and/or encrypt transactions on the ledger
2
Q
Public vs. Private Blockchain
A
- A public blockchain is a blockchain, in which there are no restrictions on reading blockchain data (which still may be encrypted) and submitting transactions for inclusion into the blockchain
- A private blockchain is a blockchain, in which direct access to blockchain data and submitting transactions is limited to a predefined list of entities
3
Q
Permissionless vs. Permissioned Blockchain
A
- A permissionless blockchain is a blockchain, in which there are no restrictions on identities of transaction processors (i.e., users that are eligible to create blocks of transactions)
- A permissioned blockchain is a blockchain, in which transaction processing is performed by a predefined list of subjects with known identities
4
Q
Consensus in public permissionless blockchains
A
- All transactions are publicly readable and validatable
-> No unnoticeable modifications of past transactions
-> Unauthorized transactions are observable
-> No double spending (digital money is not duplicated) - Problem: Decentralized computing might lead to different variants of the blockchain - which of it is the right one?
- Solution: Majority decisions by Consensus-Mechanisms
5
Q
Proof of Work
A
- A publicly auditable cost-function can be efficiently verified by any third party without access to any trapdoor or secret information
- A fixed cost-function takes a fixed amount of resources to compute. The fastest algorithm to mint a fixed cost token is a deterministic algorithm
- A probabilistic cost-function is one where the cost to the client of mining a token has a predictable expected time, but a random actual time as the client can most efficiently compute the cost-function by starting at a random start value. Sometimes the client will get lucky and start close to the solution.
6
Q
Bitcoin: Transaction Confirmation
A
- Every new block accepted into the chain after the transaction was accepted is considered a confirmation
- Coins are not considered mature until there have been six confirmations
- New Coins created by the mining process are not valid until about 120 confirmations
- This is to assure that a node with more than 51% of the total hash-power does not pull off fraudulent transactions
7
Q
Security in Bitcoin
A
- Authentication: Digital Signatures
- Integrity: Digital Signatures and Cryptographic Hash
- Availability: Broadcast messages to the P2P network
- Confidentiality: Pseudonymity
8
Q
Practical Limitations of Bitcoin
A
- At least 10 minutes to verify a transaction