←
Charalampos (Babis) Papamanthou801 posts
Charalampos (Babis) Papamanthou avatar

Charalampos (Babis) Papamanthou

@chbpap

professor of computer science at @Yale | co-director of @YaleACL | chief scientist at @lagrangedev | researching and teaching cryptography and security

◷ Joined May 2015▧ 36 Photos and videos
Ismael Hishon-Rezaizadeh ⭕ avatar
⟳ Charalampos (Babis) Papamanthou retweeted
Ismael Hishon-Rezaizadeh ⭕@Ismael_H_R·Nov 16

@chbpap presents our deepprove paper at ACM CCS in the Hague on wednesday, the one @AnthropicAI called the current peer-reviewed state of the art. If you’re there, go find him. what do you want to ask him?

Lagrange Foundation avatar
⟳ Charalampos (Babis) Papamanthou retweeted
Lagrange Foundation@LagrangeFndn·Nov 3

DeepProve, built by @lagrangedev, is cited in new research from @AnthropicAI as 'the current peer-reviewed state of the art' for provable inference.

The Frontier Red Team at @AnthropicAI just made the case that you should be able to check which AI model answered you, without ever seeing its weights. Their research names DeepProve “the current peer-reviewed state of the art.”

Post attachment
Ismael Hishon-Rezaizadeh ⭕ avatar
⟳ Charalampos (Babis) Papamanthou retweeted
Ismael Hishon-Rezaizadeh ⭕@Ismael_H_R·Nov 3

We’re watching crypto “grow-up” in real time. Adoption of ZK has now reached the largest frontier labs in AI. Excited to see @AnthropicAI recognize @lagrangedev’s DeepProve the “current peer-reviewed state of the art” for verifiable AI.

Post attachment

New Anthropic research: progress on provable inference for large language models. Here, we introduce FlashProve. Building on established cryptographic techniques, FlashProve allows developers to verify whether a given response came from a given AI model. It’s substantially more efficient than prior open-source methods for doing so. These proofs have a range of applications. They can, for instance, make it harder for attackers to hijack a chat, or enable safety evaluators to verify that the model they’re testing is the same one being served to customers. For our full write-up, see here: anthropic.com/research/prova… Further progress in provable inference will likely be an important part of improving trust in AI deployment. To that end, we're open-sourcing FlashProve’s code, here: github.com/anthropics/FlashP… We’re grateful to our collaborators: Alessandro Chiesa, @GiacomoFenzi, @gwberg95, @miranda__christ, Rahul Dalal (rdalal.github.io) and Ben Mayer (@transmissions11).

Giacomo Fenzi avatar
⟳ Charalampos (Babis) Papamanthou retweeted
Giacomo Fenzi@GiacomoFenzi·Nov 3

I am happy to share FlashProve: our performant open-source prototype for provable inference. We believe that this has significant implications for security, pacing AI development, integrity guarantees, and more.  FlashProve allows a provider to commit to model weights, and then prove that replies originate from the committed model.  The proof leaks no information about the weights, and the verifier can efficiently verify it on consumer hardware.  Our library is performant, proving a 400B parameter MoE model at 100 tok/s. We have open-sourced the associated code and Lean formalization. We hope that it catalyzes further progress in verification of inference, and look forward to seeing it.

0:22

New Anthropic research: progress on provable inference for large language models. Here, we introduce FlashProve. Building on established cryptographic techniques, FlashProve allows developers to verify whether a given response came from a given AI model. It’s substantially more efficient than prior open-source methods for doing so. These proofs have a range of applications. They can, for instance, make it harder for attackers to hijack a chat, or enable safety evaluators to verify that the model they’re testing is the same one being served to customers. For our full write-up, see here: anthropic.com/research/prova… Further progress in provable inference will likely be an important part of improving trust in AI deployment. To that end, we're open-sourcing FlashProve’s code, here: github.com/anthropics/FlashP… We’re grateful to our collaborators: Alessandro Chiesa, @GiacomoFenzi, @gwberg95, @miranda__christ, Rahul Dalal (rdalal.github.io) and Ben Mayer (@transmissions11).

Ismael Hishon-Rezaizadeh ⭕ avatar
⟳ Charalampos (Babis) Papamanthou retweeted
Ismael Hishon-Rezaizadeh ⭕@Ismael_H_R·Nov 3

Incredible to see @AnthropicAI refer to @lagrangedev’s DeepProve as the “the current peer-reviewed state-of-the-art” for verifiable inference. The frontier of ZK, verifiable and private inference is moving faster than ever!

Post attachment
Rafael Pass avatar
⟳ Charalampos (Babis) Papamanthou retweeted
Rafael Pass@PassRafael·Nov 2

here are my thoughts about OpenAI's amazing Mat Mul result. comments very welcome.

Post attachment
Fan Zhang avatar
⟳ Charalampos (Babis) Papamanthou retweeted
Fan Zhang@0xFanZhang·Oct 30

This is why we work on Maverick eprint.iacr.org/2026/1955. It’s a lightweight solution that doesn’t involve ZKP or FHE or MPC. While TEEs are also lightweight, there is a cost factor: you have to put entire workflow in some high-end Nvidia GPUs with TEEs, which can be an overkill.

Eli Ben-Sasson | Starknet.io avatar
⟳ Charalampos (Babis) Papamanthou retweeted
Eli Ben-Sasson | Starknet.io@EliBenSasson·Oct 26

This is a spectacular result, saying the NP complete problem over n variables can be solved in much less than 2^n time. I love it, always thought that SAT shouldn’t be as hard as 2^n. It doesn’t mean P=NP, though.

Here's a direct link to OpenAI's PDF claiming a refutation of ETH. In particular, it's claimed that 3SAT on n variables is in about exp(n/(log n)^{1/2+o(1)}) time github.com/openai/math/blob/…

Charalampos (Babis) Papamanthou avatar
Charalampos (Babis) Papamanthou@chbpap·Oct 23

Continuing the work started at @lagrangedev, I am excited to announce a @Yale @Penn collaboration on a black-box compiler from static to dynamic SNARKs, yielding post-quantum dynamic SNARKs. Work led by amazing @BawejaAnubhav from @Penn! eprint.iacr.org/2026/2445

Tweak an AI model's weights and the proof of what it computed starts over from zero. @chbpap shows how dynamic zk-SNARKs update the proof when the model does.

0:41
Yehuda Lindell avatar
⟳ Charalampos (Babis) Papamanthou retweeted
Yehuda Lindell@LindellYehuda·Oct 10

This podcast from @a16zcrypto includes an aspect that hasn't been stressed enough. In the end, AI cryptanalysis is a great thing for cryptography as it helps us gain confidence in new assumptions, key sizes (e.g. for new PQ schemes) and more. youtube.com/watch?v=k_CoOoDs…

Grigore Rosu avatar
⟳ Charalampos (Babis) Papamanthou retweeted
Grigore Rosu@RosuGrigore·Sep 7

Formal verification of functional correctness is quickly becoming the bare minimum standard. It will soon be irresponsible for any enterprise to release code which is not formally verified. AI coding agents can generate not only the code, but also a spec with a proof that the code satisfies the spec. Or put simply, if it is so smart to generate the code, it should also be smart enough to tell me what it did and give me all the verifiable evidence that it did it. This used to be hard, but it is not anymore. The spec, any spec, forces the agent to reflect on its code symbolically and prove some properties about it. That will make it write better code and solve more challenges. Same like humans. The spec can and should include the known security attack vectors, for starters. There will always be unknown unknowns, but known unknows are not an option anymore, as they will be instantly exploited. Generating formally verified code is possible now. The agents can do it with the adequate harness and proving infra, at no extra effort from the devs.