Charalampos (Babis) Papamanthou
@chbpap
faculty at @Yale | co-director of @YaleACL | chief scientist at @lagrangedev | researching and teaching cryptography and security
Congratulations to Uzi Vishkin for this amazing honor. A true pioneer in parallel algorithms.
Professor Uzi Vishkin to Receive the ACM SPAA Parallel Computing Award for formative contributions to the theory of parallel algorithms and prototyping its reduction to practice ece.umd.edu/news/news_stor…
We are excited to resume our seminar with a great talk by our very own Fatima Elsheimy (@0x_FAE)! 🪧Title: Early Stopping Byzantine Agreement 📅When: 11am, Mar. 28 (in 55 minutes!) 📷Livestream: sites.google.com/view/yacl/semi…
Please welcome Alex Lew, Assistant Prof. of Computer Science at Yale Engineering! His work in probabilistic programming, ML & Bayesian inference is pushing the boundaries of how we build and understand intelligent systems. #NewFaculty #WelcomeAboard #AIResearch
In preparation for our SBC 2025 talk, we have updated our dynamic zk-SNARKs paper detailing the log N approach and data structure. Special guest: AMT trees by @alinush407! Latest version: eprint.iacr.org/2024/1566.pdf. Grateful to @YaleCSDept PhD student Weijie Wang for leading this.
Welcome to @YaleCSDept, Nicole!
Excited to welcome Nicole Immorlica, Professor of Computer Science, to Yale Engineering! A leader in sociotechnical systems, she blends CS & economics to study how we connect and behave both online and off. ACM Fellow, Sloan Fellow, and trailblazer! #NewFaculty #Welcome
Big win for Yale CS! 🏆 A team led by Yang Cai (L) & Manolis Zampetakis (R) earned Best Paper at #COLT2025 for redefining how we identify treatment effects in complex data. A leap forward for causal inference & foundational AI. 🔗 loom.ly/hWrbgkE #WhatsNext @Yang_Cai
Congrats to Yale Engineering's @Yang_Cai (Computer Science & Economics), Manolis Zampetakis (CS) and their collaborators for receiving the Best Paper Award at COLT 2025! #AI #ML
Our paper “What Makes Treatment Effects Identifiable? Characterizations and Estimators Beyond Unconfoundedness” received the Best Paper Award at COLT 2025! Huge shout-out to my amazing collaborators: Alkis Kalavasis, Katerina Mamali, @AnayMehrotra, and Manolis Zampetakis.
It was a pleasure to give an invited talk on zk-ML at the Olympia Research Summit in Athens. Many thanks to the Athena Research Center and Minos Garofalakis for hosting. I am incredibly proud of the high-quality research happening in my home country. linkedin.com/posts/-athena-…
Town Crier and DECO are two oracle protocols developed by IC3 researchers to securely bridge data from the web to smart contracts, but they differ significantly in trust assumptions, cryptographic techniques, and privacy guarantees: Prof @0xFanZhang, lead author of both papers,…
Introducing Dynamic zk-SNARKs—a breakthrough from the Lagrange research team Weijie Wang, @chbpap, @s_shravan, and @dipapadopo Dynamic zk-SNARKs mark a major step forward in making real-time, updatable cryptographic proofs a reality Here’s what that means and why it matters 🧵
Excited about Dynalog, our brand-new dynamic zk-SNARK with *polylog* updates and log or O(1) proofs. Polylog updates support large Hamming distance between source/target, e.g., n/polylog. Dynalog uses LSM trees & maintainable vector commitments. See eprint.iacr.org/2024/1566.
Introducing $LA: the token powering decentralized proof generation and verifiable AI across the Lagrange Prover Network From provable AI inferences (DeepProve) to rollup scalability, $LA powers a self-sustaining economy where proof demand drives token demand 👉…
Our paper on efficiently updating ZKPs or, dynamic zk-SNARKs, has been accepted for presentation at the Science of Blockchain Conference! Grateful to @lagrangedev for inspiring and supporting this research. Looking forward to further advancing this line of work.
Congratulations on the new role @giorgos_tsimos! We will miss you at @Yale and @YaleACL!
1/n: After a brutal schedule, I could finally take a breath and write. I am super excited --first for defending my PhD and finishing with the thesis, and also, for finding an extremely interesting role for my next step, as Scientist at @poddotnetwork! Here is why I can't wait:
Happy birthday to the late Edsger Dijkstra, whose algorithm solved the "single-source shortest path" problem: tinyurl.com/y5ee6jdb Image v/Leo van Velzen
- lattice-based Merle trees (iacr.org/archive/eurocr…) - or, maybe newer stuff like HydraProofs (eprint.iacr.org/2025/813) cc @chbpap, in case you are looking for extra research 😉 (So cool to see how relevant versatile authenticated data structures are becoming!)
Check out "Insecurity Through Obscurity: Veiled Vulnerabilities in Closed-Source Contracts", a cool new paper by YACL members @syang2ng, @KaihuaQIN, @yaish_aviv, and @0xFanZhang! Link: arxiv.org/abs/2504.13398
Many sophisticated MEV bot contracts use control flow obfuscation techniques to protect their logic. However, this also causes existing tools to struggle with analyzing obfuscated smart contracts, leaving critical vulnerabilities hidden. Excited to share our solution: SKANF (1/n)
Today, Yale celebrated a historic milestone with the public installation of President Maurie McInnis as the university’s 24th president. Beginning with a vibrant procession through campus and culminating inside Woolsey Hall, the extended Yale community came together to reflect…
Exciting talk today at @YaleCSDept by @BrownCSDept Professor @vkemerlis on software hardening and kernel security!
Congratulations to @YaleCSDept’s @0xFanZhang for becoming an @initc3org member!
Meet the two latest IC3 members: @0xFanZhang and Matt Weinberg, from @YaleCompsci and @PrincetonCS!