Skip to content

LibraryConsensus2022Design paperCorpus record

Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback

Jolteon and Ditto. Rati Gelashvili, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander Spiegelman and Zhuolun Xiang.

Jolteon takes two rounds in the happy path. Ditto keeps that path and falls back to an asynchronous protocol when the network or the leader misbehaves.

A reading of the public document. Not a copy of it, and not a claim about a later network that reused the name.

A chain that claims responsive finality should say what it does when the leader's messages stop arriving.
Evidence
Primary paper
Re-measured
No
Assumptions
3
Records linked
4

Code

Source, repository, and what is actually hosted

  • arXiv:2106.10362https://arxiv.org/pdf/2106.10362
  • 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

    Chained HotStuff is fast in a good network and stalls badly when the leader is slow. Pure asynchronous protocols are robust and expensive all the time.

  2. Claim 02 · Paper model

    The rule

    Jolteon takes two rounds in the happy path. Ditto keeps that path and falls back to an asynchronous protocol when the network or the leader misbehaves.

  3. Claim 03 · Paper model

    How it is put together

    A quorum certificate still drives the happy path. The fallback does not wait for a timeout forever. Pace is a network property, not a moral one.

  4. Claim 04 · Paper model

    Where the claim stops

    This is a permissioned BFT result.

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

    Chained HotStuff is fast in a good network and stalls badly when the leader is slow. Pure asynchronous protocols are robust and expensive all the time.

    Model

    What has to hold

    This is a permissioned BFT result.

    Falsifier

    What would retire it

    How many rounds commit on the happy path?

  2. 02 The rule

    Observation

    What the study says

    Jolteon takes two rounds in the happy path. Ditto keeps that path and falls back to an asynchronous protocol when the network or the leader misbehaves.

    Model

    What has to hold

    The paper is not a public proof-of-stake chain.

    Falsifier

    What would retire it

    How many rounds commit on the happy path?

  3. 03 How it is put together

    Observation

    What the study says

    A quorum certificate still drives the happy path. The fallback does not wait for a timeout forever. Pace is a network property, not a moral one.

    Model

    What has to hold

    Fallback has its own message cost. It is not free.

    Falsifier

    What would retire it

    How many rounds commit on the happy path?

  4. 04 Where the claim stops

    Observation

    What the study says

    This is a permissioned BFT result.

    Model

    What has to hold

    This is a permissioned BFT result.

    Falsifier

    What would retire it

    How many rounds commit on the happy path?

03 Sequence

One action, as an operating tape

  1. 01A leader proposes and collects a certificate.
  2. 02A second round commits on the happy path.
  3. 03If certificates stop, the asynchronous path makes progress without that leader.
  4. 04How many rounds commit on the happy path?

04 Load-bearing

The argument, and where a pitch drops it

  1. Why it is still on the desk

    The cut

    A chain that claims responsive finality should say what it does when the leader's messages stop arriving.

    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 is not a public proof-of-stake chain.

  2. After the text

    The cut

    Aptos and later production BFTs cite this line of work. The deployment's timeouts are not the paper.

    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 is not a public proof-of-stake chain.

05 Register

What has to be true

  • Model · Not re-measured

    This is a permissioned BFT result.

  • Stake and threshold · Not re-measured

    The paper is not a public proof-of-stake chain.

  • Network · Not re-measured

    Fallback has its own message cost. It is not free.

06 Divergence

What happened after the paper

Aptos and later production BFTs cite this line of work. The deployment's timeouts are not the paper.

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

Chained HotStuff is fast in a good network and stalls badly when the leader is slow. Pure asynchronous protocols are robust and expensive all the time.

What the design proposes

  • A quorum certificate still drives the happy path.
  • The fallback does not wait for a timeout forever.
  • Pace is a network property, not a moral one.

How the mechanism is specified

  • A leader proposes and collects a certificate.
  • A second round commits on the happy path.
  • If certificates stop, the asynchronous path makes progress without that leader.

What this page does not treat as proven

  • This is a permissioned BFT result.
  • The paper is not a public proof-of-stake chain.
  • Fallback has its own message cost. It is not free.

Why the desk still reads it

A chain that claims responsive finality should say what it does when the leader's messages stop arriving.

09 Lexicon

Terms, opened into the record

Quorum certificate
A set of votes that proves a quorum signed one proposal.
Asynchronous fallback
A path that terminates without a timely leader.

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.