Page 1 of 17Free preview · 1–5

About this document

White paper dated September 2, 2014, presenting Tezos as a generic, self-amending crypto-ledger implemented in OCaml. It describes a network shell separated from the blockchain protocol, stakeholder voting for protocol amendments, and a proposed seed protocol combining proof-of-stake with Turing-complete smart contracts. Topics include economic incentives, block creation and signing, random stakeholder selection, contract operations, and fees. The supplied version includes annotations describing changes from the original proposal.

Free preview text

The first 5 pages, shown as text so search engines and readers can find this document.

Page 1

Tezos — a self-amending crypto-ledger White paper L.M Goodman September 2, 2014 Changes between the original paper and our current implementation are indicated in red. “Our argument is not flatly circular, but something like it.” — Willard van Orman Quine Abstract We present Tezos, a generic and self-amending crypto-ledger. Tezos can instantiate any blockchain based ledger. The operations of a regular blockchain are implemented as a purely functional module abstracted into a shell responsible for network operations. Bitcoin, Ethereum, Cryptonote, etc. can all be represented within Tezos by implementing the proper in- terface to the network layer. Most importantly, Tezos supports meta upgrades: the protocols can evolve by amending their own code. To achieve this, Tezos begins with a seed protocol defining a procedure for stakeholders to approve amend- ments to the protocol, including amendments to the voting procedure itself. This is not unlike philosopher Peter Suber’s Nomic[3], a game built around a fully introspective set of rules. In addition, Tezos’s seed protocol is based on a pure proof-of-stake system and supports Turing complete smart contracts. Tezos is imple- mented in OCaml, a powerful functional programming language offering speed, an unambiguous syntax and semantic, and an ecosystem making Tezos a good candidate for formal proofs of correctness. Familiarity with the Bitcoin protocol and basic cryptographic primi- tives are assumed in the rest of this paper. 1

Page 2

Contents 1 Introduction 3 2 Self-amending cryptoledger 3 2.1 Mathematical representation . . . . . . . . . . . . . . . . . . . . 3 2.2 The network shell . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2.1 Clock . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2.2 Chain selection algorithm . . . . . . . . . . . . . . . . . . 4 2.2.3 Network level defense . . . . . . . . . . . . . . . . . . . . 5 2.3 Functional representation . . . . . . . . . . . . . . . . . . . . . . 5 2.3.1 Validating the chain . . . . . . . . . . . . . . . . . . . . . 5 2.3.2 Amending the protocol . . . . . . . . . . . . . . . . . . . . 6 2.3.3 RPC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3 Seed protocol 8 3.1 Economy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.1.1 Coins . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.1.2 Mining and signing rewards . . . . . . . . . . . . . . . . . 8 3.1.3 Lost coins . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.1.4 Amendment rules . . . . . . . . . . . . . . . . . . . . . . . 9 3.2 Proof-of-stake mechanism . . . . . . . . . . . . . . . . . . . . . . 10 3.2.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.2.2 Clock . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.2.3 Generating the random seed . . . . . . . . . . . . . . . . . 11 3.2.4 Follow-the-coin procedure . . . . . . . . . . . . . . . . . . 12 3.2.5 Mining blocks . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.2.6 Signing blocks . . . . . . . . . . . . . . . . . . . . . . . . 13 3.2.7 Weight of the chain . . . . . . . . . . . . . . . . . . . . . 14 3.2.8 Denunciations . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.3 Smart contracts . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.3.1 Contract type . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.3.2 Origination . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.3.3 Transactions . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.3.4 Storage fees . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.3.5 Code . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.3.6 Fees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 4 Conclusion 17 2

Page 3

1 Introduction In the first part of this paper, we will discuss the concept of abstract blockchains and the implementation of a self-amending crypto-ledger. In the second part, we will describe our proposed seed protocol. 2 Self-amending cryptoledger A blockchain protocol can be decomposed into three distinct protocols: - The network protocol discovers blocks and broadcasts transactions. - The transaction protocol specifies what makes a transaction valid. - The consensus protocol forms consensus around a unique chain. Tezos implements a generic network shell. This shell is agnostic to the transaction protocol and to the consensus protocol. We refer to the transaction protocol and the consensus protocol together as a “blockchain protocol”. We will first give a mathematical representation of a blockchain protocol and then describe some of the implementation choices in Tezos. 2.1 Mathematical representation A blockchain protocol is fundamentally a monadic implementation of concurrent mutations of a global state. This is achieved by defining “blocks” as operators acting on this global state. The free monoid of blocks acting on the genesis state forms a tree structure. A global, canonical, state is defined as the minimal leaf for a specified ordering. This suggests the following abstract representation: - Let (S, ) be a totally ordered, countable, set of possible states. - Let ⊘ /2 S represent a special, invalid, state. - Let B  SS[f⊘g be the set of blocks. The set of valid blocks is B \ SS. The total order on S is extended so that 8s 2 S, ⊘ < s. This order deter- mines which leaf in the block tree is considered to be the canonical one. Blocks in B are seen as operators acting on the state. All in all, any blockchain protocol1 (be it Bitcoin, Litecoin, Peercoin, Ethereum, Cryptonote, etc) can be fully determined by the tuple: ( S, , ⊘, B  SS[f⊘g) 1GHOST is an approach which orders the leafs based on properties of the tree. Such an approach is problematic for both theoretical and practical reasons. It is almost always better to emulate it by inserting proofs of mining in the main chain. 3

Page 4

The networking protocol is fundamentally identical for these blockchains. “Mining” algorithms are but an emergent property of the network, given the incentives for block creation. In Tezos, we make a blockchain protocol introspective by letting blocks act on the protocol itself. We can then express the set of protocols recursively as P = {( S, , ⊘, B  S(SP)[f⊘g)} 2.2 The network shell This formal mathematical description doesn’t tell us how to build the block tree. This is the role of the network shell, which acts as an interface between a gossip network and the protocol. The network shell works by maintaining the best chain known to the client. It is aware of three type of objects. The first two are transactions and blocks, which are only propagated through the network if deemed valid. The third are protocols, OCaml modules used to amend the existing protocol. They will be described in more details later on. For now we will focus on transaction and blocks. The most arduous part of the network shell is to protect nodes against denial-of-service attacks. 2.2.1 Clock Every block carries a timestamp visible to the network shell. Blocks that appear to come from the future are buffered if their timestamps are within a few minutes of the system time and rejected otherwise. The protocol design must tolerate reasonable clock drifts in the clients and must assume that timestamps can be falsified. 2.2.2 Chain selection algorithm The shell maintains a single chain rather than a full tree of blocks. This chain is only overwritten if the client becomes aware of a strictly better chain. Maintaining a tree would be more parsimonious in terms of network commu- nications but would be susceptible to denial-of-service attacks where an attacker produces a large number of low-scoring but valid forks. Yet, it remains possible for a node to lie about the score of a given chain, a lie that the client may only uncover after having processed a potentially large number of blocks. However, such a node can be subsequently ignored. Fortunately, a protocol can have the property that low scoring chains exhibit a low rate of block creation. Thus, the client would only consider a few blocks of a “weak” fork before concluding that the announced score was a lie. 4

Page 5

2.2.3 Network level defense In addition, the shell is “defensive”. It attempts to connect to many peers across various IP ranges. It detects disconnected peers and bans malicious nodes. To protect against certain denial of service attacks, the protocol provides the shell with context dependent bounds on the size of blocks and transactions. 2.3 Functional representation 2.3.1 Validating the chain We can efficiently capture almost all the genericity of our abstract blockchain structure with the following OCaml types. To begin with, a block header is defined as: type raw_block_header = { pred: Block_hash.t; header: Bytes.t; operations: Operation_hash.t list; timestamp: float; } We are purposefully not typing the header field more strongly so it can represent arbitrary content. However, we do type the fields necessary for the operation of the shell. These include the hash of the preceding block, a list of operation hashes and a timestamp. In practice, the operations included in a block are transmitted along with the blocks at the network level. Operations themselves are represented as arbitrary blobs. type raw_operation = Bytes.t The state is represented with the help of a Context module which encap- sulates a disk-based immutable key-value store. The structure of a key-value store is versatile and allows us to efficiently represent a wide variety of states. module Context = sig type t type key = string list val get: t -> key -> Bytes.t option Lwt.t val set: t -> key -> Bytes.t -> t Lwt.t val del: t -> key -> t Lwt.t (* ... *) end To avoid blocking on disk operations, the functions use the asynchronous monad Lwt[4]. Note that the operations on the context are purely functional: get uses the option monad rather than throwing an exception while set and del both return a new Context. The Context module uses a combination of memory caching and disk storage to efficiently provide the appearance of an immutable store. We can now define the module type of an arbitrary blockchain protocol: 5

Tags

Doxxly editorial guide

Tezos - a self-amending crypto-ledger: summary, contents and background

This guide helps you understand the scope of Tezos - a self-amending crypto-ledger before or alongside reading the original document. It is based on the catalogue record, credited creator, source, classification and topics shown on this page. It does not replace the original work and does not invent claims about passages that Doxxly cannot verify.

Summary and overview

Tezos - a self-amending crypto-ledger is a 17-page documentcredited to Freya I. Yarrow. White paper dated September 2, 2014, presenting Tezos as a generic, self-amending crypto-ledger implemented in OCaml. It describes a network shell separated from the blockchain protocol, stakeholder voting for protocol amendments, and a proposed seed protocol combining proof-of-stake with Turing-complete smart contracts. Topics include economic incentives, block creation and signing, random stakeholder selection, contract operations, and fees. The supplied version includes annotations describing changes from the original proposal. It appears in the Technology & Security collection, which groups it with other material that readers may use for comparison and further study.

The item can be approached in several ways. A reader looking for a quick orientation can begin with the free five-page preview, inspect the page structure and use the metadata to judge relevance. Someone undertaking deeper research can work through the complete file, search its indexed text, record useful page references and compare its treatment of Tezos, White paper, Blockchain, Self-amending ledger, Protocol governance, Proof-of-stake, Smart contracts, OCaml with the related resources linked below.

Rather than reducing the work to a single claim, this page treats it as a source that should be read in context. The title, creator, publication source, licence and format all help explain what kind of evidence it may offer. Readers should distinguish the original author's statements from Doxxly's catalogue description, and should cite the original edition when using the material in academic, professional or published work.

Key topics and reader takeaways

The catalogue connects this document with Tezos, White paper, Blockchain, Self-amending ledger, Protocol governance, Proof-of-stake, Smart contracts, OCaml. These terms offer practical entry points rather than a substitute for close reading. Start by identifying the definitions, examples, arguments, tables or visual explanations attached to each topic. Then note where the creator draws connections, makes distinctions or moves from background material to a conclusion, recommendation, calculation or narrative development.

A useful reading method is to separate description from interpretation. First record what the item actually presents: names, headings, figures, formulas, quotations or stated propositions. Next consider why those details matter within the whole work. Finally compare them with another source from the same subject area. This process helps turn a long digital file into evidence that can be evaluated rather than merely skimmed.

Table of contents and reading guide

The following is an editorial content guide based on the verified catalogue topics. It is not represented as the original author's formal table of contents. Use it to organise notes while moving through the 17 pages in the player.

  1. Part 1

    Tezos

    Use this section of the reading guide to identify how Tezos appears in Tezos - a self-amending crypto-ledger, note important terms, and connect the subject to the wider purpose of the work.

  2. Part 2

    White paper

    Use this section of the reading guide to identify how White paper appears in Tezos - a self-amending crypto-ledger, note important terms, and connect the subject to the wider purpose of the work.

  3. Part 3

    Blockchain

    Use this section of the reading guide to identify how Blockchain appears in Tezos - a self-amending crypto-ledger, note important terms, and connect the subject to the wider purpose of the work.

  4. Part 4

    Self-amending ledger

    Use this section of the reading guide to identify how Self-amending ledger appears in Tezos - a self-amending crypto-ledger, note important terms, and connect the subject to the wider purpose of the work.

  5. Part 5

    Protocol governance

    Use this section of the reading guide to identify how Protocol governance appears in Tezos - a self-amending crypto-ledger, note important terms, and connect the subject to the wider purpose of the work.

  6. Part 6

    Proof-of-stake

    Use this section of the reading guide to identify how Proof-of-stake appears in Tezos - a self-amending crypto-ledger, note important terms, and connect the subject to the wider purpose of the work.

  7. Part 7

    Smart contracts

    Use this section of the reading guide to identify how Smart contracts appears in Tezos - a self-amending crypto-ledger, note important terms, and connect the subject to the wider purpose of the work.

  8. Part 8

    OCaml

    Use this section of the reading guide to identify how OCaml appears in Tezos - a self-amending crypto-ledger, note important terms, and connect the subject to the wider purpose of the work.

When a heading in the original differs from this guide, follow the original heading in your citation. Page numbers can also vary between editions. Doxxly's direct page field is useful for navigation, but formal references should include the title, creator, source and edition details available in the file itself.

About Freya I. Yarrow

Doxxly credits Freya I. Yarrow as the author or creator of Tezos - a self-amending crypto-ledger. This page does not add an unverified biography, job title or institutional affiliation. The attribution is preserved so readers can distinguish the creator from the hosting library and follow the original record when an external author link is available.

Author context matters because a work reflects a particular purpose, audience and point of view. Before relying on the material, consider what the creator set out to explain, when the source was produced and whether later research or revised guidance should also be consulted. For literature and philosophy, compare translations and editions; for technical material, check whether a newer version has superseded the one shown here.

About the source organisation

The recorded source for this item is tezos.com. Doxxly provides access and discovery tools but does not claim to be the original publisher unless explicitly stated. Source links, creator attribution and the recorded Publicly available file collected for editorial review licence are displayed to help readers assess provenance and permitted use.

Provenance is especially important for reports, standards, presentations and working spreadsheets. Check the original source for amendments, supporting files and current policy. A trustworthy research workflow keeps the source URL with any notes or downloaded copy, verifies important figures against the original, and avoids treating an archived document as automatically current.

Visit tezos.com

How to read and use this document

Begin with the title and opening pages, then use the guide above to decide whether to read sequentially or move to a particular topic. The Doxxly player provides previous and next navigation, a direct page field, zoom steps, fit-to-width and fit-to-page modes, rotation and fullscreen. These controls are useful when a page contains small type, a wide table, an image, a scanned layout or a dense sequence of notes.

The first five pages are open to every visitor. A plan unlocks the complete item and full-document search. Search is best used for distinctive names, technical terms or short phrases; broad words can produce too many possible contexts. When you find a useful passage, read the surrounding pages so that a sentence, chart or formula is not separated from its explanation.

If downloading is enabled, members can obtain the original PDF file. Keep the original format when formulas, slide sequencing, pagination or layout carries meaning. Respect the Publicly available file collected for editorial review terms displayed on this page, and use the rights-report link if you believe the attribution or availability needs review.

Research questions to consider

As you read Tezos - a self-amending crypto-ledger, ask which audience the creator addresses, what problem or idea organises the work, what evidence is presented, and which assumptions remain unstated. Note whether important terms are defined consistently and whether examples represent a broader pattern or a narrow case. For quantitative material, record units, time periods, formulas and data sources. For interpretive material, separate the creator's language from your own summary.

A second set of questions concerns relevance today. Which parts remain durable, which depend on their historical or institutional setting, and what would need confirmation from a newer source? Following the tags and the Technology & Security collection can reveal useful comparisons. Agreement between sources can strengthen confidence, while disagreement can point to changing definitions, methods, evidence or priorities.

Finally, decide what you need from the item: background knowledge, a quotation, a worked example, a model, a visual explanation or a starting bibliography. That purpose should guide the depth of reading and the notes you keep. Doxxly helps locate and navigate the source; careful interpretation remains the reader's responsibility.

Explore more Technology & Security resources

Frequently asked questions about Tezos - a self-amending crypto-ledger

Practical answers about reading, downloading and understanding this document on Doxxly.

More in Technology & Security