Srishti (@srishticode) header
Srishti (@srishticode) profile picture

living in the intersection of math & magic

Joined September 2024
Photo by Srishti (@srishticode)Photo by Srishti (@srishticode)Photo by Srishti (@srishticode)Photo by Srishti (@srishticode)Photo by Srishti (@srishticode)Photo by Srishti (@srishticode)Photo by Srishti (@srishticode)Photo by Srishti (@srishticode)Photo by Srishti (@srishticode)Photo by Srishti (@srishticode)
There are tons of free ZK resources out there. The hard part is knowing what to learn, and in what order. So I built a curated ZK learning roadmap: Math → Cryptography → SNARKs/STARKs → Prover Engineering → zkVMs github.com/SrishtiCode/ZKRoa…
4
8
1
49
6,145
Q. What does it mean that Prop is impredicative and proof-irrelevant, and what does each property buy and cost? In Lean, Prop is impredicative, meaning you can create a proposition using ∀ over any type, even very large ones, and the result will still be a proposition. This makes it possible to express powerful logical statements. Proof irrelevance means that any two proofs of the same proposition are considered equal, so Lean cares about whether something is proven rather than how it is proven. These properties make proof checking simpler and keep proofs separate from computation. However, the limitation is that you cannot freely extract computational data from proofs, and some parts of Lean's type system become more complicated.
1
85
Q. What exactly does the Lean kernel check, and why can a small kernel justify trusting a huge system? The kernel is a small C++ type checker for a dependent type theory (a variant of the Calculus of Inductive Constructions). It knows: dependent function types, universes Sort u, inductive families with recursors, a primitive quotient construction, and definitional equality (β, δ, ζ, η, ι-reduction, proof irrelevance, structure η), with fast paths for Nat and string literals. The elaborator, tactics (simp, grind, omega), macros, and notation are all untrusted programs whose only output is a term. The kernel re-checks that term from scratch. This is the de Bruijn criterion: trust is concentrated in a tiny checker, while the large, buggy, ever-changing automation only has to produce certificates the checker accepts. A bug in grind yields a failed proof, not a false theorem.
1
6
409
Starting the question answer series about Lean!!!
2
153
Do you know what hash functions have collisions, or how good collision attacks get against the hash functions you use? Now you know. collisions.zksecurity.xyz/
1
13
121
5,879
Srishti retweeted
Where I'm at right now, will certainly add more books by the end of the month.
7
32
6
301
8,445
Srishti retweeted
Software Verification in Lean is live now! You can still register via Luma to access the livestream link: luma.com/kytl0zlj
We're very excited for 𝗦𝗼𝗳𝘁𝘄𝗮𝗿𝗲 𝗩𝗲𝗿𝗶𝗳𝗶𝗰𝗮𝘁𝗶𝗼𝗻 𝗶𝗻 𝗟𝗲𝗮𝗻 tomorrow! The in-person event is full, but livestream spots remain open: Register on Luma to receive the link: luma.com/kytl0zlj 𝗡𝗲𝘄𝗹𝘆 𝗮𝗱𝗱𝗲𝗱 𝘁𝗼 𝘁𝗵𝗲 𝗽𝗿𝗼𝗴𝗿𝗮𝗺: A closing round-table discussion on AI safety and formal verification (4:45–5:30 pm PT), moderated by Pedro Abreu (@p_droabreu0), host of the Type Theory Forall podcast, featuring Max Tegmark, Leonardo de Moura, Jonathan Protzenko, Andres Erbsen and Mike Dodds. 🔗 See the event website for the full program: beneficial-ai-foundation.git…
3
9
107
5,668
Oct edition of ZK Mesh came out earlier this week. So. Much. Research (again!!) zkmesh.substack.com/p/zkmesh…
1
4
13
1,311
If you're trying to understand why the quantum threat has become such a hot topic recently, it's worth understanding three things: There are three factors that determine how close we are to having a quantum computer capable of breaking cryptography like Bitcoin's: 1. Algorithms: finding ways to break cryptography using fewer qubits. 2. Hardware: building quantum computers with more physical qubits. 3. Error correcting code: making those qubits reliable enough to perform complex computations. We're seeing progress on all three fronts: algorithms that require fewer qubits, better error-correcting codes, and new ways to build quantum hardware. When all three improve together, the gap to breaking today's cryptography can close much faster than we might expect. And that's why people like me are increasingly concerned that Q-day may be closer than we think.
21
15
6
94
6,791
Very excited about the future, there is so much to be optimistic about. Lots of good developments.
4
2
29
1,184
Srishti retweeted
🤘🏻 talk with @endrazine at @unpromptedconf slides aumasson.jp/data/talks/unpro… to appear in @phrack soon
10
18
2
94
5,460
Q. Why is a power-of-2 modulus dangerous for lattice-SNARK soundness, unlike prime-field SNARKs? In prime-field SNARKs, using a modulus where (p-1) is divisible by a large power of 2 is useful because it allows efficient NTT operations. However, in lattice-based protocols like LaBRADOR, soundness relies on differences between verifier challenges being invertible in the underlying ring. This prevents a dishonest prover from using zero-divisors to make different, inconsistent witnesses pass verification. A power-of-2 modulus creates many non-invertible elements, increasing the possibility of such attacks and weakening the soundness assumptions. This makes choosing the modulus particularly important in lattice-based protocols. zkSecurity's review identified this parameter-selection issue in code that was close to production.
1
5
155
Extremely interesting to see how surprised people and companies are that AI agents and their principals might have different interests. Principal-agent theory (PAT) is decades old and backed by a huge body of research. But when the agent is a software system, it gets a completely new spin. PAT calls the cost of this divergence agency costs: the cost of monitoring the agent, of binding it to your interests, and the loss that remains anyway. Right now, for AI agents, these costs are extremely high. If you want to understand what’s going on, learn PAT. It’s great to see researchers already applying these long-established frameworks to autonomous systems. The early findings point in one direction: whether the agent is a human or software, the same problems apply, with one HUGE difference. Software agents lack accountability. They can’t be held liable, sanctioned or fired, and that amplifies agency costs. This field is young, but it will shape the broader questions around alignment. And aligning autonomous systems with humans and society is the make-or-break issue for actually scaling this technology. If we fail here, it will be regulated out of the market and simply rejected by people. That’s why we’re building solutions to exactly these problems. Leading researchers worth following: 🔹 Noam Kolt (Hebrew University): Governing AI Agents, agency law and economics applied to AI agents 🔹 Gillian K. Hadfield (Johns Hopkins): incomplete contracting and the economy of AI agents 🔹 Dylan Hadfield-Menell (MIT): the principal–agent alignment problem 🔹 Alan Chan (GovAI): visibility and infrastructure for AI agents 🔹 Iason Gabriel (Google DeepMind): alignment between user, developer and society 🔹 Mihaela van der Schaar (Cambridge): multi-agent systems as principal–agent problems 🔹 Lewis Hammond & Vincent Conitzer (Cooperative AI Foundation / CMU): multi-agent risks 🔹 John Horton, Andrey Fradkin & Peyman Shahidi (MIT / BU): The Coasean Singularity, markets with AI agents 🔹 Steve Phelps (UCL): early experiments on LLM agents in principal–agent conflicts
1
1
2
80
Srishti retweeted
Software Verification in Lean on November 7 has reached in-person capacity! If you're interested in attending live, please join the waitlist: A livestream link will be shared with all waitlisted registrants a few days before the event.
Software Verification in Lean (SVIL) comes to Stanford University on Saturday, November 7. Co-organized by Beneficial AI Foundation and Lean FRO, it is a day of public lectures on advancing Lean’s software verification ecosystem toward production use, with a focus on end-to-end verification of security-critical systems. Talks will cover Rust verification with the Aeneas framework, low-level software verification, and formally verified OS kernels. Speakers include Max Tegmark, Shaowei Lin, Leonardo de Moura, Jonathan Protzenko, Andres Erbsen, and Mike Dodds. In-person space is limited. Non-local and waitlisted registrants will receive a livestream link, and recordings will be available afterward. Program and registration: beneficial-ai-foundation.git…
2
8
99
4,825
Srishti retweeted
Formal Verification is going to be so hot in April 2027
47
34
13
557
22,895
ZK is now being used my millions of people, in 100s of applications. If you haven't been paying attention, now might be a good time to refresh! Check out our report (It's free!) zeroknowledge.fm/zk-industry…
Introducing the definitive guide to ZK in 2026. The year’s biggest questions pointed to ZK: Can we trust AI? Will quantum break encryption? Can private money live on public rails? How do we know what’s real online? Read how in the 2026 ZK Industry Report with @zeroknowledgefm.
5
14
2
54
4,757
This weekend we launched EthLib, a Lean4 library for Ethereum! The goal is to bring Ethereum's primitives, specifications and theorems into one place, building a shared foundation for formally specifying and proving things about Ethereum. github.com/ethereum/EthLib
15
59
7
312
13,111