Skip to content
Blockchain LabBlockchain LabTHE VENTURE STUDIO

LibraryConsensus2024Design paperCorpus record

Shoal: Improving DAG-BFT Latency and Robustness

Shoal. Alexander Spiegelman, Balaji Arun, Rati Gelashvili and Zekun Li.

Shoal pipelines the DAG so a block can commit faster in the good case, and it uses a reputation idea so slow leaders stop dominating the schedule.

A reading of the public paper. Not a copy, not a benchmark, and not a claim about any later network.

A DAG-BFT pitch should say how many rounds a commit waits when the leader is honest and the network is timely.
Evidence
Primary paper
Re-measured
No
Assumptions
3
Records linked
2

Code

Source, repository, and what is actually hosted

  • arXiv:2306.03058https://arxiv.org/abs/2306.03058
  • The source URL is not a GitHub repository. No code remote is invented.
  • Full text is not mirrored. Public availability is not a licence to copy the file onto this site.
  • Add to a reading list

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

    Certified DAG protocols such as Narwhal and Bullshark add rounds of certificates that cost latency even when the network is healthy.

  2. Claim 02 · Paper model

    The proposal

    Shoal pipelines the DAG so a block can commit faster in the good case, and it uses a reputation idea so slow leaders stop dominating the schedule.

  3. Claim 03 · Paper model

    The DAG is still the mempool and the consensus anchor.

    Latency in the good case is the number this paper tries to cut.

  4. Claim 04 · Paper model

    The bound

    This is a permissioned DAG protocol.

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

    Certified DAG protocols such as Narwhal and Bullshark add rounds of certificates that cost latency even when the network is healthy.

    Model

    What has to hold

    The paper's latency is not a public-chain TPS claim.

    Falsifier

    What would retire it

    How many rounds to commit in the good case?

  2. 02 The proposal

    Observation

    What the study says

    Shoal pipelines the DAG so a block can commit faster in the good case, and it uses a reputation idea so slow leaders stop dominating the schedule.

    Model

    What has to hold

    Reputation can censor if it is implemented as a hard ban. Read which one they mean.

    Falsifier

    What would retire it

    How many rounds to commit in the good case?

  3. 03 The DAG is still the mempool and the consensus anchor.

    Observation

    What the study says

    Latency in the good case is the number this paper tries to cut.

    Model

    What has to hold

    The paper's latency is not a public-chain TPS claim.

    Falsifier

    What would retire it

    Is the committee known?

  4. 04 The bound

    Observation

    What the study says

    This is a permissioned DAG protocol.

    Model

    What has to hold

    This is a permissioned DAG protocol.

    Falsifier

    What would retire it

    How many rounds to commit in the good case?

03 Sequence

One action, as an operating tape

  1. 01Order blocks in a DAG of certified broadcasts.
  2. 02Commit earlier than waiting for the full Bullshark pattern when the conditions hold.
  3. 03Retire a leader who has been missing without letting that retirement become a safety violation.
  4. 04What does reputation change, safety or scheduling?

04 Load-bearing

The argument, and where a pitch drops it

  1. What the paper is for

    The cut

    A DAG-BFT pitch should say how many rounds a commit waits when the leader is honest and the network is timely.

    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.

  2. What happened after

    The cut

    Production DAG consensus after Bullshark cites this latency work. The implementation's timeouts remain its own.

    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

    The paper's latency is not a public-chain TPS claim.

05 Register

What has to be true

  • Model · Not re-measured

    This is a permissioned DAG protocol.

  • Model · Not re-measured

    The paper's latency is not a public-chain TPS claim.

  • Model · Not re-measured

    Reputation can censor if it is implemented as a hard ban. Read which one they mean.

06 Divergence

What happened after the paper

Production DAG consensus after Bullshark cites this latency work. The implementation's timeouts remain its own.

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

  4. 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

Certified DAG protocols such as Narwhal and Bullshark add rounds of certificates that cost latency even when the network is healthy.

What the design proposes

  • The DAG is still the mempool and the consensus anchor.
  • Latency in the good case is the number this paper tries to cut.
  • Reputation is a heuristic sitting on top of the safety argument. Do not confuse them.

How the mechanism is specified

  • Order blocks in a DAG of certified broadcasts.
  • Commit earlier than waiting for the full Bullshark pattern when the conditions hold.
  • Retire a leader who has been missing without letting that retirement become a safety violation.

What this page does not treat as proven

  • This is a permissioned DAG protocol.
  • The paper's latency is not a public-chain TPS claim.
  • Reputation can censor if it is implemented as a hard ban. Read which one they mean.

Why the desk still reads it

A DAG-BFT pitch should say how many rounds a commit waits when the leader is honest and the network is timely.

09 Lexicon

Terms, opened into the record

DAG-BFT
Consensus where the nodes' blocks form a certified directed acyclic graph.
Reputation
A scheduling preference against leaders who have been slow.

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.

Concepts

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.