Pith. sign in

REVIEW 1 cited by

BoLD: Fast and Cheap Dispute Resolution

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2404.10491 v1 pith:2IHN6B4N submitted 2024-04-16 cs.CR cs.DC

Mario M. Alvarez , Henry Arneson , Ben Berger , Lee Bousfield , Chris Buckland , Yafah Edelman , Edward W. Felten , Daniel Goldman
show 7 more authors
Raul Jordan Mahimna Kelkar Akaki Mamageishvili Harry Ng Aman Sanghi Victor Shoup Terence Tsao
This is my paper · ORCID
classification cs.CRcs.DC
keywords bolddisputeprotocolresolutioncostsachievesarbitrumattacks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

BoLD is a new dispute resolution protocol that is designed to replace the originally deployed Arbitrum dispute resolution protocol. Unlike that protocol, BoLD is resistant to delay attacks. It achieves this resistance without a significant increase in onchain computation costs and with reduced staking costs.

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. Dynamic Fraud Proof

    cs.CR 2025-02 reject novelty 4.0 of 10

    A proposed optimistic rollup mechanism replaces the long challenge window with a short, randomly sampled approval quorum and exponential timeouts, but the security argument for keeping the single-honest-node guarantee...

Pith tools