Pith. sign in

REVIEW 3 cited by

FireLedger: A High Throughput Blockchain Consensus Protocol

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 1901.03279 v6 pith:4CFH3BSB submitted 2019-01-10 cs.DC

classification cs.DC
keywords fireledgerthroughputtransactionsamazonblockchainsobtainsblockblockchain
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Blockchains are distributed secure ledgers to which transactions are issued continuously and each block of transactions is tightly coupled to its predecessors. Permissioned blockchains place special emphasis on transactions throughput. In this paper we present FireLedger, which leverages the iterative nature of blockchains in order to improve their throughput in optimistic execution scenarios. FireLedger trades latency for throughput in the sense that in FireLedger the last f + 1 blocks of each node's blockchain are considered tentative, i.e., they may be rescinded in case one of the last f + 1 blocks proposers was Byzantine. Yet, when optimistic assumptions are met, a new block is decided in each communication step, which consists of a proposer that sends only its proposal and all other participants are sending a single bit each. Our performance study demonstrates that in a single Amazon data-center, FireLedger running on 10 mid-range Amazon nodes obtains a throughput of up to 160K transactions per second for (typical Bitcoin size) 512 bytes transactions. In a 10 nodes Amazon geo-distributed setting with 512 bytes transactions, FireLedger obtains a throughput of 30K tps. Moreover, on higher end Amazon machines, FireLedger obtains $20%-600%$ better throughput than state of the art protocols like HotStuff and BFT-SMaRt, depending on the exact configuration.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. A Generic Efficient Biased Optimizer for Consensus Protocols

    cs.DC 2019-08 conditional novelty 6.0 of 10

    A generic optimizer makes consensus terminate in one round when all nodes propose the same pre-agreed value, with Byzantine resilience f<n/4 for classical validity and f<n/3 for external validity.

  2. unimpeded: A Public Grid of Nested Sampling Chains for Cosmological Model Comparison and Tension Analysis

    astro-ph.CO 2025-11 conditional novelty 5.0 of 10

    A public library of pre-computed nested-sampling chains for 8 cosmological models and a large dataset grid enables fast Bayesian model comparison; combined analyses most often prefer ΛCDM, with DES–Planck and SH0ES–Pl...

  3. Setchain Algorithms for Blockchain Scalability

    cs.DC 2025-09 conditional novelty 5.0 of 10

    Three Setchain implementations, especially Hashchain, show orders-of-magnitude higher throughput than the underlying CometBFT ledger while adding light-client epoch proofs.

Pith tools