Compare Papers

Paper 1

Kardashev scale Quantum Computing for Bitcoin Mining

Pierre-Luc Dallaire-Demers

Year

2026

Journal

arXiv preprint

DOI

arXiv:2603.25519

arXiv

2603.25519

Bitcoin already faces a quantum threat through Shor attacks on elliptic-curve signatures. This paper isolates the other component that public discussion often conflates with it: mining. Grover's algorithm halves the exponent of brute-force search, promising a quadratic edge to any quantum miner of Bitcoin. Exactly how large that edge grows depends on fault-tolerant hardware. No prior study has costed that hardware end to end. We build an open-source estimator that sweeps the full attack surface: reversible oracles for double-SHA-256 mining and RIPEMD-based address preimages, surface-code factory sizing, fleet logistics under Nakamoto-consensus timing, and Kardashev-scale energy accounting. A parametric sweep over difficulty bits b, runtime caps, and target success probabilities reveals a sharp transition. At the most favourable partial-preimage setting (b = 32, 2^224 marked states), a superconducting surface-code fleet still requires about 10^8 physical qubits and about 10^4 MW. That load is comparable to a large national grid. Tightening to Bitcoin's January 2025 mainnet difficulty (b about 79) explodes the bill to about 10^23 qubits and about 10^25 W, approaching the Kardashev Type II threshold. These numbers settle a narrower question than "Is Bitcoin quantum-secure?" Once Grover mining is lifted from asymptotic query counts to fault-tolerant physical cost, practical quantum mining collapses under oracle, distillation, and fleet overhead. To push mining into non-trivial consensus effects, one must invoke astronomical quantum fleets operating at energy scales that lie far above present-day civilization.

Open paper

Paper 2

A note on the non-planar corrections for the Page curve in the PSSY model via the IOP matrix model correspondence

Norihiro Iizuka, Mitsuhiro Nishida

Year

2024

Journal

arXiv preprint

DOI

arXiv:2410.04679

arXiv

2410.04679

We develop a correspondence between the PSSY model and the IOP matrix model by comparing their Schwinger-Dyson equations, Feynman diagrams, and parameters. Applying this correspondence, we resum specific non-planar diagrams involving crossing in the PSSY model by using a non-planar analysis of a two-point function in the IOP matrix model. We also compare them with Page's formula on entanglement entropy and discuss the contributions of extra-handle-in-bulk diagrams.

Open paper