blockchain 2 0
play

Blockchain 2.0 Opportunities and Risks Patrick Valduriez The Hype - PowerPoint PPT Presentation

Blockchain 2.0 Opportunities and Risks Patrick Valduriez The Hype 2 Bitcoin Bitcoin: A Peer-to-Peer Electronic Cash System Satoshi Nakamoto (pseudo), Oct. 31, 2008 (Halloween) Cryptocurrency and payment system Blockchain is the


  1. Blockchain 2.0 Opportunities and Risks Patrick Valduriez

  2. The Hype 2

  3. Bitcoin • Bitcoin: A Peer-to-Peer Electronic Cash System • Satoshi Nakamoto (pseudo), Oct. 31, 2008 (Halloween) • Cryptocurrency and payment system • Blockchain is the infrastructure • Since then • Many blockchains: Etherum in 2013, Ripple in 2014, etc. • Increasing use for high-risk investment • Initial Coin Offerings • But also in fraudulent or illegal activities ! • Scam, purchase on the dark web, money laundering, tax evasion, … • Warnings from market authorities and beginning of regulation (China, South Korea, Japan, EU, …) 3

  4. The Currency of Tomorrow? • Pros • Low transaction fee (set by the sender to speed up processing) • Fewer risks for merchants (no fraudulent chargebacks) • Security and control (protection from identity theft) • Trust through the blockchain • Cons • Unstable: no backing by a state or fed bank (unlike $ and € ) • Unrelated to real economy, e.g. GPD: fosters speculation • High volatility, e.g. between 6K and 7K$ in 3 hours • Small user base: 20 million bitcoin wallets • Versus billions of users of e-payment systems like AliPay and Paypal • The Crypto Bubble (2017)* • Bitcoin price increased from $1k to 10K, then peaked almost at $20K in December 2017 to collapse 4 months later to below $6k (down 70% from the peak), and close to $6k since then * Testimony for the Hearing of the US Senate Committee on Banking, Housing and Community Affairs On “Exploring the Cryptocurrency and Blockchain Ecosystem”. Nouriel Roubini (NYU), october 2018. 4

  5. Outline Trust with blockchain • Consensus protocols • How the blockchain works • Blockchain 2.0 • Use cases • Opportunities and risks • Issues •

  6. Trust in a Modern Economy • Context • How to exchange assets safely between two parties? • Centralized ledger • An account book that records all transactions • Controlled by a trusted central authority • E.g. a clearing house 6

  7. Problems with Central Authority • Single point of failure • And easy target for attackers • Favors concentration of actors • Banks • Exploit our money to make big money • Web giants (GAFAM) and other intermediaries (Uber, etc.) • Exploit our data to make big money 7

  8. Trust with Blockchain • A distributed ledger • Shared by all participants • Replicated • Decentralized • Append-only • No update, no delete • Distributed transaction validation • Consensus • Unfalsiable, verifiable 8

  9. Blockchain Promises • Increased trust in value exchange • Trust the data, not the participants • No single point of failure • Increased security • Efficient, consistent transactions between participants • Faster and cheaper than relying on a long chain of intermediaries, with incompatible systems and rules 9

  10. Public versus Private Blockchain • Public blockchain • Open P2P network • Participants can join and leave without notification • Anonymous, untrusted participants • Large-scale distributed ledger • Private blockchain • Closed permissioned network • Identified, trusted participants • Regulated control • Small to medium-scale distributed ledger 10

  11. Background on Consensus Protocols

  12. Consensus • Critical applications • Replication, transaction validation, identity verification, etc. • Major problem of distributed systems • How to reach a consensus, i.e. agree on the same value, in the presence of a number of faulty processes? • Problem statement: given n processes and one leader, how to reach: • Agreement : all correct processes agree on the same value • Validity: if initiator does not fail, all correct processes agree on its value • Types of failures • Crash: the easy case • Malicious (also called Byzantine) • The process gives different values to different observers • FLP (Fischer, Lynch, Paterson) impossibility result • With only one crash failure, termination is not guaranteed • Example: coordinator failure in 2PC 12

  13. The Byzantine Agreement Problem • Suppose an army of the Byzantine Empire • Generals can only communicate by messengers and must establish a common plan to attack the enemy or retreat • A number of these generals may be traitors and vote selectively • Example with 5 generals: 2 support the attack and 2 are in favor of retreat; the 5 th can send an attack vote to the first two and a retreat vote to the other two and then … • Problem formulation • Find an algorithm (consensus) to ensure that loyal generals can agree on a common battle plan 13

  14. Paxos Algorithm • The basis for a family of protocols • [Lamport 1999, ACM Turing Award 2013] • Used to manage large-scale distributed data • Google Spanner & Megastore • IBM SAN Volume Controller • Microsoft Autopilot Cluster Mgr • Ceph (distributed file system) • Neo4J (NoSQL graph DBMS) • Inspired by the functioning of the Parliament of the Paxos Island • The Parliament did work, despite the regular absence of legislators and messages loss 14

  15. Paxos Algorithm • Principle (simplified) • Initialization: a leader is elected by a majority quorum • Replication: leader replicates new updates to the majority quorum • Leader failure: il the leader fails, a new leader is elected • To make progress, at least 1/2 of the participants should be alive • Limitations • Permissioned settings: all participants should be known a priori • Not appropriate for public blockchain • Tolerates only crash failures • Does not deal with malicious nodes • Progress is not guaranteed (FLP impossibility) 15

  16. Practical Byzantine Fault Tolerance (PBFT) • A three-phase protocol [Castro & Liskov 1999] 1. Pre-prepare: a leader broadcasts a value to be committed by other nodes 2. Prepare: the nodes broadcast the values they are about to commit 3. Commit: confirms the committed value when more than 2/3 of the nodes agree in the previous phase • Assessment • Tolerates Byzantine failures • Permissioned settings 16

  17. How the Blockchain Works

  18. Blockchain Concepts • Blockchain • An immutable distributed database, i.e. a log of blocks, which are linked and replicated on full nodes • A block • Digital container for transactions, contracts, property titles, etc. • Transactions are secured using public key encryption • The code of each new block is built on that of the preceding block • Guarantees that it cannot be changed or tampered • The blockchain is viewed by all participants • Enables validating the entries in the blocks • Privacy: users are pseudonomyzed 18

  19. Blockchain Protocol (Nakamoto 2008) 0. Initialization (of a full node ) • Synchronization with the network to obtain the blockchain (185 GB on Q3, 2018) 1. Two users agree on a transaction • Information exchange: wallet addresses, public keys, … 2. Grouping with other transactions in a block and validation of the block (and of the transactions) • Consensus using "mining" 3. Addition of the validated block in the blockchain and replication in the P2P network 4. Transaction confirmation 19

  20. Transaction Owner 1 Owner 2 Owner 3 • The coin owner signs the Transaction Transaction Transaction transaction by 1. Creating a hash value of PK 2 Pk 3 PK 4 • The previous transaction • And the public key (PK) h h h of the next owner 2. Signing it with its secret key (SK) H-val signed H-val signed H-val signed with SK 1 with SK 2 with SK 3 20

  21. Block Management • Transactions are placed into blocks, validated (by checking inputs/outputs, etc.) and linked by their addresses • Size of a bitcoin block = 1 Megabyte Result of mining Block Block H-value Nonce H-value Nonce … … T T T T T T 21

  22. Validation by the Network • Each block is validated by network nodes, the miners , by a consensus protocol (see next) • Problem: accidental fork • As different blocks are validated in parallel, one node can see several candidate chains at any time • Solution: longest chain rule Block 8a Block 7a Block 6a Block 5 Block 6b Transactions in a validated block are provisionally validated; confirmation must be awaited 22

  23. Intentional Fork • Main reasons • To add new features to the blockchain (protocol changes) => new software • To reverse the effects of hacking or catastrophic bugs • Soft versus hard fork • Soft fork: backward compatible • The old software recognizes blocks created with new rules as valid • Makes it easy for attackers • Hard fork • The old software recognizes blocks created with new rules as invalid • Example: the battle between (new) Ethereum and Ethereum Classic • In 2016, after an attack against the Decentralized Autonomous Organization (DAO), a complex smart contract for venture capital, the blockchain forked but without momentum • Battle is more philosophical and ethical than technical 23

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend