The research arm of Nethermind

We present Mova, a folding scheme for R1CS instances that does not require committing to error or cross terms, nor makes use of the sumcheck protocol.

In this work, we establish new results on the relationship between various notions of soundness for IOPs.

We establish new results on the Fiat-Shamir (FS) security of several protocols that are widely used in practice, and we provide general tools for establishing similar results for others.

In this post, we research the problem of amortizing costs when one must produce many proofs simultaneously. The method, which we call “packing,” applies to FRI-based SNARKs (e.g., ethSTARK, Plonky2, RISC0, Boojum, etc.).

This paper introduces a novel DEX design, termed COMMON, that addresses these two predominant challenges. COMMON operates as an order book, natively integrated with a shielded token pool, thus providing anonymity to its users.

his document outlines a protocol which allows for based preconfirmations, while ensuring the based rollup captures much of the value generated from block building.

This article introduces Alternate PBS, a new PBS proposal for based rollups 17. Alternate PBS allows MEV income generated on the based rollup to be captured by the rollup itself, as opposed to being captured through priority payments to the proposer of the sequencing chain.

In this blog post, we will discuss what we consider “incentives’’ in (blockchain) protocols and more.

In this systematization of knowledge, we examine the current innovations and approaches to the field of decentralized identity (also self-sovereign identity), as well as its relevant foundations.

The following deliverable represents the culmination of Phase II of a multi-phase research project for Lido DAO, with the goal of designing a mechanism for decentralized maintenance of Lido’s operator set.