New Paper Proposes Cryptographic "Replication Certificates" Verifiable in Seconds
Kaiping_Chen · x · 2026-11-05
A new paper by Gary King, Yiqing Xu and Yang Yang introduces "replication certificates": cryptographically signed records of deposited files and logged output.
- Problem: data/code deposits alone prove little; authors spend months on journal reanalyses and years answering reader doubts, with no record of what actually ran.
- Mechanism: after deposit, the archive computes a random seed from the deposit's hash plus a blockchain block; the author reruns once, the archive signs, timestamps (on-chain), and stores the record—confidential data included—without rerunning anything.
- Result: anyone can verify in seconds, backdating is impossible, faking risks detection, and any step can be replayed decades later.
More from Research
- Stanford Paper Maps the Circuit Behind In-Context Learning: Gated Key-Value Memory in Small Transformers — teortaxesTex · 2026-11-05
- Gym-Anything for Robotics uses coding agents to mass-generate realistic robot simulations — wellecks · 2026-11-05
- LeCun coauthors proof of Platonic Representation Hypothesis: JEPA views need 42x fewer samples — ylecun · 2026-11-05
- REINFORCE Zero: trainer-inference invariance keeps async LLM RL stable for 20,000 updates — teortaxesTex · 2026-11-05
- AI research replication now takes 24-72 hours as teams let agents close the loop — BradPorter_ · 2026-11-05
- Berkeley's Evolving Agent Teams beats FlashInfer by 1.2x with supervisor-run agent teams — burny_tech · 2026-11-05