Skip to content
NewA calmer, faster ZeroHour

Pricing the Unprovable: Ambiguity, Turnstile Runs, and the Verifiability Discount in Crypto Protocols

arXiv cs.CRby Doohwi Cha ()1 min read2 · 1 read
AI summary · grok-4.7Summaries by Vani AI

Researchers quantify a verifiability discount when privacy coins patch flaws without proving past non-exploitation.

The paper defines a verifiability discount: privacy protocols can repair a flaw without proving it was never exploited, even when no theft is reported. VDISC combines Orchard disclosures, reconstructed on-chain flows, earlier Zcash cases, and a 40-event panel. Orchard's muted post-repair reaction contrasted with the largest negative return and shielded-pool outflow when past abuse could not be ruled out. Across 38 events with a public loss figure, market-cap-normalized reported loss and unresolved exposure overlap strongly (Pearson 0.86), so returns alone cannot separate them.

Key facts
  • VDISC records loss, exposure, evidence, returns, and pool flows separately.
  • Orchard's worst return and shielded outflow followed unresolved past-abuse uncertainty.
  • Across 38 events, reported loss and exposure correlate (Pearson 0.86).
  • Authors prioritize past-state evidence, limited blast radius, and explicit uncertainty.
Analyze this story with Vani AIImpact, who is affected and what defenders should do, in a new chat

From the original article

1 min read at arxiv.org

Privacy-preserving protocols can repair a vulnerability without establishing whether it was exploited beforehand, even when no theft is reported and aggregate supply is protected. We call the potential value reduction from this gap the verifiability discount.

arXiv cs.CR

By Doohwi Cha · arxiv.org

Read the full article at arXiv cs.CR

A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.