{"corpus":"Blockchain Lab Research Corpus","licence":null,"note":"Metadata only. Paper text is not included. Attribute Blockchain Lab if you republish this catalogue. The catalogue is not a licence to the papers.","count":127,"papers":[{"document_id":"BLC-PAPER-0001","slug":"bitcoin","title":"Bitcoin: A Peer-to-Peer Electronic Cash System","authors":"Satoshi Nakamoto","year":2008,"date_label":"31 October 2008, the date of the cryptography mailing-list post. The PDF fetched from bitcoin.org does not print that date on the first page.","publisher":"Satoshi Nakamoto","paper_type":"Design paper","category":"Digital cash","topics":["Digital cash","Proof of work","Double spend"],"source_url":"https://bitcoin.org/bitcoin.pdf","source_label":"bitcoin.org","legacy_pdf_path":"/pdf/bitcoin.pdf","sha256":"b1674191a88ec5cdd733e4240a81803105dc412d6c6708d53ab94fc248f4f553","sha256_note":"SHA-256 of the PDF fetched from https://bitcoin.org/bitcoin.pdf on 1 October 2026 (184,292 bytes). This is not a hash of the historic library file at /pdf/bitcoin.pdf. That file is not stored in this build and was not byte-compared.","version":"File served by bitcoin.org on 1 October 2026","doi":null,"rights_status":"Rights uncertain","source_status":"Official source, and a historic library path","use_status":"Download from the publisher. The legacy path remains. Full text is not republished here.","licence":null,"licence_label":"No licence notice on the first page of the file fetched from bitcoin.org. Not marked public domain.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The paper proposes that a public chain of hash-linked blocks, and a race to spend computation, can order electronic-cash payments without a bank in the middle.","canonical_url":"https://blockchainlab.com/research/corpus/papers/bitcoin","record_url":"https://blockchainlab.com/research/corpus/papers/bitcoin","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PAPER-0002","slug":"ethereum","title":"Ethereum: A Next-Generation Smart Contract and Decentralized Application Platform","authors":"Vitalik Buterin","year":2014,"date_label":"Circulating white paper, 2014. Drafts exist from late 2013. This record follows the historic library file, not the living HTML on ethereum.org.","publisher":"Vitalik Buterin","paper_type":"Design paper","category":"Contracts","topics":["Smart contracts","General-purpose chain"],"source_url":"https://ethereum.org/en/whitepaper/","source_label":"ethereum.org white paper (current HTML, not the historic PDF)","legacy_pdf_path":"/pdf/Ethereum_white_paper-a_next_generation_smart_contract_and_decentralized_application_platform-vitalik-buterin.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic library PDF of Buterin's white paper. The publisher's current page is HTML and has moved on.","doi":null,"rights_status":"Rights uncertain","source_status":"Publisher's current page, plus a historic library path","use_status":"Read the publisher's page or the legacy PDF. Full text is not republished here.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Buterin's white paper argues that a chain can do more than move a native coin. It can run programs whose results land in shared state.","canonical_url":"https://blockchainlab.com/research/corpus/papers/ethereum","record_url":"https://blockchainlab.com/research/corpus/papers/ethereum","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PAPER-0003","slug":"ouroboros","title":"Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol","authors":"Aggelos Kiayias, Alexander Russell, Bernardo David, Roman Oliynykov","year":2017,"date_label":"IACR ePrint 2016/889. A proceedings version followed. This record is the ePrint, not a later Cardano paper.","publisher":"IACR ePrint","paper_type":"Design paper","category":"Consensus","topics":["Proof of stake","Slot leaders"],"source_url":"https://eprint.iacr.org/2016/889.pdf","source_label":"IACR ePrint 2016/889","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"ePrint 2016/889. Praos, Genesis, and later network software are other documents.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. Read the PDF at IACR.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Ouroboros elects slot leaders from stake and states the security argument in a synchronous model. Cardano is a later network. A staking rate is not part of the paper.","canonical_url":"https://blockchainlab.com/whitepaper/ouroboros","record_url":"https://blockchainlab.com/research/corpus/papers/ouroboros","study_url":"https://blockchainlab.com/whitepaper/ouroboros","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PAPER-0004","slug":"lightning","title":"The Bitcoin Lightning Network: Scalable Off-Chain Instant Payments","authors":"Joseph Poon and Thaddeus Dryja","year":2016,"date_label":"2016 draft. Cite the PDF you opened. Versions of this paper differ.","publisher":"Joseph Poon and Thaddeus Dryja","paper_type":"Design paper","category":"Scaling","topics":["Payment channels","Bitcoin"],"source_url":"https://lightning.network/lightning-network-paper.pdf","source_label":"lightning.network paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"PDF linked from lightning.network. Not a specification of today's channel implementations.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. Read the PDF at the publisher.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Lightning is a payment channel on Bitcoin. The base chain is the court when a party cheats or leaves, not the till for every payment.","canonical_url":"https://blockchainlab.com/whitepaper/lightning","record_url":"https://blockchainlab.com/research/corpus/papers/lightning","study_url":"https://blockchainlab.com/whitepaper/lightning","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PAPER-0005","slug":"interledger","title":"A Protocol for Interledger Payments","authors":"Stefan Thomas and Evan Schwartz","year":2015,"date_label":"2015, as the Interledger Foundation dates the protocol's creation. The PDF's first page, as checked for this record, does not print a full citation date.","publisher":"Stefan Thomas and Evan Schwartz","paper_type":"Design paper","category":"Interoperability","topics":["Cross-ledger payments","Escrow","Connectors"],"source_url":"https://interledger.org/documents/interledger.pdf","source_label":"interledger.org PDF","legacy_pdf_path":"/pdf/interledger.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"The white paper. ILPv4 and later RFCs are other documents.","doi":null,"rights_status":"Rights uncertain","source_status":"Official PDF, and a historic library path","use_status":"Download from the publisher. The legacy path remains. Full text is not republished here.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The paper proposes payments that cross ledgers by escrow, through connectors, without one blockchain ordering every transfer.","canonical_url":"https://blockchainlab.com/research/corpus/papers/interledger","record_url":"https://blockchainlab.com/research/corpus/papers/interledger","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PAPER-0006","slug":"maker-dai","title":"The Dai Stablecoin System","authors":"MakerDAO","year":2017,"date_label":"2017, as cited by the study. Later multi-collateral systems are other documents.","publisher":"MakerDAO","paper_type":"Design paper","category":"Credit and stable value","topics":["Collateralised stable value","Vaults"],"source_url":"https://makerdao.com/whitepaper/","source_label":"MakerDAO white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"The 2017 Dai design in the study's citation. Not a description of a later module.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2017 paper describes Dai as a liability minted against overcollateralised vaults, kept near a dollar target by a fee, an auction, and an emergency stop.","canonical_url":"https://blockchainlab.com/whitepaper/maker-dai","record_url":"https://blockchainlab.com/research/corpus/papers/maker-dai","study_url":"https://blockchainlab.com/whitepaper/maker-dai","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PAPER-0007","slug":"terra-money","title":"Terra Money: Stability and Adoption","authors":"Do Kwon","year":2019,"date_label":"2019. The study names Do Kwon. Other names appear on some circulating copies and are not added here until reconciled.","publisher":"Terra","paper_type":"Failure case","category":"Credit and stable value","topics":["Stable value","Seigniorage"],"source_url":"https://agora.terra.money/","source_label":"Terra research archive, as cited by the study","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"The 2019 design paper. Not a description of any later chain that reused the name.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. Not a design to copy.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2019 paper proposes fiat-pegged tokens stabilised by an arbitrage against a second, volatile token. This library keeps it as a failure case, not as a blueprint.","canonical_url":"https://blockchainlab.com/whitepaper/terra-money","record_url":"https://blockchainlab.com/research/corpus/papers/terra-money","study_url":"https://blockchainlab.com/whitepaper/terra-money","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PAPER-0008","slug":"chainlink","title":"Chainlink: A Decentralized Oracle Network","authors":"Steve Ellis, Ari Juels, Sergey Nazarov","year":2017,"date_label":"2017","publisher":"Chainlink","paper_type":"Design paper","category":"Data and agents","topics":["Oracles","Off-chain data"],"source_url":"https://chain.link/whitepaper","source_label":"Chainlink white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"The 2017 oracle-network paper. A single operator feed is a narrower object.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The paper describes independent nodes that fetch a fact from outside a chain, aggregate it, and deliver a signed result, with a reputation and penalty story around the nodes.","canonical_url":"https://blockchainlab.com/whitepaper/chainlink","record_url":"https://blockchainlab.com/research/corpus/papers/chainlink","study_url":"https://blockchainlab.com/whitepaper/chainlink","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PAPER-0009","slug":"filecoin-2017","title":"Filecoin: A Decentralized Storage Network","authors":"Protocol Labs","year":2017,"date_label":"July 2017","publisher":"Protocol Labs","paper_type":"Design paper","category":"Storage and networks","topics":["Storage market","Proof of replication"],"source_url":"https://www.filecoin.io/assets/documents/filecoin.pdf","source_label":"Filecoin 2017 paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"July 2017 paper. The historic filecoin.pdf is an earlier sketch and a different record.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The July 2017 paper specifies a storage market and a retrieval market. Miners are supposed to prove they still hold a replica, and to keep proving it.","canonical_url":"https://blockchainlab.com/whitepaper/filecoin-2017","record_url":"https://blockchainlab.com/research/corpus/papers/filecoin-2017","study_url":"https://blockchainlab.com/whitepaper/filecoin-2017","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PAPER-0010","slug":"corda","title":"Corda: An Introduction","authors":"Richard Gendal Brown, James Carlyle, Ian Grigg, Mike Hearn","year":2016,"date_label":"August 2016","publisher":"R3","paper_type":"Design paper","category":"Institutional ledger","topics":["Permissioned ledger","Known parties"],"source_url":"https://www.researchgate.net/publication/308636477_Corda_An_Introduction","source_label":"ResearchGate record of the August 2016 introduction","legacy_pdf_path":"/pdf/corda-introductory-whitepaper-final.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"August 2016 introduction. R3 says the 2018 platform paper supersedes it.","doi":"10.13140/RG.2.2.30487.37284","rights_status":"Rights uncertain","source_status":"Published record, and a historic library path","use_status":"Read the publisher's record. The legacy path remains. Full text is not republished here.","licence":null,"licence_label":"ResearchGate marks the upload as possibly subject to copyright. No redistribution licence is recorded.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The introduction argues for a ledger of deals between identified institutions, where the parties to a deal hold the data, rather than a global broadcast of every transaction.","canonical_url":"https://blockchainlab.com/research/corpus/papers/corda","record_url":"https://blockchainlab.com/research/corpus/papers/corda","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0001","slug":"ethereum-yellow-paper","title":"Ethereum: A Secure Decentralised Generalised Transaction Ledger (EIP-150 revision)","authors":"Gavin Wood","year":2016,"date_label":"EIP-150 revision, which is how the historic library names the file. The living yellow paper has moved on.","publisher":"Gavin Wood","paper_type":"Protocol specification","category":"Contracts","topics":["Ethereum","Specification"],"source_url":"https://ethereum.github.io/yellowpaper/paper.pdf","source_label":"Current yellow paper (later document)","legacy_pdf_path":"/pdf/paper2.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic library file described as the EIP-150 revision. Not byte-compared with the living yellow paper.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path. The current yellow paper is a later file.","use_status":"Legacy path remains. Do not treat the current yellow paper as this file.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The historic library holds Wood's yellow paper at the EIP-150 revision, as a specification of the ledger rather than Buterin's white paper.","canonical_url":"https://blockchainlab.com/research/corpus/papers/ethereum-yellow-paper","record_url":"https://blockchainlab.com/research/corpus/papers/ethereum-yellow-paper","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0002","slug":"ripple-consensus","title":"The Ripple Protocol Consensus Algorithm","authors":"David Schwartz, Noah Youngs, and Arthur Britto","year":2014,"date_label":"2014, as commonly cited for this title. Not re-read from the file bytes in this build.","publisher":"Ripple","paper_type":"Design paper","category":"Consensus","topics":["Consensus","Known validators"],"source_url":"https://ripple.com/files/ripple_consensus_whitepaper.pdf","source_label":"Commonly cited publisher PDF","legacy_pdf_path":"/pdf/ripple_consensus_whitepaper.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic library file. Not byte-compared with the publisher URL.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path, plus a commonly cited publisher URL","use_status":"Legacy path remains. Full text is not republished.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The library holds the Ripple consensus paper: agreement among servers that choose which other servers they listen to, rather than a race to spend hash power.","canonical_url":"https://blockchainlab.com/research/corpus/papers/ripple-consensus","record_url":"https://blockchainlab.com/research/corpus/papers/ripple-consensus","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0003","slug":"stellar-consensus","title":"The Stellar Consensus Protocol: A Federated Model for Internet-level Consensus","authors":"David Mazières","year":2015,"date_label":"2015, as commonly cited. The library index truncates the title; the full title is used here. Bytes were not re-opened.","publisher":"Stellar Development Foundation","paper_type":"Design paper","category":"Consensus","topics":["Federated consensus"],"source_url":"https://www.stellar.org/papers/stellar-consensus-protocol.pdf","source_label":"stellar.org paper","legacy_pdf_path":"/pdf/stellar-consensus-protocol.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic library file. Not byte-compared with the publisher PDF.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path, plus the publisher's paper page","use_status":"Legacy path remains. Full text is not republished.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Mazières's paper gives a federated way to reach agreement: each node picks quorum slices, and safety depends on how those slices intersect.","canonical_url":"https://blockchainlab.com/research/corpus/papers/stellar-consensus","record_url":"https://blockchainlab.com/research/corpus/papers/stellar-consensus","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0004","slug":"pegged-sidechains","title":"Enabling Blockchain Innovations with Pegged Sidechains","authors":"Back et al.","year":2014,"date_label":"2014, as commonly cited for this title. Not re-read from the file bytes in this build.","publisher":"The authors","paper_type":"Design paper","category":"Scaling","topics":["Sidechains","Bitcoin"],"source_url":"https://blockstream.com/sidechains.pdf","source_label":"Commonly cited PDF","legacy_pdf_path":"/pdf/sidechains1.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic library file sidechains1.pdf.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path","use_status":"Legacy path remains. Full text is not republished.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The library holds the pegged-sidechains paper associated with Adam Back and co-authors: a chain beside Bitcoin, with a two-way peg so coins can move across and back.","canonical_url":"https://blockchainlab.com/research/corpus/papers/pegged-sidechains","record_url":"https://blockchainlab.com/research/corpus/papers/pegged-sidechains","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0005","slug":"tether","title":"Tether: Fiat currencies on the Bitcoin blockchain","authors":"Not named in this record","year":null,"date_label":"Historic library file. A publication year was not verified from the bytes in this build.","publisher":"Tether","paper_type":"Historic library file","category":"Credit and stable value","topics":["Stable value","Issued token"],"source_url":"https://tether.to/","source_label":"Publisher site. Not a claim that this URL is the historic PDF.","legacy_pdf_path":"/pdf/Tether-White-Paper.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic library file Tether-White-Paper.pdf.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path","use_status":"Legacy path remains. This page does not describe reserves.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The historic library files a Tether paper whose index line is fiat currencies on the Bitcoin blockchain.","canonical_url":"https://blockchainlab.com/research/corpus/papers/tether","record_url":"https://blockchainlab.com/research/corpus/papers/tether","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0006","slug":"dash","title":"Dash: A Privacy-Centric Cryptocurrency","authors":"Duffield and Diaz","year":null,"date_label":"Historic library file. Year not re-verified from the bytes.","publisher":"The authors","paper_type":"Historic library file","category":"Digital cash","topics":["Masternodes","Privacy"],"source_url":"https://github.com/dashpay/dash/wiki/Whitepaper","source_label":"Project white paper page","legacy_pdf_path":"/pdf/Dash-WhitepaperV1.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic library file Dash-WhitepaperV1.pdf.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path","use_status":"Legacy path remains. Full text is not republished.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The library holds a Dash paper by Duffield and Diaz. The index describes a Bitcoin-derived coin with a masternode layer.","canonical_url":"https://blockchainlab.com/research/corpus/papers/dash","record_url":"https://blockchainlab.com/research/corpus/papers/dash","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0007","slug":"peercoin","title":"PPCoin: Peer-to-Peer Crypto-Currency with Proof-of-Stake","authors":"King and Nadal","year":2012,"date_label":"2012, as commonly cited for this title. Not re-read from the file bytes in this build.","publisher":"The authors","paper_type":"Design paper","category":"Consensus","topics":["Proof of stake"],"source_url":"https://www.peercoin.net/assets/paper/peercoin-paper.pdf","source_label":"peercoin.net PDF","legacy_pdf_path":"/pdf/peercoin-paper.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic library file.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path","use_status":"Legacy path remains. Full text is not republished.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"King and Nadal's paper is an early proof-of-stake design sitting beside proof of work. The library already names them.","canonical_url":"https://blockchainlab.com/research/corpus/papers/peercoin","record_url":"https://blockchainlab.com/research/corpus/papers/peercoin","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0008","slug":"iota-tangle","title":"The Tangle","authors":"Serguei Popov","year":null,"date_label":"Historic library file. Year not re-verified from the bytes in this build.","publisher":"The author","paper_type":"Design paper","category":"Consensus","topics":["DAG"],"source_url":"https://arxiv.org/pdf/1808.09186","source_label":"A later arXiv note exists; it is not asserted to be this file","legacy_pdf_path":"/pdf/tangle.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic library file tangle.pdf. Not byte-compared with arXiv.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path","use_status":"Legacy path remains. The arXiv link is a related public copy and may be a different version.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The library holds Popov's Tangle paper: a directed graph of transactions that approve earlier ones, instead of a single chain of blocks.","canonical_url":"https://blockchainlab.com/research/corpus/papers/iota-tangle","record_url":"https://blockchainlab.com/research/corpus/papers/iota-tangle","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0009","slug":"filecoin-2014","title":"Filecoin: A Cryptocurrency Operated File Storage Network","authors":"Not named in this record","year":2014,"date_label":"Described in this library as a 2014 sketch, earlier than the July 2017 paper.","publisher":"Not named in this record","paper_type":"Earlier sketch","category":"Storage and networks","topics":["Storage"],"source_url":"https://www.filecoin.io/assets/documents/filecoin.pdf","source_label":"2017 paper, which this file is not","legacy_pdf_path":"/pdf/filecoin.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic filecoin.pdf. Distinct from the July 2017 Protocol Labs paper.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path only","use_status":"Legacy path remains. Do not cite it as the 2017 paper.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The historic library's filecoin.pdf is an earlier sketch. The title in the old index is a cryptocurrency-operated file storage network.","canonical_url":"https://blockchainlab.com/research/corpus/papers/filecoin-2014","record_url":"https://blockchainlab.com/research/corpus/papers/filecoin-2014","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0010","slug":"gnosis","title":"Gnosis","authors":"Not named in this record","year":null,"date_label":"Historic library file. Authors and year were not re-verified from the bytes.","publisher":"Gnosis","paper_type":"Historic library file","category":"Markets","topics":["Prediction markets"],"source_url":"https://gnosis.io/","source_label":"Publisher site, not asserted to host this exact file","legacy_pdf_path":"/pdf/gnosis_whitepaper.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic library file gnosis_whitepaper.pdf.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path","use_status":"Legacy path remains. Metadata only beyond the index line.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The historic library holds a Gnosis white paper. The library note calls it a prediction-market paper.","canonical_url":"https://blockchainlab.com/research/corpus/papers/gnosis","record_url":"https://blockchainlab.com/research/corpus/papers/gnosis","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0011","slug":"sia","title":"Sia: Simple Decentralized Storage","authors":"Vorick and Champine","year":null,"date_label":"Historic library file. Year not re-verified from the bytes.","publisher":"The authors","paper_type":"Historic library file","category":"Storage and networks","topics":["Storage"],"source_url":"https://sia.tech/sia.pdf","source_label":"Publisher PDF","legacy_pdf_path":"/pdf/whitepaper3.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic library file whitepaper3.pdf. Not byte-compared with the publisher PDF.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path","use_status":"Legacy path remains. Full text is not republished.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The library holds the Sia storage paper by Vorick and Champine. The index subtitle is simple decentralised storage.","canonical_url":"https://blockchainlab.com/research/corpus/papers/sia","record_url":"https://blockchainlab.com/research/corpus/papers/sia","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0012","slug":"storj","title":"Storj: A Peer-to-Peer Cloud Storage Network","authors":"Wilkinson et al.","year":null,"date_label":"Historic library file. The full author list and year were not re-verified.","publisher":"Storj","paper_type":"Historic library file","category":"Storage and networks","topics":["Storage"],"source_url":"https://www.storj.io/storj.pdf","source_label":"Publisher PDF","legacy_pdf_path":"/pdf/storj.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Historic library file storj.pdf.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path","use_status":"Legacy path remains. Full text is not republished.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The library holds a Storj paper, indexed as a peer-to-peer cloud storage network, by Wilkinson and co-authors.","canonical_url":"https://blockchainlab.com/research/corpus/papers/storj","record_url":"https://blockchainlab.com/research/corpus/papers/storj","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-PDF-0013","slug":"kadena-2016","title":"Kadena: The first scalable, high performance private blockchain","authors":"Not named in this record","year":2016,"date_label":"August 2016, from the historic filename. Authors were not re-read.","publisher":"Kadena","paper_type":"Historic library file","category":"Consensus","topics":["Private chain"],"source_url":"https://kadena.com/","source_label":"Publisher site, not asserted to be this file","legacy_pdf_path":"/pdf/Kadena-ConsensusWhitePaper-Aug2016.pdf","sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"August 2016 private-chain note. Not Chainweb.","doi":null,"rights_status":"Rights uncertain","source_status":"Historic library path","use_status":"Legacy path remains. Do not cite it as Chainweb.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The historic library holds an August 2016 Kadena note. This library already says it is a private-chain document, not Chainweb.","canonical_url":"https://blockchainlab.com/research/corpus/papers/kadena-2016","record_url":"https://blockchainlab.com/research/corpus/papers/kadena-2016","study_url":null,"last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0001","slug":"cryptonote","title":"CryptoNote v 2.0","authors":"Nicolas van Saberhagen","year":2013,"date_label":"2013","publisher":"Nicolas van Saberhagen","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://cryptonote.org/whitepaper.pdf","source_label":"cryptonote.org","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2013 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The public design paper behind unlinkable payments. Monero adopted the construction and then replaced pieces of it. The historic library only has a third-party review of CryptoNote, not this document.","canonical_url":"https://blockchainlab.com/whitepaper/cryptonote","record_url":"https://blockchainlab.com/research/corpus/papers/cryptonote","study_url":"https://blockchainlab.com/whitepaper/cryptonote","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0002","slug":"zerocoin","title":"Zerocoin: Anonymous Distributed E-Cash from Bitcoin","authors":"Ian Miers, Christina Garman, Matthew Green, Aviel D. Rubin","year":2013,"date_label":"2013","publisher":"Ian Miers, Christina Garman, Matthew Green, Aviel D. Rubin","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://zerocoin.org/media/pdf/ZerocoinOakland.pdf","source_label":"Zerocoin Oakland paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2013 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A 2013 proposal to add an anonymity layer on top of Bitcoin by burning a coin into a commitment and later redeeming a different coin with a zero-knowledge proof of membership.","canonical_url":"https://blockchainlab.com/whitepaper/zerocoin","record_url":"https://blockchainlab.com/research/corpus/papers/zerocoin","study_url":"https://blockchainlab.com/whitepaper/zerocoin","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0003","slug":"zerocash","title":"Zerocash: Decentralized Anonymous Payments from Bitcoin","authors":"Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, Madars Virza","year":2014,"date_label":"2014","publisher":"Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, Madars Virza","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://zerocash-project.org/media/pdf/zerocash-extended-20140518.pdf","source_label":"Zerocash extended paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2014 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2014 paper that showed how a payment ledger can hide sender, receiver and amount, while still letting the network check that coins were not created or double-spent. Zcash is an implementation of this line of work, not a co-author of the paper.","canonical_url":"https://blockchainlab.com/whitepaper/zerocash","record_url":"https://blockchainlab.com/research/corpus/papers/zerocash","study_url":"https://blockchainlab.com/whitepaper/zerocash","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0004","slug":"ring-confidential-transactions","title":"Ring Confidential Transactions","authors":"Shen Noether","year":2016,"date_label":"2016","publisher":"Shen Noether","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://eprint.iacr.org/2015/1098.pdf","source_label":"IACR ePrint 2015/1098","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2016 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The research note Monero used to hide amounts, not just the signer. It extends ring signatures so a spender can prove a balance inside a ring without publishing the values.","canonical_url":"https://blockchainlab.com/whitepaper/ring-confidential-transactions","record_url":"https://blockchainlab.com/research/corpus/papers/ring-confidential-transactions","study_url":"https://blockchainlab.com/whitepaper/ring-confidential-transactions","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0005","slug":"mimblewimble","title":"Mimblewimble","authors":"Tom Elvis Jedusor","year":2016,"date_label":"2016","publisher":"Tom Elvis Jedusor","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://download.wpsoftware.net/bitcoin/wizardry/mimblewimble.txt","source_label":"Original Mimblewimble note","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2016 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A short 2016 note on a ledger that stores confidential transactions and can delete spent history. Grin and Beam are later implementations. The note itself is the primary text.","canonical_url":"https://blockchainlab.com/whitepaper/mimblewimble","record_url":"https://blockchainlab.com/research/corpus/papers/mimblewimble","study_url":"https://blockchainlab.com/whitepaper/mimblewimble","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0007","slug":"algorand","title":"ALGORAND: The Efficient and Democratic Ledger","authors":"Silvio Micali","year":2017,"date_label":"2017","publisher":"Silvio Micali","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://arxiv.org/pdf/1607.01341","source_label":"arXiv:1607.01341","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Micali's ledger design: a proof-of-stake protocol that elects a small, unpredictable committee to certify each block, and replaces participants so a corruptor cannot find them in time.","canonical_url":"https://blockchainlab.com/whitepaper/algorand","record_url":"https://blockchainlab.com/research/corpus/papers/algorand","study_url":"https://blockchainlab.com/whitepaper/algorand","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0008","slug":"avalanche","title":"Snowflake to Avalanche: A Novel Metastable Consensus Protocol Family","authors":"Team Rocket; later with Maofan Yin, Kevin Sekniqi, Robbert van Renesse and Emin Gün Sirer","year":2018,"date_label":"2018","publisher":"Team Rocket; later with Maofan Yin, Kevin Sekniqi, Robbert van Renesse and Emin Gün Sirer","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://www.avalabs.org/whitepapers","source_label":"Ava Labs white papers","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A family of consensus protocols that sample the network repeatedly and tip toward one outcome. The 2018 note was pseudonymous. A later write-up adds named co-authors. Avalanche the network is an implementation, not the sample itself.","canonical_url":"https://blockchainlab.com/whitepaper/avalanche","record_url":"https://blockchainlab.com/research/corpus/papers/avalanche","study_url":"https://blockchainlab.com/whitepaper/avalanche","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0009","slug":"solana","title":"Solana: A new architecture for a high performance blockchain","authors":"Anatoly Yakovenko","year":2018,"date_label":"2018","publisher":"Anatoly Yakovenko","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://solana.com/solana-whitepaper.pdf","source_label":"solana.com white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Yakovenko's design note for a ledger that encodes the passage of time as a verifiable hash chain, called Proof of History, so that validators spend less effort agreeing on order.","canonical_url":"https://blockchainlab.com/whitepaper/solana","record_url":"https://blockchainlab.com/research/corpus/papers/solana","study_url":"https://blockchainlab.com/whitepaper/solana","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0010","slug":"tendermint","title":"Tendermint: Consensus without Mining","authors":"Jae Kwon","year":2014,"date_label":"2014","publisher":"Jae Kwon","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://github.com/tendermint/tendermint","source_label":"Tendermint repository","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2014 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A practical Byzantine-fault-tolerant state machine for a known validator set, with instant finality on commit. It became the consensus engine under Cosmos SDK chains. The 2014 note is the origin, not the current CometBFT specification.","canonical_url":"https://blockchainlab.com/whitepaper/tendermint","record_url":"https://blockchainlab.com/research/corpus/papers/tendermint","study_url":"https://blockchainlab.com/whitepaper/tendermint","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0011","slug":"tezos","title":"Tezos — a self-amending crypto-ledger","authors":"L.M. Goodman","year":2014,"date_label":"2014","publisher":"L.M. Goodman","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://tezos.com/whitepaper.pdf","source_label":"tezos.com white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2014 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Goodman's proposal for a ledger whose protocol can be amended by a defined on-ledger process, with stakeholders who bake blocks and who may delegate.","canonical_url":"https://blockchainlab.com/whitepaper/tezos","record_url":"https://blockchainlab.com/research/corpus/papers/tezos","study_url":"https://blockchainlab.com/whitepaper/tezos","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0012","slug":"hashgraph","title":"The Swirlds Hashgraph Consensus Algorithm: Fair, Fast, Byzantine Fault Tolerance","authors":"Leemon Baird","year":2016,"date_label":"2016","publisher":"Leemon Baird","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://www.swirlds.com/downloads/SWIRLDS-TR-2016-01.pdf","source_label":"Swirlds TR-2016-01","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2016 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Baird's technical report on hashgraph: gossip about gossip, a virtual vote computed from the graph, and a fairness claim about the order of transactions. Hedera is the later public network that uses the algorithm under a governing council.","canonical_url":"https://blockchainlab.com/whitepaper/hashgraph","record_url":"https://blockchainlab.com/research/corpus/papers/hashgraph","study_url":"https://blockchainlab.com/whitepaper/hashgraph","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0013","slug":"nano","title":"Nano: A Feeless Distributed Cryptocurrency Network","authors":"Colin LeMahieu","year":2017,"date_label":"2017","publisher":"Colin LeMahieu","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://docs.nano.org/whitepaper/english/","source_label":"Nano white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"LeMahieu's design, first published as RaiBlocks: each account has its own chain, and the account holder is the only one who can append to it. Value moves by a send block on one chain and a receive block on another.","canonical_url":"https://blockchainlab.com/whitepaper/nano","record_url":"https://blockchainlab.com/research/corpus/papers/nano","study_url":"https://blockchainlab.com/whitepaper/nano","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0014","slug":"zilliqa","title":"The ZILLIQA Technical Whitepaper","authors":"The Zilliqa Team","year":2017,"date_label":"2017","publisher":"The Zilliqa Team","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://docs.zilliqa.com/whitepaper.pdf","source_label":"Zilliqa technical white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A 2017 design for a sharded chain: a directory service that assigns nodes, shards that process transactions in parallel, and a language proposal aimed at safe-by-construction contracts.","canonical_url":"https://blockchainlab.com/whitepaper/zilliqa","record_url":"https://blockchainlab.com/research/corpus/papers/zilliqa","study_url":"https://blockchainlab.com/whitepaper/zilliqa","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0015","slug":"harmony","title":"Harmony Technical Whitepaper","authors":"Stephen Tse and the Harmony team","year":2019,"date_label":"2019","publisher":"Stephen Tse and the Harmony team","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://harmony.one/whitepaper.pdf","source_label":"harmony.one white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A sharded proof-of-stake design that combines a BFT-style consensus inside shards with a randomness scheme for assigning validators, aimed at keeping a single shard from being captured.","canonical_url":"https://blockchainlab.com/whitepaper/harmony","record_url":"https://blockchainlab.com/research/corpus/papers/harmony","study_url":"https://blockchainlab.com/whitepaper/harmony","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0016","slug":"elrond","title":"Elrond: A Highly Scalable Public Blockchain via Adaptive State Sharding","authors":"The Elrond team","year":2019,"date_label":"2019","publisher":"The Elrond team","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://multiversx.com/","source_label":"MultiversX (formerly Elrond)","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2019 Elrond paper on adaptive state sharding: shards that hold state, a metachain that notarises results, and a secure proof-of-stake selection of validators. The network later rebranded as MultiversX. The paper remains the design document.","canonical_url":"https://blockchainlab.com/whitepaper/elrond","record_url":"https://blockchainlab.com/research/corpus/papers/elrond","study_url":"https://blockchainlab.com/whitepaper/elrond","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0017","slug":"near","title":"The NEAR White Paper","authors":"The NEAR team","year":2019,"date_label":"2019","publisher":"The NEAR team","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://near.org/papers/the-official-near-white-paper/","source_label":"NEAR white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"NEAR's public design paper: a sharded proof-of-stake chain with a single account model, nightshade-style data availability across chunks, and a stated intent that hiding the shards from application authors is part of the product.","canonical_url":"https://blockchainlab.com/whitepaper/near","record_url":"https://blockchainlab.com/research/corpus/papers/near","study_url":"https://blockchainlab.com/whitepaper/near","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0018","slug":"aptos","title":"The Aptos Blockchain: Safe, Scalable, and Upgradeable Web3 Infrastructure","authors":"Aptos Labs","year":2022,"date_label":"2022","publisher":"Aptos Labs","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://aptosfoundation.org/whitepaper/aptos-whitepaper_en.pdf","source_label":"Aptos white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2022 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Aptos Labs' 2022 paper for a Move-based chain that pipelines dissemination, ordering, execution and certification, and that treats protocol upgrades as a first-class feature rather than a hard-fork event.","canonical_url":"https://blockchainlab.com/whitepaper/aptos","record_url":"https://blockchainlab.com/research/corpus/papers/aptos","study_url":"https://blockchainlab.com/whitepaper/aptos","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0019","slug":"sui","title":"The Sui Smart Contracts Platform","authors":"The Mysten Labs Team","year":2022,"date_label":"2022","publisher":"The Mysten Labs Team","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://docs.sui.io/paper/sui.pdf","source_label":"Sui platform paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2022 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Mysten Labs' platform paper. Assets are Move objects. Operations on objects owned by a single address can finish by consistent broadcast among validators. Shared objects go through consensus. The split is the design.","canonical_url":"https://blockchainlab.com/whitepaper/sui","record_url":"https://blockchainlab.com/research/corpus/papers/sui","study_url":"https://blockchainlab.com/whitepaper/sui","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0020","slug":"diem","title":"The Diem Blockchain","authors":"Diem Association engineering group","year":2020,"date_label":"2020","publisher":"Diem Association engineering group","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://developers.diem.com/docs/technical-papers/the-diem-blockchain-paper/","source_label":"Diem technical paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The technical paper for the Libra, later Diem, payment chain: a permissioned BFT ledger, a Move language for resources, and a reserve-backed currency proposal. The project was wound down in 2022. The paper still matters because Move, and the account model Aptos and Sui started from, was specified here.","canonical_url":"https://blockchainlab.com/whitepaper/diem","record_url":"https://blockchainlab.com/research/corpus/papers/diem","study_url":"https://blockchainlab.com/whitepaper/diem","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0021","slug":"mina","title":"Coda: Decentralized Cryptocurrency at Scale","authors":"Joseph Bonneau, Izaak Meckler, Vanishree Rao, Evan Shapiro","year":2020,"date_label":"2020","publisher":"Joseph Bonneau, Izaak Meckler, Vanishree Rao, Evan Shapiro","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://eprint.iacr.org/2020/352.pdf","source_label":"IACR ePrint 2020/352","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The Coda paper, later the Mina protocol: a chain whose certificate is a constant-size succinct proof, so a client can check the state without replaying history. The project renamed from Coda to Mina. The paper keeps the original name.","canonical_url":"https://blockchainlab.com/whitepaper/mina","record_url":"https://blockchainlab.com/research/corpus/papers/mina","study_url":"https://blockchainlab.com/whitepaper/mina","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0022","slug":"ton","title":"The Open Network","authors":"Nikolai Durov","year":2021,"date_label":"2021","publisher":"Nikolai Durov","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://ton.org/whitepaper.pdf","source_label":"ton.org white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2021 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Durov's design for a multi-chain system of account-chains gathered into shardchains, with a masterchain that records the others. It began as Telegram's network design and continued as The Open Network after Telegram stepped away from the original launch.","canonical_url":"https://blockchainlab.com/whitepaper/ton","record_url":"https://blockchainlab.com/research/corpus/papers/ton","study_url":"https://blockchainlab.com/whitepaper/ton","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0023","slug":"chainweb","title":"Chainweb: A Proof-of-Work Parallel-Chain Architecture for Massive Throughput","authors":"Will Martino, Monica Quaintance, Stuart Popejoy","year":2018,"date_label":"2018","publisher":"Will Martino, Monica Quaintance, Stuart Popejoy","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://kadena.io/whitepapers","source_label":"Kadena white papers","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Kadena's public parallel-chain design. Many proof-of-work chains advance together, and each block commits to peer-chain headers, so a confirmation is a braid rather than a single chain. This is not the 2016 private-chain note already in the historic library.","canonical_url":"https://blockchainlab.com/whitepaper/chainweb","record_url":"https://blockchainlab.com/research/corpus/papers/chainweb","study_url":"https://blockchainlab.com/whitepaper/chainweb","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0024","slug":"eosio","title":"EOS.IO Technical White Paper","authors":"Daniel Larimer and block.one","year":2018,"date_label":"2018","publisher":"Daniel Larimer and block.one","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://github.com/EOSIO/Documentation/blob/master/TechnicalWhitePaper.md","source_label":"EOS.IO technical white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2018 technical paper for EOSIO: delegated proof of stake, named block producers, and an operating-system metaphor for accounts, permissions and resource allocation. It is a design document. It is not a description of later governance fights around any one chain that used the software.","canonical_url":"https://blockchainlab.com/whitepaper/eosio","record_url":"https://blockchainlab.com/research/corpus/papers/eosio","study_url":"https://blockchainlab.com/whitepaper/eosio","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0025","slug":"dfinity","title":"DFINITY Consensus System","authors":"Timo Hanke, Mahnush Movahedi, Dominic Williams","year":2018,"date_label":"2018","publisher":"Timo Hanke, Mahnush Movahedi, Dominic Williams","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://internetcomputer.org/whitepapers","source_label":"Internet Computer white papers","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The DFINITY consensus overview: a randomness beacon, a ranking of block proposers, and notarisation so that a chain can come to agreement quickly among a large set. The Internet Computer is the later network built by the DFINITY foundation on this line of research.","canonical_url":"https://blockchainlab.com/whitepaper/dfinity","record_url":"https://blockchainlab.com/research/corpus/papers/dfinity","study_url":"https://blockchainlab.com/whitepaper/dfinity","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0026","slug":"polkadot","title":"Polkadot: Vision for a heterogeneous multi-chain framework","authors":"Gavin Wood","year":2016,"date_label":"2016","publisher":"Gavin Wood","paper_type":"Design paper","category":"Interoperability","topics":["Interoperability"],"source_url":"https://github.com/w3f/polkadot-white-paper","source_label":"Web3 Foundation white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2016 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Wood's 2016 vision paper: a relay chain that provides shared security and a queue of cross-chain messages, with parachains that keep their own state transition. It is a vision paper. The live protocol has a specification of its own.","canonical_url":"https://blockchainlab.com/whitepaper/polkadot","record_url":"https://blockchainlab.com/research/corpus/papers/polkadot","study_url":"https://blockchainlab.com/whitepaper/polkadot","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0027","slug":"cosmos","title":"Cosmos: A Network of Distributed Ledgers","authors":"Jae Kwon and Ethan Buchman","year":2016,"date_label":"2016","publisher":"Jae Kwon and Ethan Buchman","paper_type":"Design paper","category":"Interoperability","topics":["Interoperability"],"source_url":"https://github.com/cosmos/cosmos/blob/master/WHITEPAPER.md","source_label":"Cosmos white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2016 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The Cosmos paper: independent zones running a BFT consensus, connected by a hub, speaking a packet protocol that later became IBC. Unlike Polkadot's shared-security vision, zones here are sovereign. They choose their own validator sets.","canonical_url":"https://blockchainlab.com/whitepaper/cosmos","record_url":"https://blockchainlab.com/research/corpus/papers/cosmos","study_url":"https://blockchainlab.com/whitepaper/cosmos","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0029","slug":"plasma","title":"Plasma: Scalable Autonomous Smart Contracts","authors":"Joseph Poon and Vitalik Buterin","year":2017,"date_label":"2017","publisher":"Joseph Poon and Vitalik Buterin","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://plasma.io/plasma.pdf","source_label":"plasma.io paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A 2017 construction for trees of child chains whose state commitments are posted to a parent chain, with exits so a user can leave if the child operator misbehaves. It is an ancestor of later rollup and validium designs, not a synonym for them.","canonical_url":"https://blockchainlab.com/whitepaper/plasma","record_url":"https://blockchainlab.com/research/corpus/papers/plasma","study_url":"https://blockchainlab.com/whitepaper/plasma","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0030","slug":"arbitrum","title":"Arbitrum: Scalable, private smart contracts","authors":"Harry Kalodner, Steven Goldfeder, Xiaoqi Chen, S. Matthew Weinberg, Edward W. Felten","year":2018,"date_label":"2018","publisher":"Harry Kalodner, Steven Goldfeder, Xiaoqi Chen, S. Matthew Weinberg, Edward W. Felten","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://www.usenix.org/system/files/conference/usenixsecurity18/sec18-kalodner.pdf","source_label":"USENIX Security 2018","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2018 USENIX paper on Arbitrum: a verifier that checks a manager's execution of a virtual machine by bisecting disputes, instead of re-executing every instruction. Offchain Labs' later Nitro stack is a descendant, not this paper line for line.","canonical_url":"https://blockchainlab.com/whitepaper/arbitrum","record_url":"https://blockchainlab.com/research/corpus/papers/arbitrum","study_url":"https://blockchainlab.com/whitepaper/arbitrum","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0031","slug":"starks","title":"Scalable, transparent, and post-quantum secure computational integrity","authors":"Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev","year":2018,"date_label":"2018","publisher":"Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://eprint.iacr.org/2018/046.pdf","source_label":"IACR ePrint 2018/046","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The STARK paper: proofs of computational integrity that are succinct, do not need a trusted setup, and are argued to resist quantum attackers on the underlying hashes. StarkWare's later systems, including StarkEx and Starknet, are built on this proof system. They are not identical to it.","canonical_url":"https://blockchainlab.com/whitepaper/starks","record_url":"https://blockchainlab.com/research/corpus/papers/starks","study_url":"https://blockchainlab.com/whitepaper/starks","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0032","slug":"lazyledger","title":"LazyLedger: A Distributed Data Availability Ledger With Client-Side Smart Contracts","authors":"Mustafa Al-Bassam","year":2019,"date_label":"2019","publisher":"Mustafa Al-Bassam","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://arxiv.org/pdf/1905.09274","source_label":"arXiv:1905.09274","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Al-Bassam's LazyLedger paper, the research origin of Celestia. The base layer orders and makes data available. It does not execute application transitions. Clients check availability with sampling, and applications execute on their own.","canonical_url":"https://blockchainlab.com/whitepaper/lazyledger","record_url":"https://blockchainlab.com/research/corpus/papers/lazyledger","study_url":"https://blockchainlab.com/whitepaper/lazyledger","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0033","slug":"eigenlayer","title":"EigenLayer: The Restaking Collective","authors":"Eigen Labs","year":2023,"date_label":"2023","publisher":"Eigen Labs","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://docs.eigenlayer.xyz/eigenlayer/overview/whitepaper","source_label":"EigenLayer white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2023 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Eigen Labs' design for letting Ethereum stakers opt in to additional slashing conditions, so new services can rent economic security instead of bootstrapping a new token set from zero.","canonical_url":"https://blockchainlab.com/whitepaper/eigenlayer","record_url":"https://blockchainlab.com/research/corpus/papers/eigenlayer","study_url":"https://blockchainlab.com/whitepaper/eigenlayer","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0034","slug":"matic","title":"Matic Network white paper","authors":"Jaynti Kanani, Sandeep Nailwal, Anurag Arjun","year":2019,"date_label":"2019","publisher":"Jaynti Kanani, Sandeep Nailwal, Anurag Arjun","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://github.com/maticnetwork/whitepaper","source_label":"Matic white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2019 Matic paper for a Plasma-inspired sidechain with a proof-of-stake checkpoint layer posting to Ethereum. Polygon is the later organisation and product family. This page is about the 2019 document, not about every subsequent Polygon stack.","canonical_url":"https://blockchainlab.com/whitepaper/matic","record_url":"https://blockchainlab.com/research/corpus/papers/matic","study_url":"https://blockchainlab.com/whitepaper/matic","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0035","slug":"uniswap-v2","title":"Uniswap v2 Core","authors":"Hayden Adams, Noah Zinsmeister, Dan Robinson","year":2020,"date_label":"2020","publisher":"Hayden Adams, Noah Zinsmeister, Dan Robinson","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://uniswap.org/whitepaper.pdf","source_label":"Uniswap v2 core paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2020 core paper for Uniswap v2: a constant-product automated market maker, with arbitrary ERC-20 pairs, price accumulators, and a flash-swap callback. It is the clearest short specification of the pool that much of later DeFi either forked or assumed.","canonical_url":"https://blockchainlab.com/whitepaper/uniswap-v2","record_url":"https://blockchainlab.com/research/corpus/papers/uniswap-v2","study_url":"https://blockchainlab.com/whitepaper/uniswap-v2","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0036","slug":"uniswap-v3","title":"Uniswap v3 Core","authors":"Hayden Adams, Noah Zinsmeister, Moody Salem, River Keefer, Dan Robinson","year":2021,"date_label":"2021","publisher":"Hayden Adams, Noah Zinsmeister, Moody Salem, River Keefer, Dan Robinson","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://uniswap.org/whitepaper-v3.pdf","source_label":"Uniswap v3 core paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2021 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2021 paper that replaces the uniform reserve curve with concentrated liquidity. A provider chooses a price range. Inside the range their capital acts like a constant-product pool. Outside it, their position is entirely in one asset.","canonical_url":"https://blockchainlab.com/whitepaper/uniswap-v3","record_url":"https://blockchainlab.com/research/corpus/papers/uniswap-v3","study_url":"https://blockchainlab.com/whitepaper/uniswap-v3","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0037","slug":"curve-stableswap","title":"StableSwap — efficient mechanism for Stablecoin liquidity","authors":"Michael Egorov","year":2019,"date_label":"2019","publisher":"Michael Egorov","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://curve.fi/files/stableswap-paper.pdf","source_label":"StableSwap paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Egorov's 2019 invariant for pools of assets that should trade near parity. The curve is flat around the peg, where most stablecoin trades happen, and bends toward a constant-product tail when the pool is pushed off parity.","canonical_url":"https://blockchainlab.com/whitepaper/curve-stableswap","record_url":"https://blockchainlab.com/research/corpus/papers/curve-stableswap","study_url":"https://blockchainlab.com/whitepaper/curve-stableswap","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0038","slug":"balancer","title":"Balancer: A non-custodial portfolio manager, liquidity provider, and price sensor","authors":"Fernando Martinelli and Nikolai Mushegian","year":2019,"date_label":"2019","publisher":"Fernando Martinelli and Nikolai Mushegian","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://balancer.fi/whitepaper.pdf","source_label":"Balancer white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The Balancer paper generalises the two-asset constant-product pool to a weighted basket of several tokens. Traders rebalance the basket. Liquidity providers define target weights. The pool is both an index and a market.","canonical_url":"https://blockchainlab.com/whitepaper/balancer","record_url":"https://blockchainlab.com/research/corpus/papers/balancer","study_url":"https://blockchainlab.com/whitepaper/balancer","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0039","slug":"zero-x","title":"0x: An open protocol for decentralized exchange on the Ethereum blockchain","authors":"Will Warren and Amir Bandeali","year":2017,"date_label":"2017","publisher":"Will Warren and Amir Bandeali","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://github.com/0xProject/whitepaper/blob/master/0x_white_paper.pdf","source_label":"0x white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2017 0x paper: off-chain signed orders, on-chain settlement, and relayers who host order books without taking custody. It is the reference design for 'the book is off-chain, the swap is on-chain'.","canonical_url":"https://blockchainlab.com/whitepaper/zero-x","record_url":"https://blockchainlab.com/research/corpus/papers/zero-x","study_url":"https://blockchainlab.com/whitepaper/zero-x","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0040","slug":"bancor","title":"Bancor Protocol: Continuous Liquidity and Asynchronous Price Discovery for Tokens through their Smart Contracts","authors":"Eyal Hertzog, Guy Benartzi, Galia Benartzi","year":2017,"date_label":"2017","publisher":"Eyal Hertzog, Guy Benartzi, Galia Benartzi","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://bancor.network/","source_label":"Bancor protocol","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2017 Bancor paper on smart tokens that hold reserves of other tokens and quote a continuous price from a reserve ratio. It is an early automated-liquidity design, distinct from Uniswap's later constant-product pools.","canonical_url":"https://blockchainlab.com/whitepaper/bancor","record_url":"https://blockchainlab.com/research/corpus/papers/bancor","study_url":"https://blockchainlab.com/whitepaper/bancor","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0041","slug":"thorchain","title":"THORChain: a decentralised liquidity protocol","authors":"The THORChain team","year":2020,"date_label":"2020","publisher":"The THORChain team","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://github.com/thorchain/Resources/tree/master/Whitepapers","source_label":"THORChain white papers","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"THORChain's design for continuous liquidity pools that cross native chains. Nodes bond capital, observe external chains, and sign outbound transactions as a threshold set. It is a liquidity network, not a wrapped-asset bridge run by a single custodian.","canonical_url":"https://blockchainlab.com/whitepaper/thorchain","record_url":"https://blockchainlab.com/research/corpus/papers/thorchain","study_url":"https://blockchainlab.com/whitepaper/thorchain","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0042","slug":"compound","title":"Compound: The Money Market Protocol","authors":"Robert Leshner and Geoffrey Hayes","year":2019,"date_label":"2019","publisher":"Robert Leshner and Geoffrey Hayes","paper_type":"Design paper","category":"Credit and stable value","topics":["Credit and stable value"],"source_url":"https://compound.finance/documents/Compound.Whitepaper.pdf","source_label":"Compound white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2019 Compound paper: pooled lending markets where suppliers earn a floating rate and borrowers post collateral. Interest rates are a function of utilisation, set in the protocol rather than negotiated bilaterally.","canonical_url":"https://blockchainlab.com/whitepaper/compound","record_url":"https://blockchainlab.com/research/corpus/papers/compound","study_url":"https://blockchainlab.com/whitepaper/compound","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0043","slug":"aave","title":"Aave Protocol white paper","authors":"Aave","year":2020,"date_label":"2020","publisher":"Aave","paper_type":"Design paper","category":"Credit and stable value","topics":["Credit and stable value"],"source_url":"https://github.com/aave/aave-protocol/blob/master/docs/Aave_Protocol_Whitepaper_v1_0.pdf","source_label":"Aave protocol white paper v1","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Aave's v1 protocol paper: pooled lending with stable and variable rates, and loan features such as rate switching and uncollateralised flash loans inside a single transaction. It sits in the same family as Compound, with a different rate and product surface.","canonical_url":"https://blockchainlab.com/whitepaper/aave","record_url":"https://blockchainlab.com/research/corpus/papers/aave","study_url":"https://blockchainlab.com/whitepaper/aave","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0047","slug":"the-graph","title":"The Graph: a decentralised query protocol for blockchains","authors":"Yaniv Tal, Brandon Ramirez and the Graph team","year":2020,"date_label":"2020","publisher":"Yaniv Tal, Brandon Ramirez and the Graph team","paper_type":"Design paper","category":"Data and agents","topics":["Data and agents"],"source_url":"https://github.com/graphprotocol/research","source_label":"Graph research papers","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The Graph's protocol paper for indexing chain data. Indexers stake on serving a subgraph. Curators signal which subgraphs matter. Consumers pay for queries. The problem is read access, not consensus.","canonical_url":"https://blockchainlab.com/whitepaper/the-graph","record_url":"https://blockchainlab.com/research/corpus/papers/the-graph","study_url":"https://blockchainlab.com/whitepaper/the-graph","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0048","slug":"augur","title":"Augur: a Decentralized Oracle and Prediction Market Platform","authors":"Jack Peterson, Joseph Krug, Micah Zoltu, Austin K. Williams, Stephanie Alexander","year":2018,"date_label":"2018","publisher":"Jack Peterson, Joseph Krug, Micah Zoltu, Austin K. Williams, Stephanie Alexander","paper_type":"Design paper","category":"Data and agents","topics":["Data and agents"],"source_url":"https://augur.net/whitepaper.pdf","source_label":"Augur white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The Augur paper: prediction markets whose outcomes are reported by token holders, with a dispute ladder that can escalate a contested result. It is both a market design and an oracle design. The historic library already holds Gnosis. Augur is the other canonical public prediction-market paper and was not in that set.","canonical_url":"https://blockchainlab.com/whitepaper/augur","record_url":"https://blockchainlab.com/research/corpus/papers/augur","study_url":"https://blockchainlab.com/whitepaper/augur","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0049","slug":"ocean","title":"Ocean Protocol: A Decentralized Substrate for AI Data and Services","authors":"Trent McConaghy and the Ocean Protocol team","year":2019,"date_label":"2019","publisher":"Trent McConaghy and the Ocean Protocol team","paper_type":"Design paper","category":"Data and agents","topics":["Data and agents"],"source_url":"https://oceanprotocol.com/tech-whitepaper.pdf","source_label":"Ocean technical white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Ocean's technical paper for publishing, pricing and consuming data services with on-chain access control and off-chain storage. The data does not sit inside the chain. The permission and the payment do.","canonical_url":"https://blockchainlab.com/whitepaper/ocean","record_url":"https://blockchainlab.com/research/corpus/papers/ocean","study_url":"https://blockchainlab.com/whitepaper/ocean","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0050","slug":"bittensor","title":"Bittensor: A Peer-to-Peer Intelligence Market","authors":"Yuma Rao","year":2021,"date_label":"2021","publisher":"Yuma Rao","paper_type":"Design paper","category":"Data and agents","topics":["Data and agents"],"source_url":"https://www.bittensor.com/whitepaper","source_label":"Bittensor white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2021 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Rao's paper for a market in which machine-learning models score each other. Peers rank neighbours, ranks accumulate on a ledger, and an incentive mechanism is specified to resist a naive cartel of mutual high scores. It is a design for pricing intelligence as a commodity, not a benchmark of any particular model.","canonical_url":"https://blockchainlab.com/whitepaper/bittensor","record_url":"https://blockchainlab.com/research/corpus/papers/bittensor","study_url":"https://blockchainlab.com/whitepaper/bittensor","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0051","slug":"singularitynet","title":"SingularityNET: A Decentralized, Open Market and Network for AIs","authors":"Ben Goertzel and the SingularityNET team","year":2017,"date_label":"2017","publisher":"Ben Goertzel and the SingularityNET team","paper_type":"Design paper","category":"Data and agents","topics":["Data and agents"],"source_url":"https://public.singularitynet.io/whitepaper.pdf","source_label":"SingularityNET white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Goertzel's 2017 proposal for a marketplace where AI services discover, call and pay each other. The paper is broad on purpose: discovery, reputation, inter-agent calls and a tokenised payment rail, sketched as one network.","canonical_url":"https://blockchainlab.com/whitepaper/singularitynet","record_url":"https://blockchainlab.com/research/corpus/papers/singularitynet","study_url":"https://blockchainlab.com/whitepaper/singularitynet","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0053","slug":"arweave","title":"Arweave yellow paper","authors":"Sam Williams and the Arweave team","year":2018,"date_label":"2018","publisher":"Sam Williams and the Arweave team","paper_type":"Design paper","category":"Storage and networks","topics":["Storage and networks"],"source_url":"https://www.arweave.org/yellow-paper.pdf","source_label":"Arweave yellow paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Arweave's protocol paper for permanent storage: miners store a recall block drawn from the history, an endowment is supposed to prepay storage, and the dataset is content-addressed. The yellow paper is the technical document. Marketing pages are not a substitute.","canonical_url":"https://blockchainlab.com/whitepaper/arweave","record_url":"https://blockchainlab.com/research/corpus/papers/arweave","study_url":"https://blockchainlab.com/whitepaper/arweave","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0054","slug":"helium","title":"Helium: A Decentralized Wireless Network","authors":"Amir Haleem, Andrew Allen, Andrew Thompson","year":2018,"date_label":"2018","publisher":"Amir Haleem, Andrew Allen, Andrew Thompson","paper_type":"Design paper","category":"Storage and networks","topics":["Storage and networks"],"source_url":"https://whitepaper.helium.com/","source_label":"Helium white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The Helium paper for a wireless network built from independently owned hotspots. Coverage is the commodity. Proof-of-coverage is the paper's way of checking that a radio is where it says it is and that it can be heard. Later changes of purpose and token are not this document.","canonical_url":"https://blockchainlab.com/whitepaper/helium","record_url":"https://blockchainlab.com/research/corpus/papers/helium","study_url":"https://blockchainlab.com/whitepaper/helium","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0055","slug":"golem","title":"The Golem Project: crowdfunding white paper","authors":"Golem Factory","year":2016,"date_label":"2016","publisher":"Golem Factory","paper_type":"Design paper","category":"Storage and networks","topics":["Storage and networks"],"source_url":"https://golem.network/doc/Golemwhitepaper.pdf","source_label":"Golem white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2016 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Golem Factory's 2016 paper for a marketplace of spare computer power. Requestors split tasks. Providers run them. A reputation and payment layer is supposed to make the exchange work without a single render farm. The paper is explicit that it was also a crowdfunding document. This page uses the technical design and ignores the sale.","canonical_url":"https://blockchainlab.com/whitepaper/golem","record_url":"https://blockchainlab.com/research/corpus/papers/golem","study_url":"https://blockchainlab.com/whitepaper/golem","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0056","slug":"livepeer","title":"Livepeer: a decentralised live video streaming network","authors":"Doug Petkanics and Eric Tang","year":2017,"date_label":"2017","publisher":"Doug Petkanics and Eric Tang","paper_type":"Design paper","category":"Storage and networks","topics":["Storage and networks"],"source_url":"https://github.com/livepeer/wiki/blob/master/WHITEPAPER.md","source_label":"Livepeer white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Petkanics and Tang's design for live video transcoding as a protocol job. Broadcasters send a stream. Transcoders stake and compete to encode the renditions viewers actually need. It is a specific media market, which is why it is more concrete than a general 'decentralised compute' essay.","canonical_url":"https://blockchainlab.com/whitepaper/livepeer","record_url":"https://blockchainlab.com/research/corpus/papers/livepeer","study_url":"https://blockchainlab.com/whitepaper/livepeer","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0057","slug":"basic-attention-token","title":"Basic Attention Token: Blockchain Based Digital Advertising","authors":"Brave Software","year":2018,"date_label":"2018","publisher":"Brave Software","paper_type":"Design paper","category":"Storage and networks","topics":["Storage and networks"],"source_url":"https://basicattentiontoken.org/BasicAttentionTokenWhitePaper-4.pdf","source_label":"BAT white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Brave's 2018 paper for an advertising unit that pays publishers and users from a measured attention event inside the browser, rather than from a chain of third-party trackers. The browser is load-bearing. The token is the unit of account in the paper's payment flow.","canonical_url":"https://blockchainlab.com/whitepaper/basic-attention-token","record_url":"https://blockchainlab.com/research/corpus/papers/basic-attention-token","study_url":"https://blockchainlab.com/whitepaper/basic-attention-token","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0058","slug":"enigma","title":"Enigma: Decentralized Computation Platform with Guaranteed Privacy","authors":"Guy Zyskind, Oz Nathan, Alex Pentland","year":2015,"date_label":"2015","publisher":"Guy Zyskind, Oz Nathan, Alex Pentland","paper_type":"Design paper","category":"Confidential compute","topics":["Confidential compute"],"source_url":"https://enigma.co/enigma_full.pdf","source_label":"Enigma paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2015 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The 2015 Enigma paper from MIT: private contracts executed over secret-shared data, so nodes compute without seeing the raw inputs. Secret Network is a later project in this lineage, using different machinery. This page is about the Enigma paper, which the historic library does not hold.","canonical_url":"https://blockchainlab.com/whitepaper/enigma","record_url":"https://blockchainlab.com/research/corpus/papers/enigma","study_url":"https://blockchainlab.com/whitepaper/enigma","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0059","slug":"ekiden","title":"Ekiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contracts","authors":"Raymond Cheng, Fan Zhang, Jernej Kos, Ari Juels, Andrew Miller, Dawn Song and collaborators","year":2019,"date_label":"2019","publisher":"Raymond Cheng, Fan Zhang, Jernej Kos, Ari Juels, Andrew Miller, Dawn Song and collaborators","paper_type":"Design paper","category":"Confidential compute","topics":["Confidential compute"],"source_url":"https://arxiv.org/pdf/1804.05141","source_label":"arXiv:1804.05141","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The Ekiden paper: smart contracts that execute inside trusted hardware, with the ledger checking attestations rather than re-executing the private code. Oasis Network is the later production system in this line. The paper is the academic statement of the approach.","canonical_url":"https://blockchainlab.com/whitepaper/ekiden","record_url":"https://blockchainlab.com/research/corpus/papers/ekiden","study_url":"https://blockchainlab.com/whitepaper/ekiden","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0060","slug":"pbft","title":"Practical Byzantine Fault Tolerance","authors":"Miguel Castro and Barbara Liskov","year":1999,"date_label":"1999","publisher":"Miguel Castro and Barbara Liskov","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"http://pmg.csail.mit.edu/papers/osdi99.pdf","source_label":"OSDI 1999","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 1999 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"The paper that made a Byzantine quorum practical: a known set of replicas, three phases, and a view change when the leader is useless. Tendermint and HotStuff inherit the shape. Open membership is a different problem.","canonical_url":"https://blockchainlab.com/whitepaper/pbft","record_url":"https://blockchainlab.com/research/corpus/papers/pbft","study_url":"https://blockchainlab.com/whitepaper/pbft","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0061","slug":"bitcoin-ng","title":"Bitcoin-NG: A Scalable Blockchain Protocol","authors":"Ittay Eyal, Adem Ercan Gencer, Emin Gün Sirer and Robbert van Renesse","year":2016,"date_label":"2016","publisher":"Ittay Eyal, Adem Ercan Gencer, Emin Gün Sirer and Robbert van Renesse","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://arxiv.org/abs/1510.02037","source_label":"arXiv:1510.02037","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2016 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Separate the rare proof-of-work election from the frequent publication of transactions. Key blocks choose a leader. That leader's microblocks carry the transactions until the next key block.","canonical_url":"https://blockchainlab.com/whitepaper/bitcoin-ng","record_url":"https://blockchainlab.com/research/corpus/papers/bitcoin-ng","study_url":"https://blockchainlab.com/whitepaper/bitcoin-ng","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0062","slug":"ghost","title":"Secure High-Rate Transaction Processing in Bitcoin","authors":"Yonatan Sompolinsky and Aviv Zohar","year":2015,"date_label":"2015","publisher":"Yonatan Sompolinsky and Aviv Zohar","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://eprint.iacr.org/2013/881","source_label":"ePrint 2013/881","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2015 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"At high block rates the longest chain throws away too much honest work. GHOST follows the heaviest subtree, so blocks off the main tip still count for the fork choice.","canonical_url":"https://blockchainlab.com/whitepaper/ghost","record_url":"https://blockchainlab.com/research/corpus/papers/ghost","study_url":"https://blockchainlab.com/whitepaper/ghost","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0063","slug":"phantom","title":"PHANTOM and GHOSTDAG","authors":"Yonatan Sompolinsky, Shai Wyborski and Aviv Zohar","year":2018,"date_label":"2018","publisher":"Yonatan Sompolinsky, Shai Wyborski and Aviv Zohar","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://eprint.iacr.org/2018/104","source_label":"ePrint 2018/104","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A blockDAG protocol that still ends in one linear order. Honest blocks cluster. The parameter k is how wide that cluster may be. Kaspa is a later network in this line, not the paper.","canonical_url":"https://blockchainlab.com/whitepaper/phantom","record_url":"https://blockchainlab.com/research/corpus/papers/phantom","study_url":"https://blockchainlab.com/whitepaper/phantom","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0064","slug":"spectre","title":"SPECTRE: A Fast and Scalable Cryptocurrency Protocol","authors":"Yonatan Sompolinsky, Yoad Lewenberg and Aviv Zohar","year":2016,"date_label":"2016","publisher":"Yonatan Sompolinsky, Yoad Lewenberg and Aviv Zohar","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://eprint.iacr.org/2016/1159","source_label":"ePrint 2016/1159","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2016 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Blocks form a DAG and vote pairwise on which of two blocks came first. In the common case that vote settles quickly. The paper does not promise a total order of every pair, which is why it is a poor fit for general contracts.","canonical_url":"https://blockchainlab.com/whitepaper/spectre","record_url":"https://blockchainlab.com/research/corpus/papers/spectre","study_url":"https://blockchainlab.com/whitepaper/spectre","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0065","slug":"casper-ffg","title":"Casper the Friendly Finality Gadget","authors":"Vitalik Buterin and Virgil Griffith","year":2017,"date_label":"2017","publisher":"Vitalik Buterin and Virgil Griffith","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://arxiv.org/abs/1710.09437","source_label":"arXiv:1710.09437","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A finality overlay. Validators cast two rounds of votes so that a chain of checkpoints becomes justified and then final. Equivocation can be slashed. The gadget does not, by itself, propose blocks.","canonical_url":"https://blockchainlab.com/whitepaper/casper-ffg","record_url":"https://blockchainlab.com/research/corpus/papers/casper-ffg","study_url":"https://blockchainlab.com/whitepaper/casper-ffg","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0066","slug":"hotstuff","title":"HotStuff: BFT Consensus in the Lens of Blockchain","authors":"Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta and Ittai Abraham","year":2019,"date_label":"2019","publisher":"Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta and Ittai Abraham","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://arxiv.org/abs/1803.05069","source_label":"arXiv:1803.05069","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A three-phase BFT protocol whose communication is linear in the number of replicas, because a leader collects a threshold signature instead of everyone talking to everyone. Diem used a variant. The paper is not that network.","canonical_url":"https://blockchainlab.com/whitepaper/hotstuff","record_url":"https://blockchainlab.com/research/corpus/papers/hotstuff","study_url":"https://blockchainlab.com/whitepaper/hotstuff","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0067","slug":"honeybadger","title":"The Honey Badger of BFT Protocols","authors":"Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi and Dawn Song","year":2016,"date_label":"2016","publisher":"Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi and Dawn Song","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://eprint.iacr.org/2016/199","source_label":"ePrint 2016/199","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2016 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"An asynchronous atomic broadcast. It does not wait for a timeout to make progress, and threshold encryption stops a leader from reading a batch and then dropping the transactions it dislikes.","canonical_url":"https://blockchainlab.com/whitepaper/honeybadger","record_url":"https://blockchainlab.com/research/corpus/papers/honeybadger","study_url":"https://blockchainlab.com/whitepaper/honeybadger","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0068","slug":"narwhal-tusk","title":"Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus","authors":"George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino and Alexander Spiegelman","year":2022,"date_label":"2022","publisher":"George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino and Alexander Spiegelman","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://arxiv.org/abs/2105.11827","source_label":"arXiv:2105.11827","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2022 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Split the mempool from the consensus. Narwhal is a DAG of certified batches. Tusk picks a leader inside that DAG. Later Sui consensus descends from this split. The paper is not a Sui status report.","canonical_url":"https://blockchainlab.com/whitepaper/narwhal-tusk","record_url":"https://blockchainlab.com/research/corpus/papers/narwhal-tusk","study_url":"https://blockchainlab.com/whitepaper/narwhal-tusk","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0069","slug":"snow-white","title":"Snow White: Robustly Reconfigurable Consensus","authors":"Phil Daian, Rafael Pass and Elaine Shi","year":2017,"date_label":"2017","publisher":"Phil Daian, Rafael Pass and Elaine Shi","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://eprint.iacr.org/2016/919","source_label":"ePrint 2016/919","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A proof-of-stake design in the sleepy model: honest nodes may be offline, and the set of stakeholders can change. It is an academic predecessor, not Cardano and not Ethereum.","canonical_url":"https://blockchainlab.com/whitepaper/snow-white","record_url":"https://blockchainlab.com/research/corpus/papers/snow-white","study_url":"https://blockchainlab.com/whitepaper/snow-white","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0070","slug":"thunderella","title":"Thunderella: Blockchains with Optimistic Instant Confirmation","authors":"Rafael Pass and Elaine Shi","year":2017,"date_label":"2017","publisher":"Rafael Pass and Elaine Shi","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://eprint.iacr.org/2017/454","source_label":"ePrint 2017/454","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A fast path and a slow path. If a large supermajority is honest and an accelerator proposes quickly, transactions confirm at network speed. If not, the protocol falls back to an underlying chain.","canonical_url":"https://blockchainlab.com/whitepaper/thunderella","record_url":"https://blockchainlab.com/research/corpus/papers/thunderella","study_url":"https://blockchainlab.com/whitepaper/thunderella","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0071","slug":"confidential-transactions","title":"Confidential Transactions","authors":"Gregory Maxwell","year":2015,"date_label":"2015","publisher":"Gregory Maxwell","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://elementsproject.org/features/confidential-transactions","source_label":"Elements Project","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2015 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Hide the amounts on a Bitcoin-style transaction with Pedersen commitments, and use range proofs so a commitment cannot stand for a negative number. The graph of who paid whom stays visible.","canonical_url":"https://blockchainlab.com/whitepaper/confidential-transactions","record_url":"https://blockchainlab.com/research/corpus/papers/confidential-transactions","study_url":"https://blockchainlab.com/whitepaper/confidential-transactions","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0072","slug":"bulletproofs","title":"Bulletproofs: Short Proofs for Confidential Transactions and More","authors":"Benedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille and Greg Maxwell","year":2018,"date_label":"2018","publisher":"Benedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille and Greg Maxwell","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://eprint.iacr.org/2017/1066","source_label":"ePrint 2017/1066","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Range proofs whose size grows logarithmically, with no trusted setup. They made confidential amounts practical to verify. They are not, by themselves, a private payment system.","canonical_url":"https://blockchainlab.com/whitepaper/bulletproofs","record_url":"https://blockchainlab.com/research/corpus/papers/bulletproofs","study_url":"https://blockchainlab.com/whitepaper/bulletproofs","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0073","slug":"groth16","title":"On the Size of Pairing-based Non-interactive Arguments","authors":"Jens Groth","year":2016,"date_label":"2016","publisher":"Jens Groth","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://eprint.iacr.org/2016/260","source_label":"ePrint 2016/260","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2016 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A pairing-based argument in three group elements. The proofs are tiny and cheap to verify. Each circuit needs its own setup, and a leaked setup can forge proofs.","canonical_url":"https://blockchainlab.com/whitepaper/groth16","record_url":"https://blockchainlab.com/research/corpus/papers/groth16","study_url":"https://blockchainlab.com/whitepaper/groth16","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0074","slug":"plonk","title":"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge","authors":"Ariel Gabizon, Zachary J. Williamson and Oana Ciobotaru","year":2019,"date_label":"2019","publisher":"Ariel Gabizon, Zachary J. Williamson and Oana Ciobotaru","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://eprint.iacr.org/2019/953","source_label":"ePrint 2019/953","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A SNARK with a universal and updatable structured reference string. One setup can serve many circuits. The proofs are larger than Groth16, and there is still a setup.","canonical_url":"https://blockchainlab.com/whitepaper/plonk","record_url":"https://blockchainlab.com/research/corpus/papers/plonk","study_url":"https://blockchainlab.com/whitepaper/plonk","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0075","slug":"halo","title":"Halo: Recursive Proof Composition without a Trusted Setup","authors":"Sean Bowe, Jack Grigg and Daira Hopwood","year":2019,"date_label":"2019","publisher":"Sean Bowe, Jack Grigg and Daira Hopwood","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://eprint.iacr.org/2019/1021","source_label":"ePrint 2019/1021","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Recursion for inner-product arguments, without a structured setup. A proof can attest that another proof was checked. That is how a chain can fold a long history into one object. Halo 2 is a later system.","canonical_url":"https://blockchainlab.com/whitepaper/halo","record_url":"https://blockchainlab.com/research/corpus/papers/halo","study_url":"https://blockchainlab.com/whitepaper/halo","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0076","slug":"zexe","title":"Zexe: Enabling Decentralized Private Computation","authors":"Sean Bowe, Alessandro Chiesa, Matthew Green, Ian Miers, Pratyush Mishra and Howard Wu","year":2020,"date_label":"2020","publisher":"Sean Bowe, Alessandro Chiesa, Matthew Green, Ian Miers, Pratyush Mishra and Howard Wu","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://eprint.iacr.org/2018/962","source_label":"ePrint 2018/962","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A model for private computation over records. Each record has a birth predicate and a death predicate. A transaction proves that some records died and others were born, without showing which, or showing the data.","canonical_url":"https://blockchainlab.com/whitepaper/zexe","record_url":"https://blockchainlab.com/research/corpus/papers/zexe","study_url":"https://blockchainlab.com/whitepaper/zexe","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0077","slug":"fraud-and-da","title":"Fraud and Data Availability Proofs","authors":"Mustafa Al-Bassam, Alberto Sonnino and Vitalik Buterin","year":2018,"date_label":"2018","publisher":"Mustafa Al-Bassam, Alberto Sonnino and Vitalik Buterin","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://arxiv.org/abs/1809.09044","source_label":"arXiv:1809.09044","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Light clients can refuse a block if a fraud proof shows it is invalid, but only if the block's data was actually published. The paper shows how erasure coding and sampling let clients check publication without downloading everything.","canonical_url":"https://blockchainlab.com/whitepaper/fraud-and-da","record_url":"https://blockchainlab.com/research/corpus/papers/fraud-and-da","study_url":"https://blockchainlab.com/whitepaper/fraud-and-da","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0078","slug":"truebit","title":"A scalable verification solution for blockchains","authors":"Jason Teutsch and Christian Reitwiessner","year":2017,"date_label":"2017","publisher":"Jason Teutsch and Christian Reitwiessner","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://people.cs.uchicago.edu/~teutsch/papers/truebit.pdf","source_label":"TrueBit white paper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Pay a solver to run a heavy computation off-chain, and pay a verifier only when they find a lie. An interactive game narrows the lie to one step. A jackpot is there so verifiers show up even when solvers are usually honest.","canonical_url":"https://blockchainlab.com/whitepaper/truebit","record_url":"https://blockchainlab.com/research/corpus/papers/truebit","study_url":"https://blockchainlab.com/whitepaper/truebit","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0079","slug":"kzg","title":"Constant-Size Commitments to Polynomials and Their Applications","authors":"Aniket Kate, Gregory M. Zaverucha and Ian Goldberg","year":2010,"date_label":"2010","publisher":"Aniket Kate, Gregory M. Zaverucha and Ian Goldberg","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://www.iacr.org/archive/asiacrypt2010/6477178/6477178.pdf","source_label":"ASIACRYPT 2010","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2010 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Commit to a polynomial and later open it at a point, in constant size, with a pairing. The commitment is binding if the setup's trapdoor stays secret. Modern data-availability schemes use this as a brick. The paper is older than those schemes.","canonical_url":"https://blockchainlab.com/whitepaper/kzg","record_url":"https://blockchainlab.com/research/corpus/papers/kzg","study_url":"https://blockchainlab.com/whitepaper/kzg","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0080","slug":"proofs-of-space","title":"Proofs of Space","authors":"Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov and Krzysztof Pietrzak","year":2015,"date_label":"2015","publisher":"Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov and Krzysztof Pietrzak","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://eprint.iacr.org/2013/796","source_label":"ePrint 2013/796","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2015 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A proof that a machine reserved storage, not that it burned energy on a puzzle. The verifier checks a small challenge. Chia is a later system that pairs this idea with a verifiable delay. The paper is not Chia.","canonical_url":"https://blockchainlab.com/whitepaper/proofs-of-space","record_url":"https://blockchainlab.com/research/corpus/papers/proofs-of-space","study_url":"https://blockchainlab.com/whitepaper/proofs-of-space","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0081","slug":"vdf","title":"Verifiable Delay Functions","authors":"Dan Boneh, Joseph Bonneau, Benedikt Bünz and Ben Fisch","year":2018,"date_label":"2018","publisher":"Dan Boneh, Joseph Bonneau, Benedikt Bünz and Ben Fisch","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://eprint.iacr.org/2018/601","source_label":"ePrint 2018/601","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A function that forces a wait. Evaluating it takes a set number of sequential steps. Checking the result is quick, and the output is unique. Parallel machines do not make the wait much shorter.","canonical_url":"https://blockchainlab.com/whitepaper/vdf","record_url":"https://blockchainlab.com/research/corpus/papers/vdf","study_url":"https://blockchainlab.com/whitepaper/vdf","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0082","slug":"atomic-swaps","title":"Atomic Cross-Chain Swaps","authors":"Maurice Herlihy","year":2018,"date_label":"2018","publisher":"Maurice Herlihy","paper_type":"Design paper","category":"Interoperability","topics":["Interoperability"],"source_url":"https://arxiv.org/abs/1801.09515","source_label":"arXiv:1801.09515","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2018 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A swap across ledgers where either every transfer completes or none does, using hash locks and time locks. There is no custodian in the paper. A party can still walk away and leave the other waiting.","canonical_url":"https://blockchainlab.com/whitepaper/atomic-swaps","record_url":"https://blockchainlab.com/research/corpus/papers/atomic-swaps","study_url":"https://blockchainlab.com/whitepaper/atomic-swaps","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0083","slug":"sprites","title":"Sprites and State Channels","authors":"Andrew Miller, Iddo Bentov, Sandeep Bakshi, Ranjit Kumaresan and Patrick McCorry","year":2017,"date_label":"2017","publisher":"Andrew Miller, Iddo Bentov, Sandeep Bakshi, Ranjit Kumaresan and Patrick McCorry","paper_type":"Design paper","category":"Interoperability","topics":["Interoperability"],"source_url":"https://arxiv.org/abs/1702.05812","source_label":"arXiv:1702.05812","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"State channels whose disputes do not have to hop one channel at a time. A global preimage manager lets a payment resolve in constant time on-chain. Lightning did not adopt this design as its production path.","canonical_url":"https://blockchainlab.com/whitepaper/sprites","record_url":"https://blockchainlab.com/research/corpus/papers/sprites","study_url":"https://blockchainlab.com/whitepaper/sprites","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0084","slug":"ibc","title":"The Interblockchain Communication Protocol","authors":"Christopher Goes and the Cosmos IBC specification","year":2020,"date_label":"2020","publisher":"Christopher Goes and the Cosmos IBC specification","paper_type":"Design paper","category":"Interoperability","topics":["Interoperability"],"source_url":"https://github.com/cosmos/ibc","source_label":"Cosmos IBC specification","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Two chains verify each other with light clients. A relayer carries packets and proofs. The relayer is not trusted to tell the truth. It is trusted to bother showing up. Security is the security of both chains.","canonical_url":"https://blockchainlab.com/whitepaper/ibc","record_url":"https://blockchainlab.com/research/corpus/papers/ibc","study_url":"https://blockchainlab.com/whitepaper/ibc","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0085","slug":"flash-boys-2","title":"Flash Boys 2.0: Frontrunning, Transaction Reordering, and Consensus Instability in Decentralized Exchanges","authors":"Philip Daian, Steven Goldfeder, Tyler Kell, Yunqi Li, Xueyuan Zhao, Iddo Bentov, Lorenz Breidenbach and Ari Juels","year":2019,"date_label":"2019","publisher":"Philip Daian, Steven Goldfeder, Tyler Kell, Yunqi Li, Xueyuan Zhao, Iddo Bentov, Lorenz Breidenbach and Ari Juels","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://arxiv.org/abs/1904.05234","source_label":"arXiv:1904.05234","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A measurement paper. Miners and bots reorder and insert transactions around DEX trades. The authors name miner-extractable value and show priority gas auctions. It is not a trading manual, and it is not a claim that any strategy here is available or profitable now.","canonical_url":"https://blockchainlab.com/whitepaper/flash-boys-2","record_url":"https://blockchainlab.com/research/corpus/papers/flash-boys-2","study_url":"https://blockchainlab.com/whitepaper/flash-boys-2","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0086","slug":"uniswap-v4","title":"Uniswap v4 Core","authors":"Hayden Adams and the Uniswap v4 authors","year":2023,"date_label":"2023","publisher":"Hayden Adams and the Uniswap v4 authors","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://github.com/Uniswap/v4-core/blob/main/docs/whitepaper-v4.pdf","source_label":"Uniswap v4 core whitepaper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2023 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"One contract holds many pools. Hooks are code that runs before and after swaps and liquidity changes. Flash accounting settles balances at the end of a lock. A hook can change the rules v3 users took for granted.","canonical_url":"https://blockchainlab.com/whitepaper/uniswap-v4","record_url":"https://blockchainlab.com/research/corpus/papers/uniswap-v4","study_url":"https://blockchainlab.com/whitepaper/uniswap-v4","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0087","slug":"twamm","title":"The Time-Weighted Average Market Maker","authors":"Dave White and Dan Robinson","year":2021,"date_label":"2021","publisher":"Dave White and Dan Robinson","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://www.paradigm.xyz/2021/07/twamm","source_label":"Paradigm, 2021","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2021 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Execute a large order as if it were split into infinitely many tiny trades across an interval, without paying gas for each piece. Settlement is lazy. This is an order schedule, not a price oracle, despite the nearby acronym TWAP.","canonical_url":"https://blockchainlab.com/whitepaper/twamm","record_url":"https://blockchainlab.com/research/corpus/papers/twamm","study_url":"https://blockchainlab.com/whitepaper/twamm","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0088","slug":"liquity","title":"Liquity: Decentralized Borrowing","authors":"Robert Lauko and Rick Pardoe","year":2021,"date_label":"2021","publisher":"Robert Lauko and Rick Pardoe","paper_type":"Design paper","category":"Credit and stable value","topics":["Credit and stable value"],"source_url":"https://github.com/liquity/dev/blob/main/papers/Liquity-Whitepaper.pdf","source_label":"Liquity whitepaper","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2021 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Borrow a stable-value token against ether, with a one-time fee instead of an interest rate. Troves are liquidated into a stability pool. Redemptions let the token be swapped for the collateral of the weakest trove. The paper does not promise a peg.","canonical_url":"https://blockchainlab.com/whitepaper/liquity","record_url":"https://blockchainlab.com/research/corpus/papers/liquity","study_url":"https://blockchainlab.com/whitepaper/liquity","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0089","slug":"eip-4337","title":"Account Abstraction Using Alt Mempool","authors":"Vitalik Buterin, Yoav Weiss, Dror Tirosh, Shahaf Nacson, Alex Forshtat, Kristof Gazso and Tjaden Hess","year":2021,"date_label":"2021","publisher":"Vitalik Buterin, Yoav Weiss, Dror Tirosh, Shahaf Nacson, Alex Forshtat, Kristof Gazso and Tjaden Hess","paper_type":"Design paper","category":"Data and agents","topics":["Data and agents"],"source_url":"https://eips.ethereum.org/EIPS/eip-4337","source_label":"EIP-4337","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2021 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Smart-contract accounts that propose UserOperations, bundled by a separate mempool, without a change to Ethereum's consensus. Paymasters can sponsor gas. The validation rule lives in the account, which is the point and the risk.","canonical_url":"https://blockchainlab.com/whitepaper/eip-4337","record_url":"https://blockchainlab.com/research/corpus/papers/eip-4337","study_url":"https://blockchainlab.com/whitepaper/eip-4337","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0090","slug":"gasper","title":"Combining GHOST and Casper","authors":"Vitalik Buterin, Diego Hernandez, Thor Kamphefner, Khiem Pham, Zhi Qiao, Danny Ryan, Juhyeok Sin, Ying Wang and Yan X. Zhang","year":2020,"date_label":"2020","publisher":"Vitalik Buterin, Diego Hernandez, Thor Kamphefner, Khiem Pham, Zhi Qiao, Danny Ryan, Juhyeok Sin, Ying Wang and Yan X. Zhang","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://arxiv.org/abs/2003.03052","source_label":"arXiv:2003.03052","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"An idealised proof-of-stake protocol that pairs a GHOST-style fork choice with Casper FFG finality. The paper is the design argument for Ethereum's beacon chain, not a status report on a later client or a later outage.","canonical_url":"https://blockchainlab.com/whitepaper/gasper","record_url":"https://blockchainlab.com/research/corpus/papers/gasper","study_url":"https://blockchainlab.com/whitepaper/gasper","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0091","slug":"prism","title":"Deconstructing the Blockchain to Approach Physical Limits","authors":"Vivek Bagaria, Sreeram Kannan, David Tse, Giulia Fanti and Pramod Viswanath","year":2019,"date_label":"2019","publisher":"Vivek Bagaria, Sreeram Kannan, David Tse, Giulia Fanti and Pramod Viswanath","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://arxiv.org/abs/1810.08092","source_label":"arXiv:1810.08092","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Bitcoin uses one chain for three jobs: proposing transactions, voting on history, and ordering the result. Prism splits those jobs onto separate block trees so throughput can approach network capacity while confirmation tracks propagation delay.","canonical_url":"https://blockchainlab.com/whitepaper/prism","record_url":"https://blockchainlab.com/research/corpus/papers/prism","study_url":"https://blockchainlab.com/whitepaper/prism","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0092","slug":"streamlet","title":"Streamlet: Textbook Streamlined Blockchains","authors":"Benjamin Y. Chan and Elaine Shi","year":2020,"date_label":"2020","publisher":"Benjamin Y. Chan and Elaine Shi","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://eprint.iacr.org/2020/088","source_label":"ePrint 2020/088","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A deliberately small consensus protocol: epochs, a leader, a vote, and a rule that three adjacent certified blocks on the same chain become final. The point is to show how little machinery the last few years of BFT designs actually need.","canonical_url":"https://blockchainlab.com/whitepaper/streamlet","record_url":"https://blockchainlab.com/research/corpus/papers/streamlet","study_url":"https://blockchainlab.com/whitepaper/streamlet","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0093","slug":"fruitchains","title":"FruitChains: A Fair Blockchain","authors":"Rafael Pass and Elaine Shi","year":2016,"date_label":"2016","publisher":"Rafael Pass and Elaine Shi","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://eprint.iacr.org/2016/916","source_label":"ePrint 2016/916","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2016 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Nakamoto consensus can pay a minority coalition more than its share of hash power, which is the selfish-mining observation. FruitChains records transactions in 'fruit' that hang off the chain, and pays out over a window so honest hash power gets roughly honest rewards.","canonical_url":"https://blockchainlab.com/whitepaper/fruitchains","record_url":"https://blockchainlab.com/research/corpus/papers/fruitchains","study_url":"https://blockchainlab.com/whitepaper/fruitchains","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0094","slug":"dag-rider","title":"All You Need is DAG","authors":"Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor and Alexander Spiegelman","year":2021,"date_label":"2021","publisher":"Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor and Alexander Spiegelman","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://arxiv.org/abs/2102.08325","source_label":"arXiv:2102.08325","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2021 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Replicas reliably broadcast proposals into a round-structured DAG. Once the DAG is local, each replica can read a total order off it without another round of consensus messages. The paper is the asynchronous, optimally resilient version of that idea.","canonical_url":"https://blockchainlab.com/whitepaper/dag-rider","record_url":"https://blockchainlab.com/research/corpus/papers/dag-rider","study_url":"https://blockchainlab.com/whitepaper/dag-rider","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0095","slug":"bullshark","title":"Bullshark: DAG BFT Protocols Made Practical","authors":"Alexander Spiegelman, Neil Giridharan, Alberto Sonnino and Lefteris Kokoris-Kogias","year":2022,"date_label":"2022","publisher":"Alexander Spiegelman, Neil Giridharan, Alberto Sonnino and Lefteris Kokoris-Kogias","paper_type":"Design paper","category":"Consensus","topics":["Consensus"],"source_url":"https://arxiv.org/abs/2201.05677","source_label":"arXiv:2201.05677","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2022 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"DAG-Rider is built for asynchrony and pays for it on the common path. Bullshark keeps a DAG and a local commit rule, but adds a fast path for when the network is timely. The paper also writes down a simpler partially synchronous version.","canonical_url":"https://blockchainlab.com/whitepaper/bullshark","record_url":"https://blockchainlab.com/research/corpus/papers/bullshark","study_url":"https://blockchainlab.com/whitepaper/bullshark","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0096","slug":"eip-1559","title":"Fee market change for ETH 1.0 chain","authors":"Vitalik Buterin, Eric Conner, Rick Dudley, Matthew Slipper, Ian Norden and Abdelhamid Bakhta","year":2019,"date_label":"2019","publisher":"Vitalik Buterin, Eric Conner, Rick Dudley, Matthew Slipper, Ian Norden and Abdelhamid Bakhta","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://eips.ethereum.org/EIPS/eip-1559","source_label":"EIP-1559","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Replace a first-price auction for inclusion with a protocol-quoted base fee that moves with demand, plus a tip to the producer. The base fee is burned. The EIP is a fee-market rule, not a promise that fees will be low.","canonical_url":"https://blockchainlab.com/whitepaper/eip-1559","record_url":"https://blockchainlab.com/research/corpus/papers/eip-1559","study_url":"https://blockchainlab.com/whitepaper/eip-1559","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0097","slug":"fee-mechanism","title":"Transaction Fee Mechanism Design","authors":"Tim Roughgarden","year":2020,"date_label":"2020","publisher":"Tim Roughgarden","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://arxiv.org/abs/2012.00854","source_label":"arXiv:2012.00854","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A mechanism-design reading of blockchain fees. Roughgarden separates what users pay, what miners keep, and what gets burned, and asks which combinations are incentive-compatible for myopic miners. EIP-1559 is the running example, not a price forecast.","canonical_url":"https://blockchainlab.com/whitepaper/fee-mechanism","record_url":"https://blockchainlab.com/research/corpus/papers/fee-mechanism","study_url":"https://blockchainlab.com/whitepaper/fee-mechanism","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0098","slug":"eip-4844","title":"Shard Blob Transactions","authors":"Vitalik Buterin, Dankrad Feist, Diederik Loerakker, George Kadianakis, Matt Garnett, Mofi Taiwo and Ansgar Dietrichs","year":2022,"date_label":"2022","publisher":"Vitalik Buterin, Dankrad Feist, Diederik Loerakker, George Kadianakis, Matt Garnett, Mofi Taiwo and Ansgar Dietrichs","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://eips.ethereum.org/EIPS/eip-4844","source_label":"EIP-4844","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2022 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A new transaction type carries a blob: a large chunk of data that consensus nodes hold briefly and that the execution layer cannot read byte by byte. Rollups are the intended user. The blob is not cheap forever, and it is not the rollup's proof.","canonical_url":"https://blockchainlab.com/whitepaper/eip-4844","record_url":"https://blockchainlab.com/research/corpus/papers/eip-4844","study_url":"https://blockchainlab.com/whitepaper/eip-4844","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0099","slug":"bitvm","title":"BitVM: Compute Anything on Bitcoin","authors":"Robin Linus","year":2023,"date_label":"2023","publisher":"Robin Linus","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://bitvm.org/bitvm.pdf","source_label":"bitvm.org","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2023 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A way to dispute an arbitrary computation between two Bitcoin parties using hashlocks, timelocks and large Taproot trees, without a new opcode. Honest execution stays off-chain. A false claim can be challenged on-chain. It is not a global virtual machine.","canonical_url":"https://blockchainlab.com/whitepaper/bitvm","record_url":"https://blockchainlab.com/research/corpus/papers/bitvm","study_url":"https://blockchainlab.com/whitepaper/bitvm","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0100","slug":"cairo","title":"Cairo – a Turing-complete STARK-friendly CPU architecture","authors":"Lior Goldberg, Shahar Papini and Michael Riabzev","year":2021,"date_label":"2021","publisher":"Lior Goldberg, Shahar Papini and Michael Riabzev","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://eprint.iacr.org/2021/1063","source_label":"ePrint 2021/1063","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2021 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A CPU whose every instruction was chosen so that a STARK can prove 'this program ran'. You write a program instead of a new set of polynomial equations for each statement. The paper is the machine, not a network's throughput.","canonical_url":"https://blockchainlab.com/whitepaper/cairo","record_url":"https://blockchainlab.com/research/corpus/papers/cairo","study_url":"https://blockchainlab.com/whitepaper/cairo","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0101","slug":"nova","title":"Nova: Recursive Zero-Knowledge Arguments from Folding Schemes","authors":"Abhiram Kothapalli, Srinath Setty and Ioanna Tzialla","year":2021,"date_label":"2021","publisher":"Abhiram Kothapalli, Srinath Setty and Ioanna Tzialla","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://eprint.iacr.org/2021/370","source_label":"ePrint 2021/370","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2021 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Incrementally verifiable computation without putting a SNARK inside a SNARK. A folding scheme compresses two instances of a computation into one instance of the same size. Repeating that fold is the recursion. The paper is about prover cost, not about a chain.","canonical_url":"https://blockchainlab.com/whitepaper/nova","record_url":"https://blockchainlab.com/research/corpus/papers/nova","study_url":"https://blockchainlab.com/whitepaper/nova","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0102","slug":"marlin","title":"Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS","authors":"Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely and Nicholas Ward","year":2019,"date_label":"2019","publisher":"Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely and Nicholas Ward","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://eprint.iacr.org/2019/1047","source_label":"ePrint 2019/1047","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2019 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A preprocessing zkSNARK whose structured reference string is universal and can be updated, rather than baked for one circuit in a ceremony that must be trusted forever. The paper improves on Sonic's costs. It is still a SNARK, with a setup.","canonical_url":"https://blockchainlab.com/whitepaper/marlin","record_url":"https://blockchainlab.com/research/corpus/papers/marlin","study_url":"https://blockchainlab.com/whitepaper/marlin","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0103","slug":"frost","title":"FROST: Flexible Round-Optimized Schnorr Threshold Signatures","authors":"Chelsea Komlo and Ian Goldberg","year":2020,"date_label":"2020","publisher":"Chelsea Komlo and Ian Goldberg","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://eprint.iacr.org/2020/852","source_label":"ePrint 2020/852","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A threshold Schnorr signature: any t of n signers can produce one ordinary-looking signature, and fewer than t cannot. The signing protocol is two rounds, or one if nonces were prepared earlier. The paper is the scheme, not a custody vendor.","canonical_url":"https://blockchainlab.com/whitepaper/frost","record_url":"https://blockchainlab.com/research/corpus/papers/frost","study_url":"https://blockchainlab.com/whitepaper/frost","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0104","slug":"musig2","title":"MuSig2: Simple Two-Round Schnorr Multi-Signatures","authors":"Jonas Nick, Tim Ruffing and Yannick Seurin","year":2020,"date_label":"2020","publisher":"Jonas Nick, Tim Ruffing and Yannick Seurin","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://eprint.iacr.org/2020/1261","source_label":"ePrint 2020/1261","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"n signers, all of them, produce one Schnorr signature that verifies under one aggregated key. Two rounds, and concurrent sessions are in the security claim. This is n-of-n, not a threshold. It is the multi-signature Bitcoin-style schemes reached for.","canonical_url":"https://blockchainlab.com/whitepaper/musig2","record_url":"https://blockchainlab.com/research/corpus/papers/musig2","study_url":"https://blockchainlab.com/whitepaper/musig2","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0105","slug":"taproot","title":"BIP 341: Taproot: SegWit version 1 spending rules","authors":"Pieter Wuille, Jonas Nick and Anthony Towns","year":2020,"date_label":"2020","publisher":"Pieter Wuille, Jonas Nick and Anthony Towns","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://github.com/bitcoin/bips/blob/master/bip-0341.mediawiki","source_label":"BIP 341","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A Bitcoin spend that can look like a single key, while still hiding a tree of alternative scripts until one of them is used. Schnorr signatures and the key-path spend are the mechanism. Amounts stay public. This is not a privacy coin.","canonical_url":"https://blockchainlab.com/whitepaper/taproot","record_url":"https://blockchainlab.com/research/corpus/papers/taproot","study_url":"https://blockchainlab.com/whitepaper/taproot","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0106","slug":"curve-cryptoswap","title":"Automatic market-making with dynamic peg","authors":"Michael Egorov","year":2021,"date_label":"2021","publisher":"Michael Egorov","paper_type":"Design paper","category":"Markets","topics":["Markets"],"source_url":"https://classic.curve.finance/files/crypto-pools-paper.pdf","source_label":"Curve Finance, 2021","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2021 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Stableswap concentrates liquidity around a fixed price of one. This paper moves that concentration so it can follow a moving price between volatile assets. The pool reprices itself from its own trades. It does not know the outside world except through those trades.","canonical_url":"https://blockchainlab.com/whitepaper/curve-cryptoswap","record_url":"https://blockchainlab.com/research/corpus/papers/curve-cryptoswap","study_url":"https://blockchainlab.com/whitepaper/curve-cryptoswap","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0107","slug":"curve-stablecoin","title":"Curve stablecoin design","authors":"Michael Egorov","year":2022,"date_label":"2022","publisher":"Michael Egorov","paper_type":"Design paper","category":"Credit and stable value","topics":["Credit and stable value"],"source_url":"https://docs.curve.finance/pdf/whitepapers/whitepaper_curve_stablecoin.pdf","source_label":"Curve Finance, 2022","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2022 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A stablecoin lent against volatile collateral, where liquidation is a continuous trade into a special pool rather than a one-shot auction. The paper calls that pool LLAMMA. A peg keeper and a monetary-policy rate sit beside it. Simulations in the paper are not a promise about later losses.","canonical_url":"https://blockchainlab.com/whitepaper/curve-stablecoin","record_url":"https://blockchainlab.com/research/corpus/papers/curve-stablecoin","study_url":"https://blockchainlab.com/whitepaper/curve-stablecoin","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0108","slug":"uma","title":"UMA Data Verification Mechanism: Adding Economic Guarantees to Blockchain Oracles","authors":"UMA","year":2020,"date_label":"2020","publisher":"UMA","paper_type":"Design paper","category":"Data and agents","topics":["Data and agents"],"source_url":"https://github.com/UMAprotocol/whitepaper/blob/master/UMA-DVM-oracle-whitepaper.pdf","source_label":"UMA DVM draft v0.2, 2020","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"An oracle that does not answer every question in real time. It prices the cost of bribing the token holders who would resolve a dispute, and it asks contract designers to keep the profit of a lie below that cost. The draft is an economic argument, not a feed you can read as truth.","canonical_url":"https://blockchainlab.com/whitepaper/uma","record_url":"https://blockchainlab.com/research/corpus/papers/uma","study_url":"https://blockchainlab.com/whitepaper/uma","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0109","slug":"perun","title":"Perun: Virtual Payment Hubs over Cryptocurrencies","authors":"Stefan Dziembowski, Lisa Eckey, Sebastian Faust and Daniel Malinowski","year":2017,"date_label":"2017","publisher":"Stefan Dziembowski, Lisa Eckey, Sebastian Faust and Daniel Malinowski","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://eprint.iacr.org/2017/635","source_label":"ePrint 2017/635","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2017 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Lightning routes each payment through the intermediaries. Perun asks those intermediaries to set up a virtual channel and then step out of the individual payments. The paper gives the construction for one hub, on a chain that can run the contracts.","canonical_url":"https://blockchainlab.com/whitepaper/perun","record_url":"https://blockchainlab.com/research/corpus/papers/perun","study_url":"https://blockchainlab.com/whitepaper/perun","last_reviewed":"2026-10-01","last_checked":"2026-10-01"},{"document_id":"BLC-STUDY-0110","slug":"semaphore","title":"Semaphore: Zero-Knowledge Signaling on Ethereum","authors":"Kobi Gurkan, Koh Wei Jie and Barry Whitehat","year":2020,"date_label":"2020","publisher":"Kobi Gurkan, Koh Wei Jie and Barry Whitehat","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://semaphore.pse.dev/whitepaper-v1.pdf","source_label":"Semaphore proposal, 2020","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"A member of a group proves they are some member, and posts a signal, without showing which member. A nullifier stops the same member signalling twice in the same context. The 2020 proposal is a base layer for voting and similar uses. It is not itself a mixer, and later versions changed the circuits.","canonical_url":"https://blockchainlab.com/whitepaper/semaphore","record_url":"https://blockchainlab.com/research/corpus/papers/semaphore","study_url":"https://blockchainlab.com/whitepaper/semaphore","last_reviewed":"2026-10-01","last_checked":"2026-10-01"}]}