DOCSLIB.ORG

"Lockchain 7Hat

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
1 "LOCKCHAIN"ASICS 7HATIt Is (OW ItWORKs AND7HYIT-ATTERS 0RESTON"YRNE-ODERATOR 0ARTNER "YRNE3TORM 0# *AKKI+ERUBO &OUNDER .OVUM#OMMUNICATIONS#ONSULTING 'REG0ICCOLO ,EAD%NGINEER *IGSAW89: 2 3 BLOCKCHAIN BASICS FOR THE LEGAL PRACTITIONER By: Preston J. Byrne, Partner, Byrne & Storm, P.C. 1. BLOCKCHAIN 101 1.1. Bitcoin (proposal published 2008, paper released 2009) was the first true “blockchain” system. A blockchain is a database. Furthermore, it is a peer-to-peer, distributed database. 1.2. A blockchain database differs from other types of distributed databases because it has certain properties which make it fault-tolerant, i.e., even if one computer operating a piece of the blockchain, known as a node, fail, the rest of the network can continue to operate. 1.3. Blockchain fault-tolerance is also sometimes described as being Byzantine fault tolerant, a term of art which means that a blockchain should run even if the failure of a particular component, or a significant number of components, is caused not by an innocent failure but rather by a malicious attacker gaining control of a large number of nodes. 1.4. Blockchain nodes communicate with one another through peer-to-peer networking protocols over TCP-IP, much like the rest of the Internet. However, with blockchains, nodes communicate with each other directly (e.g. as BitTorrent does with the BitTorrent Mainline DHT1) rather than through a central server found at a particular address (e.g. https://facebook.com). These communications may or may not be encrypted. 1.5. Blockchain systems are, generally speaking, designed to communicate economically significant transactional data. Blockchains use cryptography to verify whether transactional communications are valid. If a blockchain node receives a valid communication, it will propagate that valid communication to other network nodes, with the consequence that the copy of the valid communication should eventually be written to the local copy of the receiver’s blockchain and every other copy of the chain. 1.6. If a blockchain receives an invalid communication, the data will be rejected by an honest node and that node will not propagate the transaction to other nodes on the network. receiver and will not appear on the blockchain. Due to this, much like in commercial transactions transactional lawyers work with on a daily basis, a transaction on a blockchain “either completes or doesn’t occur at all, and can’t be left in an intermediate state.”2 1.7. Valid transactions are batched together by individual nodes as they are received. Both the procedure, and end-state, whereby every node on a blockchain comes to an agreement that all of the transactions recorded on a blockchain are valid, are each referred to in the industry by the term “consensus.” Consensus ensures that every blockchain node sees the same data as every other blockchain node. 1.8. This batching procedure, and resultant end-state, whereby every node on a blockchain arrives at an agreement that all of the transactions recorded on a blockchain are valid, are each referred to in the industry by the term “consensus.” Consensus ensures that every blockchain node sees the same data as every other blockchain node. 1 “DHT” means “Distributed Hash Table.” 2 Buchman, Ethan. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains, p. 5. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/9769 4 1.9. A node with permission to validate transactions, sometimes known as a validator node, has the power to decide that a number of transactions it has seen is valid. 1.10. In most blockchain systems, a validator node will batch transactions in a data structure which is known as a block and propose the inclusion of the block of transactions to the other validator nodes. Put another way, it asks the other validator nodes for their approval and consent to the block’s inclusion in the blockchain database. 1.11. If a requisite majority of the other validator nodes agree that the block is also valid, then that block will be published to or adopted by the network, sometimes together with separate cryptographic proof of the validator nodes’ collective consent. As part of this process, the validator nodes will also embed cryptographic proofs in each new block which are linked to certain cryptographic proofs in the previous block. This ensures that any tampering with any data in any prior block in the chain of blocks, or blockchain, will be immediately apparent to an observer looking at the present state of the data. 1.12. Once a block is agreed and published, it is appended to the end of the blockchain and the process begins anew, with new transactions being received by validator nodes and, in due time, being proposed to the network to form new blocks. How frequently this procedure repeats itself is dependent on the underlying architecture used by the blockchain in question. Currently there is a broad range, with systems like Bitcoin publishing new blocks that the network agrees on, i.e. confirm a block, on average every six minutes, and other systems, e.g. Tendermint, being able to confirm blocks once per second. 2. CRYPTOCURRENCIES: THE FIRST BLOCKCHAIN APPLICATION 2.1. Examples of virtual currencies 2.1.1. Bitcoin. The first cryptocurrency, based on proof of work consensus. 2.1.2. Ripple or Stellar. Other early cryptocurrencies, based on proof of stake consensus. 2.1.3. Dogecoin. A so-called “altcoin,” one of thousands of altcoins, with few technical differences between itself and Bitcoin. Altcoins’ focus can be entirely arbitrary; in Dogecoin’s case, the coin is themed around a cute Shiba Inu dog. 2.1.4. Ethereum. An altcoin that allows coin holders to upload scripts, known as “smart contracts,” on the blockchain. “Smart contracts” are not smart and are not contracts, but allow users of cryptocurrency systems to model financial contracts (such as escrow, collateralized lending, or prediction markets) in blockchain code which settle entirely on-chain. Systems like Tezos or Eos are also smart contract systems. 2.2. Cryptocurrencies are not all the same 2.2.1. Most major cryptocurrencies use the same elliptic curve cryptography for signing transactions, but do not encrypt transactions or data. Exceptions to the rule include ZCash and Monero, which do encrypt transactions and data. 2.2.2. Most major cryptocurrency protocols are licensed for free public use under open-source licenses. MIT, Apache 2.0, and GPL 3.0 are popular licensing schemes. 2 #66285598_v1 5 2.2.3. Cryptocurrencies differ from each other mostly on (a) how they achieve consensus, (b) what type of data they allow their users to communicate, and (c) performance characteristics. 2.2.4. Proof of work cryptocurrencies use a competitive game that requires the consumption of vast quantities of electricity to determine block-by-block consensus through a process known as mining. Bitcoin and Ethereum are examples of proof of work cryptocurrencies. 2.2.5. Proof of stake cryptocurrencies allow holders of existing quantities of the native cryptocurrency to vote on which transaction should be included in the next block through a process known as staking. Tendermint and NXT are examples of proof of stake cryptocurrencies. There are variations on proof of stake, such as “delegated proof of stake,” utilized by cryptocurrencies such as Eos. 2.2.6. Developers are constantly looking for new and better ways to achieve consensus on blockchain networks, such as the “proof of space and time” method being used by Chia (founded by Bram Cohen, founder of BitTorrent). 2.2.7. Transaction speeds vary widely. Because cryptocurrencies are stateful systems, i.e. blockchain networks store all data that has ever been sent to them, developers of these systems need to make tradeoffs between performance and scalability. Where a system is designed to handle high transaction throughputs and data-heavy transactions, such as Ethereum (14 transactions per second/TPS plus smart contract code), the blockchain will swell in size, or bloat, making it difficult for ordinary users to run blockchain nodes. 2.2.8. “How decentralized is it?” …is never an easy question to answer. When this term, “decentralization,” comes up, it can mean one of a number of things, including (a) how large and distributed the network of nodes is for a given network, (b) the chosen consensus mechanism being used by a given network, (c) the distribution model for coins issued on/by a given network, or (d) a range of other factors the market latches onto from time to time. The term lacks a concrete legal or technical definition, although senior officials of the U.S. Securities and Exchange Commission have tried to use the concept to determine the applicability of U.S. securities laws to cryptocurrency systems.3 2.3. Major legal issues arising from the cryptocurrency context 2.3.1. Anti money laundering/money transmitter licensing is central to any cryptocurrency business. 2.3.1.1. Small-time Bitcoin exchangers have been charged with operating unlicensed money transmission businesses under 18 U.S.C. § 1960. 3 Hinman, William. Digital Asset Transactions: When Howey met Gary (Plastic.) 14 June 2018, https://www.sec.gov/news/speech/speech-hinman-061418 6 2.3.1.2. Required reading: FinCEN 2013 Guidance defining “users,” “administrators” and “exchangers”4 of cryptocurrency systems 2.3.1.3. Note “Layer 2” solutions like Lightning Network do not eliminate money transmission concerns and require a standalone analysis depending on the design of the proposed application. 2.3.2. Securities regulation: a prevailing view among venture capitalists and others in the 2015-17 period was that securities regulation would be swept aside like municipal taxi regulations were swept aside by Uber.
Load more

Recommended publications
  • CRYPTOCURRENCY: a PRIMER Accept Bitcoin3—Including Amazon.Com, What Is Cryptocurrency? Target, Paypal, Ebay, Dell, and Home
    CRYPTOCURRENCY: A PRIMER accept bitcoin3—including Amazon.com, What is cryptocurrency? Target, PayPal, eBay, Dell, and Home Depot—with anywhere from 80,000 to There is no one standard definition of 220,000 transactions occurring per day, cryptocurrency.1 At the most basic level representing over $50 million in estimated cryptocurrency—or digital currency or daily volume.4 virtual currency—is a medium of exchange that functions like money (in Cryptocurrencies allow for increased that it can be exchanged for goods and market efficiencies and reduced services) but, unlike traditional currency, transaction costs. At base, is untethered to, and independent from, cryptocurrency transactions are: national borders, central banks, sovereigns, or fiats. In other words, it . Private—no personal information is exists completely in the virtual world, required to complete a transaction;5 traded on multiple global platforms. These currencies are designed to . Fast—they are settled almost incorporate and exchange digital instantaneously, unlike credit card information through a process made transactions or wire transfers that possible by principles of cryptography, require days; which makes transactions secure and . Irrevocable—because transactions are verifiable. The most well-known settled almost immediately, there are cryptocurrency is bitcoin, which was no resulting chargebacks or possibility created back in 2009 and which still for disputes between buyer and seller; dominates the virtual currency market today.2 . Inexpensive—transaction costs are generally less than 1% if an intermediary is used, rather than the Why do they matter? customary credit card processing fee of roughly 2.5%; and Cryptocurrency is relevant to most . Global—neither buyer nor seller businesses and financial firms.
    [Show full text]
  • Chia Proof of Space Construction
    Chia Proof of Space Construction Introduction In order to create a secure blockchain consensus algorithm using disk space, a Proof of Space is scheme is necessary. This document describes a practical contruction of Proofs of Space, based on Beyond Hellman’s Time- Memory Trade-Offs with Applications to Proofs of Space [1]. We use the techniques laid out in that paper, extend it from 2 to 7 tables, and tweak it to make it efficient and secure, for use in the Chia Blockchain. The document is divided into three main sections: What (mathematical definition of a proof of space), How (how to implement proof of space), and Why (motivation and explanation of the construction) sections. The Beyond Hellman paper can be read first for more mathematical background. Chia Proof of Space Construction Introduction What is Proof of Space? Definitions Proof format Proof Quality String Definition of parameters, and M, f, A, C functions: Parameters: f functions: Matching function M: A′ function: At function: Collation function C: How do we implement Proof of Space? Plotting Plotting Tables (Concepts) Tables Table Positions Compressing Entry Data Delta Format ANS Encoding of Delta Formatted Points Stub and Small Deltas Parks Checkpoint Tables Plotting Algorithm Final Disk Format Full algorithm Phase 1: Forward Propagation Phase 2: Backpropagation Phase 3: Compression Phase 4: Checkpoints Sort on Disk Plotting Performance Space Required Proving Proof ordering vs Plot ordering Proof Retrieval Quality String Retrieval Proving Performance Verification Construction
    [Show full text]
  • IPFS and Friends: a Qualitative Comparison of Next Generation Peer-To-Peer Data Networks Erik Daniel and Florian Tschorsch
    1 IPFS and Friends: A Qualitative Comparison of Next Generation Peer-to-Peer Data Networks Erik Daniel and Florian Tschorsch Abstract—Decentralized, distributed storage offers a way to types of files [1]. Napster and Gnutella marked the beginning reduce the impact of data silos as often fostered by centralized and were followed by many other P2P networks focusing on cloud storage. While the intentions of this trend are not new, the specialized application areas or novel network structures. For topic gained traction due to technological advancements, most notably blockchain networks. As a consequence, we observe that example, Freenet [2] realizes anonymous storage and retrieval. a new generation of peer-to-peer data networks emerges. In this Chord [3], CAN [4], and Pastry [5] provide protocols to survey paper, we therefore provide a technical overview of the maintain a structured overlay network topology. In particular, next generation data networks. We use select data networks to BitTorrent [6] received a lot of attention from both users and introduce general concepts and to emphasize new developments. the research community. BitTorrent introduced an incentive Specifically, we provide a deeper outline of the Interplanetary File System and a general overview of Swarm, the Hypercore Pro- mechanism to achieve Pareto efficiency, trying to improve tocol, SAFE, Storj, and Arweave. We identify common building network utilization achieving a higher level of robustness. We blocks and provide a qualitative comparison. From the overview, consider networks such as Napster, Gnutella, Freenet, BitTor- we derive future challenges and research goals concerning data rent, and many more as first generation P2P data networks, networks.
    [Show full text]
  • Evaluating Inclusion, Equality, Security, and Privacy in Pseudonym Parties and Other Proofs of Personhood
    Identity and Personhood in Digital Democracy: Evaluating Inclusion, Equality, Security, and Privacy in Pseudonym Parties and Other Proofs of Personhood Bryan Ford Swiss Federal Institute of Technology in Lausanne (EPFL) November 5, 2020 Abstract of enforced physical security and privacy can address the coercion and vote-buying risks that plague today’s E- Digital identity seems at first like a prerequisite for digi- voting and postal voting systems alike. We also examine tal democracy: how can we ensure “one person, one vote” other recently-proposed approaches to proof of person- online without identifying voters? But the full gamut of hood, some of which offer conveniencessuch as all-online digital identity solutions – e.g., online ID checking, bio- participation. These alternatives currently fall short of sat- metrics, self-sovereign identity, and social/trust networks isfying all the key digital personhood goals, unfortunately, – all present severe flaws in security, privacy, and trans- but offer valuable insights into the challenges we face. parency, leaving users vulnerable to exclusion, identity loss or theft, and coercion. These flaws may be insur- mountable because digital identity is a cart pulling the Contents horse. We cannot achieve digital identity secure enough to support the weight of digital democracy, until we can 1 Introduction 2 build it on a solid foundation of digital personhood meet- ing key requirements. While identity is about distinguish- 2 Goals for Digital Personhood 4 ing one person from another through attributes or affilia- tions, personhood is about giving all real people inalien- 3 Pseudonym Parties 5 able digital participation rights independent of identity, 3.1 Thebasicidea.
    [Show full text]
  • Asymmetric Proof-Of-Work Based on the Generalized Birthday Problem
    Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem Alex Biryukov Dmitry Khovratovich University of Luxembourg University of Luxembourg [email protected] [email protected] Abstract—The proof-of-work is a central concept in modern Long before the rise of Bitcoin it was realized [20] that cryptocurrencies and denial-of-service protection tools, but the the dedicated hardware can produce a proof-of-work much requirement for fast verification so far made it an easy prey for faster and cheaper than a regular desktop or laptop. Thus the GPU-, ASIC-, and botnet-equipped users. The attempts to rely on users equipped with such hardware have an advantage over memory-intensive computations in order to remedy the disparity others, which eventually led the Bitcoin mining to concentrate between architectures have resulted in slow or broken schemes. in a few hardware farms of enormous size and high electricity In this paper we solve this open problem and show how to consumption. An advantage of the same order of magnitude construct an asymmetric proof-of-work (PoW) based on a compu- is given to “owners” of large botnets, which nowadays often tationally hard problem, which requires a lot of memory to gen- accommodate hundreds of thousands of machines. For prac- erate a proof (called ”memory-hardness” feature) but is instant tical DoS protection, this means that the early TLS puzzle to verify. Our primary proposal Equihash is a PoW based on the schemes [8], [17] are no longer effective against the most generalized birthday problem and enhanced Wagner’s algorithm powerful adversaries.
    [Show full text]
  • Lab 5: Bittorrent Client Implementation
    Lab 5: BitTorrent Client Implementation Due: Nov. 30th at 11:59 PM Milestone: Nov. 19th during Lab Overview In this lab, you and your lab parterner will develop a basic BitTorrent client that can, at minimal, exchange a file between multiple peers, and at best, function as a full feature BitTorrent Client. The programming in this assignment will be in C requiring standard sockets, and thus you will not need to have root access. You should be able to develop your code on any CS lab machine or your personal machine, but all code will be tested on the CS lab. Deliverable Your submission should minimally include the following programs and files: • REDME • Makefile • bencode.c|h • bt lib.c|h • bt setup.c|h • bt client • client trace.[n].log • sample torrent.torrent Your README file should contain a short header containing your name, username, and the assignment title. The README should additionally contain a short description of your code, tasks accomplished, and how to compile, execute, and interpret the output of your programs. Your README should also contain a list of all submitted files and code and the functionality implemented in different code files. This is a large assignment, and this will greatly aid in grading. As always, if there are any short answer questions in this lab write-up, you should provide well marked answers in the README, as well as indicate that you’ve completed any of the extra credit (so that I don’t forget to grade it). Milestones The entire assignment will be submitted and graded, but your group will also hold a milestone meeting to receive feedback on your current implementation.
    [Show full text]
  • Virtual Currency
    Office of Legislative Research Research Report December 12, 2014 2014-R-0290 BITCOINS - VIRTUAL CURRENCY By: Michelle Kirby, Associate Analyst ISSUE BITCOINS The use of bitcoins as virtual currency, the laws that Bitcoin is a form of virtual or digital currency. It is govern it, and other states’ attempts to regulate it. not legal tender and is not backed by any This report updates OLR Report 2014-R-0050. government. Federal agencies such as SUMMARY the U.S. Treasury “Bitcoin” is a form of virtual or digital currency, that Department, the Government Accountability allows financial transactions to be conducted on a Office, the Internal network using computer codes. It is a form of Revenue Service, and the exchange that operates like a currency but does not Congressional Research Services have issued have all the attributes of real currency. guidance on how existing laws apply to virtual There are no federal or state laws that specifically currency activities. govern bitcoins. However, many existing laws apply to A proposed federal law certain virtual currency activities. calls for a five-year moratorium on bitcoin The U.S. Treasury Department’s Financial Crimes regulation. Enforcement Network (FinCEN) has provided guidance New York has proposed indicating that, under federal law, a virtual currency regulation that would, user is not a money transmitter and is therefore not among other things, subject to the registration, reporting, and require firms engaged in virtual currency to have a recordkeeping regulations for money services BitLicense. businesses (MSBs). However, virtual currency California has enacted a administrators and exchangers may be regulated as law that allows the use of money transmitters but should not be considered alternative currency.
    [Show full text]
  • A Decentralized Cloud Storage Network Framework
    Storj: A Decentralized Cloud Storage Network Framework Storj Labs, Inc. October 30, 2018 v3.0 https://github.com/storj/whitepaper 2 Copyright © 2018 Storj Labs, Inc. and Subsidiaries This work is licensed under a Creative Commons Attribution-ShareAlike 3.0 license (CC BY-SA 3.0). All product names, logos, and brands used or cited in this document are property of their respective own- ers. All company, product, and service names used herein are for identification purposes only. Use of these names, logos, and brands does not imply endorsement. Contents 0.1 Abstract 6 0.2 Contributors 6 1 Introduction ...................................................7 2 Storj design constraints .......................................9 2.1 Security and privacy 9 2.2 Decentralization 9 2.3 Marketplace and economics 10 2.4 Amazon S3 compatibility 12 2.5 Durability, device failure, and churn 12 2.6 Latency 13 2.7 Bandwidth 14 2.8 Object size 15 2.9 Byzantine fault tolerance 15 2.10 Coordination avoidance 16 3 Framework ................................................... 18 3.1 Framework overview 18 3.2 Storage nodes 19 3.3 Peer-to-peer communication and discovery 19 3.4 Redundancy 19 3.5 Metadata 23 3.6 Encryption 24 3.7 Audits and reputation 25 3.8 Data repair 25 3.9 Payments 26 4 4 Concrete implementation .................................... 27 4.1 Definitions 27 4.2 Peer classes 30 4.3 Storage node 31 4.4 Node identity 32 4.5 Peer-to-peer communication 33 4.6 Node discovery 33 4.7 Redundancy 35 4.8 Structured file storage 36 4.9 Metadata 39 4.10 Satellite 41 4.11 Encryption 42 4.12 Authorization 43 4.13 Audits 44 4.14 Data repair 45 4.15 Storage node reputation 47 4.16 Payments 49 4.17 Bandwidth allocation 50 4.18 Satellite reputation 53 4.19 Garbage collection 53 4.20 Uplink 54 4.21 Quality control and branding 55 5 Walkthroughs ...............................................
    [Show full text]
  • Virtual Currencies: Growing Regulatory Framework and Challenges in the Emerging Fintech Ecosystem V
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by University of North Carolina School of Law NORTH CAROLINA BANKING INSTITUTE Volume 21 | Issue 1 Article 10 3-1-2017 Virtual Currencies: Growing Regulatory Framework and Challenges in the Emerging Fintech Ecosystem V. Gerard Comizio Follow this and additional works at: http://scholarship.law.unc.edu/ncbi Part of the Banking and Finance Law Commons Recommended Citation V. G. Comizio, Virtual Currencies: Growing Regulatory Framework and Challenges in the Emerging Fintech Ecosystem, 21 N.C. Banking Inst. 131 (2017). Available at: http://scholarship.law.unc.edu/ncbi/vol21/iss1/10 This Article is brought to you for free and open access by Carolina Law Scholarship Repository. It has been accepted for inclusion in North Carolina Banking Institute by an authorized editor of Carolina Law Scholarship Repository. For more information, please contact [email protected]. VIRTUAL CURRENCIES: GROWING REGULATORY FRAMEWORK AND CHALLENGES IN THE EMERGING FINTECH ECOSYSTEM V. GERARD COMIZIO* I. INTRODUCTION In the context of a widely publicized explosion of new technology and innovation designed to disrupt the marketplace of traditional financial institutions in delivering financial services, the number of financial technology (“fintech”) companies in the United States and United Kingdom alone has grown to more than 4,000 in recent years. Further, investment in this sector has grown from $1.8 billion to $24 billion worldwide in just the last five years.1 The financial services industry is experiencing rapid technological changes as it seeks to meet and anticipate business opportunities and needs, consumer demands and expectations, and demographic trends.
    [Show full text]
  • Sok: Tools for Game Theoretic Models of Security for Cryptocurrencies
    SoK: Tools for Game Theoretic Models of Security for Cryptocurrencies Sarah Azouvi Alexander Hicks Protocol Labs University College London University College London Abstract form of mining rewards, suggesting that they could be prop- erly aligned and avoid traditional failures. Unfortunately, Cryptocurrencies have garnered much attention in recent many attacks related to incentives have nonetheless been years, both from the academic community and industry. One found for many cryptocurrencies [45, 46, 103], due to the interesting aspect of cryptocurrencies is their explicit consid- use of lacking models. While many papers aim to consider eration of incentives at the protocol level, which has motivated both standard security and game theoretic guarantees, the vast a large body of work, yet many open problems still exist and majority end up considering them separately despite their current systems rarely deal with incentive related problems relation in practice. well. This issue arises due to the gap between Cryptography Here, we consider the ways in which models in Cryptog- and Distributed Systems security, which deals with traditional raphy and Distributed Systems (DS) can explicitly consider security problems that ignore the explicit consideration of in- game theoretic properties and incorporated into a system, centives, and Game Theory, which deals best with situations looking at requirements based on existing cryptocurrencies. involving incentives. With this work, we offer a systemati- zation of the work that relates to this problem, considering papers that blend Game Theory with Cryptography or Dis- Methodology tributed systems. This gives an overview of the available tools, and we look at their (potential) use in practice, in the context As we are covering a topic that incorporates many different of existing blockchain based systems that have been proposed fields coming up with an extensive list of papers would have or implemented.
    [Show full text]
  • Blockchain and The
    NOTES ACKNOWLEDGMENTS INDEX Notes Introduction 1. The manifesto dates back to 1988. See Timothy May, “The Crypto Anarchist Manifesto” (1992), https:// www . activism . net / cypherpunk / crypto - anarchy . html. 2. Ibid. 3. Ibid. 4. Ibid. 5. Ibid. 6. Timothy May, “Crypto Anarchy and Virtual Communities” (1994), http:// groups . csail . mit . edu / mac / classes / 6 . 805 / articles / crypto / cypherpunks / may - virtual - comm . html. 7. Ibid. 8. For example, as we wi ll describe in more detail in Chapter 1, the Bitcoin blockchain is currently stored on over 6,000 computers in eighty- nine jurisdictions. See “Global Bitcoin Node Distribution,” Bitnodes, 21 . co, https:// bitnodes . 21 . co / . Another large blockchain- based network, Ethereum, has over 12,000 nodes, also scattered across the globe. See Ethernodes, https:// www . ethernodes . org / network / 1. 9. See note 8. 10. Some blockchains are not publicly accessible (for more on this, see Chapter 1). These blockchains are referred to as “private blockchains” and are not the focus of this book. 11. See Chapter 1. 12. The Eu ro pean Securities and Market Authority, “Discussion Paper: The Dis- tributed Ledger Technology Applied to Securities Markets,” ESMA / 2016 / 773, June 2, 2016: at 17, https:// www . esma . europa . eu / sites / default / files / library / 2016 - 773 _ dp _ dlt . pdf. 213 214 NOTES TO PAGES 5–13 13. The phenomena of order without law also has been described in other con- texts, most notably by Robert Ellickson in his seminal work Order without Law (Cambridge, MA: Harvard University Press, 1994). 14. Joel Reidenberg has used the term “lex informatica” to describe rules imple- mented by centralized operators online.
    [Show full text]
  • Proofs of Replication Are Also Relevant in the Private-Verifier Setting of Proofs of Data Replication
    PoReps: Proofs of Space on Useful Data Ben Fisch Stanford University, Protocol Labs Abstract A proof-of-replication (PoRep) is an interactive proof system in which a prover defends a publicly verifiable claim that it is dedicating unique resources to storing one or more retrievable replicas of a data file. In this sense a PoRep is both a proof of space (PoS) and a proof of retrievability (PoR). This paper establishes a foundation for PoReps, exploring both their capabilities and their limitations. While PoReps may unconditionally demonstrate possession of data, they fundamentally cannot guarantee that the data is stored redundantly. Furthermore, as PoReps are proofs of space, they must rely either on rational time/space tradeoffs or timing bounds on the online prover's runtime. We introduce a rational security notion for PoReps called -rational replication based on the notion of an -Nash equilibrium, which captures the property that a server does not gain any significant advantage by storing its data in any other (non-redundant) format. We apply our definitions to formally analyze two recently proposed PoRep constructions based on verifiable delay functions and depth robust graphs. Lastly, we reflect on a notable application of PoReps|its unique suitability as a Nakamoto consensus mechanism that replaces proof-of-work with PoReps on real data, simultaneously incentivizing and subsidizing the cost of file storage. 1 Introduction A proof-of-replication (PoRep) builds on the two prior concepts of proofs-of-retrievability (PoR) [30] and proofs-of-space (PoS) [24]. In the former a prover demonstrates that it can retrieve a file and in the latter the prover demonstrates that it is using some minimum amount of space to store information.
    [Show full text]