My Assessment of Plan A's Compute Verification Strategy (+ open questions)

·LessWrong··

OverviewThese are my non-expert notes on the compute verification section of AIFP’s Plan A. I cover interconnect limits, memory wipes, network taps + replay, and ZKPs. For the most part, the sections can be read independently. I restrict my attention to inference-only verification: ensuring that compute is used for inference, not training. For each method suggested by AIFP, I ask:How much can it slow down training?How much overhead does it add to inference?What sensitive information does it requ...

Read full article →

Related Articles

GCC steering committee announces AI policy
arto · Hacker News · 13h ago
Stacked PRs are now live on GitHub
tomzorz · Hacker News · 8h ago
Why is everyone trying to build a solid-state battery?
crescit_eundo · Hacker News · 12h ago
AI's top startups are barely publishing their research
YeGoblynQueenne · Hacker News · 1d ago
Physicists Solve a Muon Mystery. Now, Old Results Don't Add Up
ibobev · Hacker News · 9h ago