Research group on zero knowledge verification for frontier AI
Build a research community for frontier AI verification, centered in Paris, focusing on zero-knowledge software-only approaches.
I'd like to hire people (mostly postdocs, research engineers, PhD students) to work on developing open-source verification mechanisms to regulate frontier AI training; the idea is to aggregate a research community around Paris, exploiting the good talent pool there. We might spin up subgroups elsewhere in Western Europe, and will coordinate with the other actors working on open-source proposals.
We will be focusing, at least at first, on technical solutions that do not require hardware development, so they are quicker to deploy, with zero-knowledge protocols to ensure privacy.
We will coordinate closely with the GPAI Policy Lab to make sure our work stays relevant from a policy perspective.
Some research directions, more might appear as we go**:**
-Strengthening Inference verification [priority]: optimizing the protocols enables more generous sampling, thus better soundness. These gains will also be useful for agent auditing and watchdogs!
-Co-designing approximate/surrogate architectures for lowering costs of inference ZKPs: the classical example, already widely used, is fixed-point quantization for compatibility with finite fields; one can try to go further for the nonlinear operations, e.g. "piecewise polynomial approximations of exponential on negative values". These architectures can be used either for "approximate proofs for float-native LLMs", or natively for the audit agents and watchdogs (see below).
-Formal proofs for error bounds: to make sure the approximate methods above are sound enough, we need to compute error bounds. We want formal proofs, say in Lean, but these are not fully trustworthy either. So, carefully pre-building relevant reliable libraries and algorithms for computing and proving those can help make proofs shorter, which then makes auditing for fishy parts easier [possibly using LLM auditors, see below].
-Automation of the previous points: less critical, but could help for streamlining. Once we have good baselines for co-design and formal error bounds proofs, we can try to have [open-weights] LLMs do the heavy work there, i.e. given architecture and weights, produce a "close easier-to-ZKProve" copy, with a formal proofs for error bounds. Require ZKPs of execution for the process. Dedicated harnesses and fine-tuned versions of "frontier" open-weights LLMs could help improve efficieny and reliability.
-Agent auditing, with ZKPs of execution, as well as ZKPs for use of mech interp techniques to mitigate jailbreaking (probes, CoT monitoring, etc.). One can also consider having a "watchdog" [likely smaller than the usual audit agents, more optimized for inference ZKPs] that runs continously, checking for suspicious activity.
-Proofs of Useful Work, memory challenges, memory control: to mitigate the issue of "we do not know exactly how much computing power inference operations take, due to possible optimizations", one can focus on memory instead of throughput. One direction is having a small program required to run continuously on each GPU, managing memory by filling empty space with "unusable stuff" whenever it appears, typically during inference cycles. Execution of this would be required to be proved, most likely in zero-knowledge.
-Hybrid protocols: combining sampling-based bit-exact verifications with broader, weaker, cheaper checks [typically, approximate ones], can yield better tradeoffs than either kind of check alone. This principle could be used for both training and inference verification, though we expect it to be most useful for training.
-Interactivity and beacons: given issues with Fiat-Shamir (grinding and others), keeping some interactivity in the zero-knowledge protocol could be a better choice for soundness. Then, one might need to design a multi-party protocol, with e.g. public beacons, to avoid concentrating trust on a single verifier actor.
-Red-teaming and countermeasures: since we already found a rather serious potential issue for training verification [weight smuggling], we believe it is worth having people focusing mostly on finding [high-level concepts and possibly implementations for] attacks, e.g. exotic training techniques, and helping understand how to mitigate them.
This also includes abstract modelling of the problem [memory and computations, the control goal, etc.] to make the "search" more efficient, as well as, hopefully, prove positive results [under some assumptions, of course].
Important remarks:
-I think the project can scale very well with funding, up to around $20M; we might start hitting diminishing marginal returns at that point, but not before.
-Got several candidate hires already, can thus guarantee about $2M spend in the first year with all those, and $10M in the first 18 months is >80% likely.
Budget estimates:
-Up to $5M in hardware and compute, to run experiments, accelerate research, and help with cyberdefence; first big milestone at $500k here.
-For each person-year: around $100k-200k, depending on experience.
For each of the research threads above, having 2-3 persons per thread would be a good start.
Endorsed because I am a sucker for all things AI verification and the name "Paul Wang" agrees with me spiritually. Okay, okay, jokes aside I was initially highly sceptical because of how sparse you were when talking about the project details, theory of impact, how money will be spent, etc etc like buddy you're asking for 30 grand and all you have to say for yourself is "the implementation team will produce prototypes" hello are you for real. And if I was going based on the quality of the proposal on its own, this would definitely be a rejection. 100%, like zero doubt about it, I would have stopped reading at "(who will take care of the implementation part)" What other part even is there? Genuine question.. A million people say "lean" yet you can kind of tell they are just vibing and have never been deep in the Zulip trenches and I almost pigeonholed you as one of those people. Buut I clicked through to your website, read through some of the stuff, and let me tell you, it is criminal that your postdoc isn't already funded by some other source. Academia is hell.
I kind of don't like how you just flex "GPAI Policy Lab" and "LIP6", like sure you can outsource the reputation laundering to institutional affiliation or whatever, orrr you can link to your actual F-ing work okay like that empty spot right next to "Ky Nguyen" should have had a link to https://arxiv.org/abs/2606.05433 with a note like "hey i actually do know this guy and coauthored with him" without which, my first thought was, "is it possible he is inventing the whole collaboration?" I'm not saying you're fake, but damn, learn how to write a proposal (Obviously said with love, xoxo Paul Wang).
Hi! Thanks for the feedback! Many valid points, I'm not really used to doing this, actually!
Thanks for taking the time to dig further!
About details, or lack thereof: I don't want to overcommit to one overly specific protocol proposal, since it might happen that better ideas emerge as the research progresses. Sorry, but it's likely I haven't yet found the "best ideas I will eventually find"... That's research...
And: No, implementation is not the only thing that matters here! Designing a protocol with good soundness does matter! Good implementation of a weak protocol would not help as much, in my opinion. Or, say, if the protocol was not actually zero-knowledge, it would be less likely to be accepted, and that property is not about implementation, you have to bake it into the design.
About the "flexing": I don't know exactly how things work here; in other places this kind of "flexing" is quite common, sorry if you found it inappropriate. And, I am indeed currently a postdoc at LIP6, working with people from GPAI Policy Lab.
So maybe I should say a bit more now:
Floats are annoying, because they do not form a ring. This makes standard zero-knowledge proofs much more expensive, since you can't straightforwardly use standard stuff like the Goldwasser-Kalai-Rothblum protocol for arithmetic circuits, or Freivald for matrix multiplication.
So, you have to be clever, find workarounds. Some people have worked on related questions, e.g. an "approximate sumcheck" protocol.
Also: matrix multiplication is "fine" (if we ignore the issue above), all the nonlinear stuff, less so...
I am currently investigating this, no definitive answer yet.
Please note that our preprint proposes sampling-based proofs to lower costs and get within the "acceptable overhead" range, but I think we can harden that further, if we combine it with other components. But it's ongoing research, I don't want to overclaim here!
Another question beyond verifying training FLOPs: figuring out inference verification protocols, to make sure declared computations are indeed inference, and not standard training [doesn't deal with distillation or synthetic data generation, I know]. If things go well, I can try and also tackle that!
Thanks for getting back! I'm not used to it either.
The overcommitment part is legit. I'll give you that. As long as you have some way to prioritise which of five interesting things you will actually get done, it's fine.
I don't know what a protocol is, I just assume you mean something like an IETF RFC or IEC standard, in which case the protocol is always under specified and the expected program behaviour is implementation dependent.
This is literally a funding platform. If you're not flexing, you're not doing your job. I would only be offended if you refused to flex.
I was not familiar with the standard stuff. I looked it up and read through these slides:
I mostly bounced off of them, because the only context I have on prover-verifier games was the legibility work by Kirchner et al , but I found the 2021 paper by Anil & Grosse to be a gentler introduction.
I am actively eating dinner and waiting for my rate limits to reset as you carry out your investigation, I hope it goes well :)
You might enjoy this post by Jason: https://substack.com/@jasminexli/p-207237994