Skip to content

LibraryConsensus2026Design paperCorpus record

Symphony: execution-aware consensus and proposer disaggregation

Ritual Symphony. Ritual.

Symphony argues that ordinary consensus assumes execution is cheap and deterministic, and that this fails when a transaction is expensive or random. It proposes to split a proposer's control of a block into separate checks, and to accept a proof of delegated work instead of asking every validator to re-run it.

A reading of the project's public design document. Not a copy, not a benchmark, and not an offer.

Symphony argues that ordinary consensus assumes execution is cheap and deterministic, and that this fails when a transaction is expensive or random. It proposes to split a proposer's control of a block into separate checks, and to accept a proof of delegated work instead of asking every validator to re-run it.
Evidence
Primary paper
Re-measured
No
Assumptions
3
Records linked
2

01 Claim ledger

What the paper is allowed to say

Each row is a sentence already in the study. The status is the same on every row: a model claim, not a live measurement.

  1. Claim 01 · Paper model

    The defect

    A paper that names proofs and committees has not shipped them. If block validity does not actually check the inclusion rule the abstract describes, the proposer still has the old power.

  2. Claim 02 · Paper model

    The proposal

    Symphony argues that ordinary consensus assumes execution is cheap and deterministic, and that this fails when a transaction is expensive or random. It proposes to split a proposer's control of a block into separate checks, and to accept a proof of delegated work instead of asking every validator to re-run it.

  3. Claim 03 · Paper model

    The mechanism

    Deterministic transactions can still be executed by every honest replica. A random or heavy one is delegated, and a proof is what the other replicas check.

  4. Claim 04 · Paper model

    The bound

    This note quotes no latency and no throughput.

02 Three cuts

Observation, model, falsifier

A desk does not stop at the summary. Each claim is cut three ways, using only this study's own assumptions and checks. Nothing here is a new figure.

  1. 01 The defect

    Observation

    What the study says

    A paper that names proofs and committees has not shipped them. If block validity does not actually check the inclusion rule the abstract describes, the proposer still has the old power.

    Model

    What has to hold

    You are reading the Symphony paper of 20 April 2026. A page about Infernet is an older design, not this text.

    Falsifier

    What would retire it

    Which proposer powers become checks inside block validity?

  2. 02 The proposal

    Observation

    What the study says

    Symphony argues that ordinary consensus assumes execution is cheap and deterministic, and that this fails when a transaction is expensive or random. It proposes to split a proposer's control of a block into separate checks, and to accept a proof of delegated work instead of asking every validator to re-run it.

    Model

    What has to hold

    You are reading the Symphony paper of 20 April 2026. A page about Infernet is an older design, not this text.

    Falsifier

    What would retire it

    Who verifies a delegated proof: every validator, or a sampled committee?

  3. 03 The mechanism

    Observation

    What the study says

    Deterministic transactions can still be executed by every honest replica. A random or heavy one is delegated, and a proof is what the other replicas check.

    Model

    What has to hold

    No price, supply, yield, or adoption figure is added by this desk.

    Falsifier

    What would retire it

    Which transactions does the paper still require every honest replica to execute?

  4. 04 The bound

    Observation

    What the study says

    This note quotes no latency and no throughput.

    Model

    What has to hold

    You are reading the Symphony paper of 20 April 2026. A page about Infernet is an older design, not this text.

    Falsifier

    What would retire it

    Which transactions does the paper still require every honest replica to execute?

03 Sequence

One action, as an operating tape

  1. 01Deterministic transactions can still be executed by every honest replica. A random or heavy one is delegated, and a proof is what the other replicas check.
  2. 02Inclusion, exclusion, timing, and ordering are treated as separate validity conditions rather than one proposer's private bundle.
  3. 03Verification of a delegated proof can be assigned to a sampled committee. The committee is smaller than the whole set, so the sampling assumption is the security assumption. This note does not restate a bound.

04 Load-bearing

The argument, and where a pitch drops it

  1. What the name has to mean

    The cut

    Symphony argues that ordinary consensus assumes execution is cheap and deterministic, and that this fails when a transaction is expensive or random. It proposes to split a proposer's control of a block into separate checks, and to accept a proof of delegated work instead of asking every validator to re-run it.

    Why it carries weight

    If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.

    Where it is dropped

    Soundness is whatever the paper assumes for each proof system. A product of systems is not stronger than that argument.

  2. What actually moves

    The cut

    Inclusion, exclusion, timing, and ordering are treated as separate validity conditions rather than one proposer's private bundle.

    Why it carries weight

    If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.

    Where it is dropped

    A later client, parameter or reward formula is a different object from this paragraph.

  3. What a later deployment may change

    The cut

    Verification of a delegated proof can be assigned to a sampled committee. The committee is smaller than the whole set, so the sampling assumption is the security assumption. This note does not restate a bound.

    Why it carries weight

    If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.

    Where it is dropped

    Soundness is whatever the paper assumes for each proof system. A product of systems is not stronger than that argument.

05 Register

What has to be true

  • Model · Not re-measured

    You are reading the Symphony paper of 20 April 2026. A page about Infernet is an older design, not this text.

  • Model · Not re-measured

    The document is the one at the source URL. A marketing page with the same brand is not this text.

  • Model · Not re-measured

    No price, supply, yield, or adoption figure is added by this desk.

06 Divergence

What happened after the paper

Soundness is whatever the paper assumes for each proof system. A product of systems is not stronger than that argument.

A later client, parameter set, or reward formula is a different object. Cite this paper for the mechanism. Cite a primary release for the network. This desk has not re-run the proof.

07 Pre-mortem

What to check before you use the idea

  1. 0 of 3 marked on this browser. A mark is a reading note, not a pass, a rating, or a recommendation.

08 Anatomy

The paper, in the order a builder needs

The problem it names

A paper that names proofs and committees has not shipped them. If block validity does not actually check the inclusion rule the abstract describes, the proposer still has the old power.

What the design proposes

  • Deterministic transactions can still be executed by every honest replica. A random or heavy one is delegated, and a proof is what the other replicas check.
  • Inclusion, exclusion, timing, and ordering are treated as separate validity conditions rather than one proposer's private bundle.
  • Verification of a delegated proof can be assigned to a sampled committee. The committee is smaller than the whole set, so the sampling assumption is the security assumption. This note does not restate a bound.

How the mechanism is specified

  • Deterministic transactions can still be executed by every honest replica. A random or heavy one is delegated, and a proof is what the other replicas check.
  • Inclusion, exclusion, timing, and ordering are treated as separate validity conditions rather than one proposer's private bundle.
  • Verification of a delegated proof can be assigned to a sampled committee. The committee is smaller than the whole set, so the sampling assumption is the security assumption. This note does not restate a bound.

What this page does not treat as proven

  • This note quotes no latency and no throughput.
  • It does not say a live chain runs this framework.
  • Soundness is whatever the paper assumes for each proof system. A product of systems is not stronger than that argument.

Why the desk still reads it

Symphony argues that ordinary consensus assumes execution is cheap and deterministic, and that this fails when a transaction is expensive or random. It proposes to split a proposer's control of a block into separate checks, and to accept a proof of delegated work instead of asking every validator to re-run it.

09 Lexicon

Terms, opened into the record

Proposer disaggregation
Splitting inclusion, exclusion, timing, and ordering into separate protocol checks.
Delegated execution
Running heavy or random work off the replicated path and checking a proof instead.

10 Repository

Every linked record on this page

Underlined words open a page that already exists: a concept, a protocol profile, a failure record, or another paper. If a word is not underlined, this desk does not have a record for it.

This is Blockchain Lab's reading of a public design paper. It is not the paper, not a copy of it, and not an offer of tokens, equity, custody or a partnership. Later network behaviour can diverge from the text. Nothing here is investment, legal or technical advice.

Research status: Design paper. Last reviewed: 1 October 2026. This is a reading of a public paper, not investment, legal or security advice.