Pith. sign in

REVIEW 2 cited by

Twins: BFT Systems Made Robust

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.10617 v2 pith:3LN4OKMG submitted 2020-04-22 cs.CR

classification cs.CR
keywords twinsbyzantinescenariosattacksnodewereattackdiembft
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents Twins, an automated unit test generator of Byzantine attacks. Twins implements three types of Byzantine behaviors: (i) leader equivocation, (ii) double voting, and (iii) losing internal state such as forgetting 'locks' guarding voted values. To emulate interesting attacks by a Byzantine node, it instantiates twin copies of the node instead of one, giving both twins the same identities and network credentials. To the rest of the system, the twins appear indistinguishable from a single node behaving in a 'questionable' manner. Twins can systematically generate Byzantine attack scenarios at scale, execute them in a controlled manner, and examine their behavior. Twins scenarios iterate over protocol rounds and vary the communication patterns among nodes. Twins runs in a production setting within DiemBFT where it can execute 44M Twins-generated scenarios daily. Whereas the system at hand did not manifest errors, subtle safety bugs that were deliberately injected for the purpose of validating the implementation of Twins itself were exposed within minutes. Twins can prevent developers from regressing correctness when updating the codebase, introducing new features, or performing routine maintenance tasks. Twins only requires a thin wrapper over DiemBFT, we thus envision other systems using it. Building on this idea, one new attack and several known attacks against other BFT protocols were materialized as Twins scenarios. In all cases, the target protocols break within fewer than a dozen protocol rounds, hence it is realistic for the Twins approach to expose the problems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. BlueBottle: Fast and Robust Blockchains through Subsystem Specialization

    cs.DC 2025-11 reject novelty 6.0 of 10

    A two-layer consensus architecture uses a faster n=5f+1 DAG core plus a synchronous guard layer to reach sub-second finality with accountable recovery.

  2. Bullshark on Narwhal: Implementation-level Workflow Analysis of Round-based DAG Consensus in Theory and Practice

    cs.CR 2025-07 conditional novelty 2.0 of 10

    A descriptive, implementation-level workflow analysis of the existing Bullshark-on-Narwhal consensus protocol, based on the Sui codebase, with no new experiments or derivations.

Pith tools