Research

Most recent

Research/Sep 29, 2025

Best of Both Worlds? A Measured Review of Non-Interactive ZK Fraud Proofs

Recent advances in Non-Interactive (NI) ZK Fraud Proofs, like Kailua and OP Succinct Lite, promise faster withdrawals and lower costs for optimistic rollups. We rigorously steel-manned NI designs against a strong threat model and compared them to Interactive Fraud Proofs (like Dave) and ZK Validity Proofs. Our analysis finds that current NI systems are vulnerable to Sybil attacks, coordination failures, and resource exhaustion, preventing true 1-of-N liveness and undermining decentralization. While NI may hold promise, they do not currently deliver the “best of both worlds,” and Interactive Fraud Proofs remain more resilient and cost-effective under adversarial conditions.

Written By Gabriel Coutinho

Research/Jul 29, 2025

PRT FRAUD PROOF FOR NON-MATHEMATICIANS

The need to scale programmable blockchains has created a strong demand for secure ways to offload computations outside the blockchain. One of the most popular options today is called rollups. Rollups involve off-chain nodes executing these offloaded computations, then proving the results back to the base layer. This is a good approach to solving the scalability issue, as these off-chain computers are not constrained by the limitations of the blockchain network. They, therefore, can be more specialised, faster and better equipped to handle complex transactions.

Written By Idogwu Chinonso

Research/Feb 27, 2025

The Dave Fraud-Proof Algorithm

The Dave algorithm is a next-generation fraud-proof system that balances decentralization, security, and liveness. It allows anyone to participate, withstands Sybil attacks, and resolves disputes efficiently, proving that optimistic rollups can remain secure even against powerful adversaries.

Written By Gabriel Coutinho

© 2025 The Cartesi Foundation. All rights reserved.