01 Pre‑state
Nothing is wrong. That is the point. Every byte below is being written to a permanent, public, replicated record right now, under cryptography that is expected to be readable later.
Harvest now, decrypt later
A future adversary does not need to be present at the moment of the transaction. Ciphertexts and public keys are archived by every full node, permanently. The only variable is when they become readable.
BITCOIN
NOMINALsecp256k1. Taproot / P2TR uses Schnorr over the same curve. BIP‑340, BIP‑341scriptPubKey. A funded, never‑spent Taproot output is exposed from day one. This is the one exposure category that grows with adoption instead of decaying.Glassnode's split, and where Satoshi's coins sit
ZCASH
NOMINALepk is a plaintext field of every Output and Action description. spec 7.4ABELIAN
NOMINALpqringct / pqringctx: the post‑quantum ring confidential transaction scheme and its enhanced successor. Written in Go.This simulates the day a cryptographically relevant quantum computer is operational and pointed at a chain — not a discovery, a breach or a disclosure. Nothing here has happened, and nothing here is predicted for any particular date.
non-linear clock — compression climbs across the run
BITCOIN
NOMINALWhich rate the second wave uses
| Entity | Balance exposed | State |
|---|
ZCASH
NOMINALWhy it is modelled, not measured
pk_d), which is not published on chain. ZIP 2005 and ECC
engineer Sean Bowe both state this explicitly. Ciphertexts are permanently public. Any shielded note sent
to an address an adversary knows — or later learns — becomes decryptable retroactively once
discrete logs fall. No future upgrade can undo that for notes already on chain. Published donation
addresses, exchange addresses, and any address ever given to a counterparty fall inside that gate.
ABELIAN
NOMINALNIST on the practicality of Grover
Third‑party assessment, and standards language
On standards language. Abelian's defensible claim is that it uses constructions inspired by NIST‑standardised algorithm families, not that it is NIST‑anything. NIST's own disclaimer: “Any mention of commercial products within NIST web pages is for information only; it does not imply recommendation or endorsement by NIST.” FIPS 206 / FN‑DSA is not a published standard; as of April 2026 it remains in NIST's administrative approval chain, not published even in draft.
[VERIFY] in CONFIG:
cohort quantisation, decryption throughput, mempool sample rate, transparent‑ZEC exposure share.
† Derived from an average historical rate, not live data. This page makes
no network requests. Cumulative shielded transaction counts are approximate, from a secondary source.
Q‑DAY — END STATE
What a cryptographically relevant quantum computer does to three base layers. Funds and privacy fail separately, and they do not recover the same way. Nothing here has happened; this is a model of published cryptographic properties under an assumed capability.
KEY RECOVERY —
PARALLEL CRQCs —
BTC EXPOSURE —
Why the two rows differ. Funds can be repaired going forward. A protocol change and a migration bound the loss, and NU6.3 has already begun: — of shielded value has migrated. Published ciphertexts cannot be repaired. Conditional on the adversary knowing the recipient address, that history opens retroactively. No upgrade reaches backwards.
Model, stated. The cascade quantises the selected exposed supply into
— equal cohorts, one recovered key per cohort, at the selected rate divided by
the parallel‑CRQC multiplier. Cohort quantisation is presentational; real exposure is not uniformly
distributed. Values marked * are modelling parameters flagged [VERIFY] in
CONFIG. Values marked † derive from average historical rates, not live data.