We don’t just apply cryptography—we invent it. Our core research on Reckle Trees has been granted a U.S. patent (No. 12,368,596), cementing its place as a breakthrough in scalable, verifiable compute. Here's what that means: 🧵
2/ Merkle proofs let blockchains verify a piece of data exists in a dataset. But they're slow and rigid, breaking down under dynamic or high-throughput workloads. Reckle Trees fix this, enabling updatable batch proofs that are 200× faster than previous methods.
3/ Updatable batch proofs confirm multiple values at once, and keep the proof valid even when those values change. With traditional Merkle systems, you had to regenerate everything from scratch. Reckle Trees changed that.
4/ Reckle Trees are integrated into Lagrange’s coprocessor indexing layer. They allow it to update indexing proofs as new blocks come in, without having to recompute from scratch. That performance boost flows directly into key use-cases for verifiable compute.
5/ Here's how it works, and why it matters: When a new block is indexed, Reckle Trees let the coprocessor reuse the previous proof and only update what changed. This makes proof generation incremental, cutting down on redundant work and conserving compute resources.
6/ Reckle Trees deliver 11–15× better performance than the best prior batch-proof systems, and up to 200× faster performance in dynamic scenarios. That level of performance is now sealed with a U.S. patent.
7/ Reckle Trees are making a name for themself. Other researchers are benchmarking new proof systems against them, signaling their technical relevance for scalable proof systems. Reckle Trees were also accepted to SBC 2023, one of the top venues for blockchain research.
8/ Reckle Trees are just one of many contributions from the Lagrange research team. Our paper on Dynamic zk-SNARKs was recently accepted to SBC 2025, and more research is in the pipeline.
LAGRANGE
LAGRANGE13.6.2025
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 🧵
9/ Research → Product → Real-world impact. With Reckle Trees now patented, Lagrange is scaling the infrastructure needed for fast, verifiable AI. Full Paper: Patent: US 12,368,596
327,88K