Huge 🎉 novel crypto design by @Stanford @IBMResearch & @Mysten_Labs has been accepted to Eurocrypt 2026, one of the top cryptography conferences in the world. TLDR: we took partial fraction decomposition (yes, the thing from high-school algebra) and turned it into a surprisingly powerful cryptographic primitive. Instead of converting rational functions into polynomial divisions, we work directly with their algebraic structure. This reveals two powerful properties: - Partial-fraction decomposition as a membership test: Products of rational functions can be expanded into sums if and only if certain conditions hold. This gives us a beautifully simple mechanism for proving set membership and non-membership using just pairing equations. - A new linear-independence property: Using Cauchy matrices, we show that certain rational sum-based products are inherently linearly independent - a property we leverage to build dynamic threshold encryption. --- It unlocks: - Constant-size key-value commitments with homomorphic updates (great for stateless blockchains) - Dynamic threshold encryption with compact keys & ciphertexts - Broadcast encryption, Hadamard product proofs for zkSNARKs - 🍒We believe this opens the door to new aspects of “rational-function cryptography,” with many unexplored applications. Massive congrats to @SuiNetwork intern Rohit Nema, IBM’s Charanjit, and Mysten’s Arnab... incredible summer work that turned into a practical, peer-reviewed super-algorithm. This is how research should feel 🚀, and why blockchains advanced world's practical cryptography like nothing else in the last 2 decades.