Benchmark rholang recursion types & fix discrepancies

Description

It’s clear that the linear-receive-with-closure pattern is slower than the contract pattern when in a tight loop, and moreso in a tight nested loop. This ticket is to determine whether there’s significant difference when the loop is around a substantial piece of code. We’re particularly interested in the case where the loop is a ListOps!map (which is implemented as a special case of ListOps!fold, which is implemented as a special case of ListOps!partialFold).

Status

Assignee

Mike Stay

Reporter

Artur Gajowy

Components

None

Story Points

None

Sprint

Priority

Medium

Epic Name

Rholang recursion performance