Pith. sign in

REVIEW 1 cited by

HammerHead: Leader Reputation for Dynamic Scheduling

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 2309.12713 v1 pith:IQ3TVDAD submitted 2023-09-22 cs.CR cs.DC

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

The need for high throughput and censorship resistance in blockchain technology has led to research on DAG-based consensus. The Sui blockchain protocol uses a variant of the Bullshark consensus algorithm due to its lower latency, but this leader-based protocol causes performance issues when candidate leaders crash. In this paper, we explore the ideas pioneered by Carousel on providing Leader-Utilization and present HammerHead. Unlike Carousel, which is built with a chained and pipelined consensus protocol in mind, HammerHead does not need to worry about chain quality as it is directly provided by the DAG, but needs to make sure that even though validators might commit blocks in different views the safety and liveness is preserved. Our implementation of HammerHead shows a slight performance increase in a faultless setting, and a drastic 2x latency reduction and up to 40% throughput increase when suffering faults (100 validators, 33 faults).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Beluga: Block Synchronization for BFT Consensus Protocols

    cs.CR 2025-11 conditional novelty 6.0 of 10

    Beluga gives BFT consensus a principled block synchronizer with admission control and implicit availability proofs, preserving optimistic latency and bounding pull-based attacks.

Pith tools