Deconstructing the Blockchain to Approach Physical Limits

The five-minute read

One action, walked through

1. Miners produce proposer blocks that hold transactions.
2. Miners also extend voter chains, which reference proposer blocks.
3. A node totals the votes before accepting a transaction's position.
4. The paper's confirmation error falls as the bandwidth-delay product grows, under its model.
5. A total order of transactions is the output the protocol claims, eventually.

The argument, unpacked

What has to be true

• Honest majority of hash power, in the Nakamoto sense.
• A model of capacity and propagation delay that matches the theorems being cited.
• Votes and proposals are distinguishable objects in the implementation, not one chain with a new marketing diagram.
• The adversary cannot break the hash function. The usual cryptographic assumptions apply.

What happened after the paper

Prism is the clean citation for 'separate proposing from voting' inside proof of work. Bitcoin-NG separated leader election from microblocks. Prism separates the vote as well. Neither paper is a license to quote a capacity number as a product metric.

What to check before you use the idea

• Which blocks carry transactions, and which blocks are only votes?
• What is the hash-power assumption, in words?
• Is a latency claim tied to propagation delay, or to a benchmark?
• Does the implementation still have one chain?

Terms

Proposer block

A mined block whose job is to carry transactions, not to be the sole vote on history.

Voter chain

A proof-of-work chain whose blocks count as votes for proposer blocks.

The problem the paper names

A single Nakamoto chain couples the block interval to both security and throughput. Shorten the interval and forks waste honest work. Prism asks which of those jobs actually need to share a chain.

What the design proposes

• Proposer blocks carry transactions.
• Voter chains cast votes on which proposer blocks to keep.
• A final order is read off the votes, not off one longest chain.

How the mechanism is specified

• The security claim is still honest-majority proof of work, up to one half of hash power, as in Bitcoin.
• Throughput is argued up to the capacity of the network. Latency for honest transactions is argued against the propagation delay.
• The paper is a protocol and a proof. It is not a measurement of a later mainnet.

What this page does not treat as proven

• Splitting the chains does not remove mining. It reassigns what a mined block means.
• Physical limits in the paper are network capacity and delay, not a token's market throughput.
• An implementation that merges the trees back into one product chain is a different system.

Why a venture studio still reads it

Use it when a design claims to be 'near the speed of light' or 'at network capacity'. Ask which blocks propose, which blocks vote, and what an adversary with almost half the hash power can still delay.