Proof-based general-purpose computing with Magnetar

·Microsoft Research··

At a glance A new form of computing. Zero-knowledge proofs let you run a workload and receive, alongside the result, a short proof that the program ran correctly. Anyone can check the proof in milliseconds, without rerunning the program, without trusting whoever ran it, and without needing data on which the program was run. Three grand challenges have stood in the way of broad adoption: making proofs fast enough to produce, making them available to normal programs without cryptographic expertise...

Read full article →

Related Articles

OpenAI’s o1 correctly diagnosed 67% of ER patients vs. 50-55% by triage doctors
donsupreme · Hacker News · 5mo ago
Accelerating Gemma 4: faster inference with multi-token prediction drafters
amrrs · Hacker News · 5mo ago
A couple million lines of Haskell: Production engineering at Mercury
unignorant · Hacker News · 5mo ago
Using “underdrawings” for accurate text and numbers
samcollins · Hacker News · 5mo ago
ProgramBench: Can language models rebuild programs from scratch?
jonbaer · Hacker News · 5mo ago