Talk, House of ZK: Verifying Intelligence, Buenos Aires, Argentina
Exploring how ZKVMs enable verifiable AI through recursive verification of diverse ZKML systems, bridging the gap between naive inference proofs and infeasible full training proofs.
Talk, Protocol Berg v2, Berlin, Germany
Multi-proposer consensus protocols let multiple validators propose blocks in parallel, breaking the single-leader throughput bottleneck of classic designs. Yet the modern multi-proposer consensus implementation has grown a lot since HotStuff. This workshop explored the implementation details of recent advances – DAG-based approaches like Narwhal and Sui’s Mysticeti – and revealed how implementation details translate to real-world performance gains. We focused on the nitty-gritty: how network communication patterns and data handling affect throughput and latency. New techniques such as Turbine-like block propagation (inspired by Solana’s erasure-coded broadcast) and lazy push gossip broadcasting dramatically cut communication overhead. These optimizations aren’t just theoretical – they enable modern blockchains to process over 100,000 transactions per second with finality in mere milliseconds, redefining what is possible in decentralized systems.
Talk, Agglayer Summit, Bangkok, Thailand
Proofcoin, a next-generation decentralized Layer 2 solution with an Ethereum backstop, redefines how proof aggregation can enhance security without compromising user flexibility. In this talk, we’ll explore how Proofcoin employs aggregation, not for programmability, but as a foundation for security. Rather than relying on aggregated proofs as a programming model, Proofcoin provides users with proof certificates that they can work with directly, effectively front-running the aggregate.
Talk, ICFP 2023, Seattle, WA, USA
We introduce Lurk, a new LISP-based programming language for zk-SNARKs. Traditional approaches to programming over zero-knowledge proofs require compiling the desired computation into a flat circuit, imposing serious constraints on the size and complexity of computations that can be achieved in practice. Lurk programs are instead provided as data to the universal Lurk interpreter circuit, allowing the resulting language to be Turing-complete without compromising the size of the resulting proof artifacts. Our work describes the design and theory behind Lurk, along with detailing how its implementation of content addressing can be used to sidestep many of the usual concerns of programming zero-knowledge proofs.
Talk, Rust x Ethereum Day, San Francisco, CA, USA
We introduce the challenges of writing a verifier for the Nova ZKP system on Ethereum, and the methods used to overcome those challenges.
Talk, ZKSummit 9, Lisbon, Portugal
We introduce Lurk, a groundbreaking LISP-based programming language for zk-SNARKs. Unlike conventional approaches that involve compiling computations into flat circuits, Lurk allows programs to be provided as data to the universal Lurk interpreter circuit. This innovative design empowers Lurk with Turing-completeness, without sacrificing the size of the resulting proof artifacts.
Talk, NIST Crypto Reading CLub, Virtual
In this talk we will discuss the security of concrete instantiations of EdDSA by identifying exploitable inconsistencies between standardization recommendations and Ed25519 implementations. We will mainly focus on current ambiguity regarding signature verification equations, binding and malleability guarantees, and incompatibilities between randomized batch and single verification. Based on our work that appeared at SSR 2020, we will give a formulation of the Ed25519 signature scheme that achieves the highest level of security, explaining how each step of the algorithm links with the formal security properties.
Talk, ZKProof workshop, Tel Aviv, Israel
In October 2019, on the heels of SNARK-tember, Georgios Konstantopoulos gave a well-received talk exploring the tradeoff space of ZKP Systems, titled “Groth16 is not dead”.
Talk, Celo Connect, Barcelona, Spain
This talk presents work in integrating the Narwhal mempool and Bullshark consensus protocol in the Celo blockchain
Talk, TPBC Weekly seminar series, Barcelona, Spain
This talk presents formal methods work on the Diem (formerly Libra) blockchain, including a formalization of the safety of consensus in Coq.
Talk, Montreal Rust Meetup, Montreal, Canada
This is a talk on how Rust derive macros make the eocnomics of some solutions to the expression problem simpler.
Talk, Barcelona Spark Meetup, Barcelona, Spain
A talk co-located with NeurIPS 2016 on distributed deep learning in heterogeneous clusters.
Talk, Data Science Belgium Community Meetup, Amsterdam, Netherlands
A talk about the challenges with using Deeplearning4J and Spark, in a distributed fashion.
Talk, Spark Summit Europe, Amsterdam, Netherlands
An enterprise use case of analysing population movement data to improve mobility in Switzerland.
Talk, Strata Hadoop World 2016, New York, USA
A use case developed at Swisscom to help urban planners understand their cities and to measure speeds on Swiss highways.
Talk, Big Data Romandie Meetup, Geneva, Switzerland
A talk on dealing with state in Spark Streaming.
Talk, Spark Summit Europe, Amsterdam, Netherlands
A talk on tuning a Spark Streaming cluster for performance.
Talk, Scala By The Bay, San Francisco Bay Area
A talk on implementation and use cases for implementing efficient locality-sensitive hashing in Spark.
Talk, Mix-It conference, Lyon, France
A talk on the then-nascent Apache Spark distribution of Lightbend (then Typesafe) and the practices that allowed developing it fast.