Skip to content

Follow-up MR about the protocol cache

Context

There are three aspects in that MR.

  1. The users need to observe the state of the cache. In this MR, we provide two new RPC to get the cache size limit and the current cache size.

  2. Computing the exact cache size is complicated in OCaml because the sharing of pointers is encouraged by the computational model and the internal representation of values. Therefore, we only compute an overapproximation of the cache entries. The previous implementation of cached contracts was wrong: this MR fixes that problem.

  3. Finally, this MR addresses some comments made in !3234 (merged) after its merge.

Edited by Mehdi Bouaziz

Merge request reports