Long-term L1 execution layer proposal: replace the EVM with RISC-V

Magicians Primordial Soup
,
97

From the linked article:

The code to reproduce these experiments is available at GitHub - succinctlabs/overhead: Measuring revm and wasmi overhead for SP1 programs..

But this repo doesn’t exist or is private. So I’m guessing it’s only me trying to reproduce these numbers.

I’m assuming the “Fibonacci-100k (u128)” benchmark computes the 100k’th element of the Fibonacci sequence with 128-bit precision. By the way, this number has almost 70k bits.

So I’ve written a simple EVM implementation of fibonacci:

5f195f355f60015b90810183830192600757035f5260205ff3

and EOF variant (just replaced JUMPDEST/JUMPI with RJUMPI):

ef00010100040200010018ff000000008000065f195f355f600190810183830192e1fff6035f5260205ff3

Using evmone and “native” CPU (x86) execution takes 5.0M cycles (legacy EVM) and 3.8M cycles (EOF).

I don’t know how to execute this in SP1 yet, but to get any upper bound estimate I’ve compiled evmone to riscv32 and counted host CPU cycles of the execution in the qemu emulator: 127M cycles (legacy EVM) and 114M (EOF).

This is still one order of magnitude lower than the number in the paper (1002M cycles).

5 Likes