Skip to content
Blockchain LabBlockchain LabTHE VENTURE STUDIO

LibraryConsensus2019Design paperCorpus record

SBFT: A Scalable and Decentralized Trust Infrastructure for Blockchains

SBFT. Guy Golan Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael K. Reiter, Dragos-Adrian Seredinschi, Orr Tamir and Alin Tomescu.

Collectors aggregate signatures into one proof. A client and the replicas see a constant number of messages rather than a quadratic flood, under the paper's collector assumption.

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

If a pitch says linear BFT, ask who aggregates, and what happens when that party delays.
Evidence
Primary paper
Re-measured
No
Assumptions
3
Records linked
1

Code

Source, repository, and what is actually hosted

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

    PBFT's all-to-all messages do not survive a large replica set.

  2. Claim 02 · Paper model

    The rule

    Collectors aggregate signatures into one proof. A client and the replicas see a constant number of messages rather than a quadratic flood, under the paper's collector assumption.

  3. Claim 03 · Paper model

    How it is put together

    Threshold signatures stand in for a pile of individual votes. A fast path commits when a larger set agrees. A linear path remains for the case where the fast path fails.

  4. Claim 04 · Paper model

    Where the claim stops

    Collectors are an extra role. A censoring collector is a liveness problem.

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

    PBFT's all-to-all messages do not survive a large replica set.

    Model

    What has to hold

    The paper assumes a known replica set.

    Falsifier

    What would retire it

    Who may aggregate signatures?

  2. 02 The rule

    Observation

    What the study says

    Collectors aggregate signatures into one proof. A client and the replicas see a constant number of messages rather than a quadratic flood, under the paper's collector assumption.

    Model

    What has to hold

    Collectors are an extra role. A censoring collector is a liveness problem.

    Falsifier

    What would retire it

    Who may aggregate signatures?

  3. 03 How it is put together

    Observation

    What the study says

    Threshold signatures stand in for a pile of individual votes. A fast path commits when a larger set agrees. A linear path remains for the case where the fast path fails.

    Model

    What has to hold

    It does not remove the one-third bound.

    Falsifier

    What would retire it

    Who may aggregate signatures?

  4. 04 Where the claim stops

    Observation

    What the study says

    Collectors are an extra role. A censoring collector is a liveness problem.

    Model

    What has to hold

    Collectors are an extra role. A censoring collector is a liveness problem.

    Falsifier

    What would retire it

    Who may aggregate signatures?

03 Sequence

One action, as an operating tape

  1. 01Replicas send votes to a collector.
  2. 02The collector returns one signature.
  3. 03Commit follows if the signature proves the required threshold.
  4. 04Who may aggregate signatures?

04 Load-bearing

The argument, and where a pitch drops it

  1. Why it is still on the desk

    The cut

    If a pitch says linear BFT, ask who aggregates, and what happens when that party delays.

    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. After the text

    The cut

    Later chains adopted threshold certificates as the normal way to show a quorum. The collector role is the part to read carefully.

    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

    Collectors are an extra role. A censoring collector is a liveness problem.

05 Register

What has to be true

  • Model · Not re-measured

    Collectors are an extra role. A censoring collector is a liveness problem.

  • Model · Not re-measured

    The paper assumes a known replica set.

  • Model · Not re-measured

    It does not remove the one-third bound.

06 Divergence

What happened after the paper

Later chains adopted threshold certificates as the normal way to show a quorum. The collector role is the part to read carefully.

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

PBFT's all-to-all messages do not survive a large replica set.

What the design proposes

  • Threshold signatures stand in for a pile of individual votes.
  • A fast path commits when a larger set agrees.
  • A linear path remains for the case where the fast path fails.

How the mechanism is specified

  • Replicas send votes to a collector.
  • The collector returns one signature.
  • Commit follows if the signature proves the required threshold.

What this page does not treat as proven

  • Collectors are an extra role. A censoring collector is a liveness problem.
  • The paper assumes a known replica set.
  • It does not remove the one-third bound.

Why the desk still reads it

If a pitch says linear BFT, ask who aggregates, and what happens when that party delays.

09 Lexicon

Terms, opened into the record

Collector
A replica that gathers votes into one signature.
Threshold signature
One signature that proves a set signed, without listing them.

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.