Fast Accumulation on Streams

While developing Coda, we came across an interesting problem that uncovered a much more general and potentially widely applicable problem: Taking advantage of parallelism when combining a large amount of data streaming in over time. We were able to come up with a solution that scales up to any throughput optimally while simultaneously minimizing latency and space usage.

While developing Coda, we came across an interesting problem that uncovered a much more general and potentially widely applicable problem: Taking advantage of parallelism when combining a large amount of data streaming in over time. We were able to come up with a solution that scales up to any throughput optimally while simultaneously minimizing latency and space usage. We’re sharing our results with the hope that others dealing with manipulation of online data streams will find them interesting and applicable.

If you’d rather consume this content in video form, watch this video.


The Coda cryptocurrency protocol is unique in that it uses a succinct blockchain. In Coda the blockchain is replaced by a tiny constant-sized cryptographic proof. This means that in the Coda protocol a user can sync with full-security2 instantly—users don’t have to wait to download thousands and thousands of blocks to verify the state of the network.

2 Equivalent to security as a full node.

What is this tiny cryptographic proof? It’s called a zk-SNARK, or zero knowledge Succinct Non-interactive ARgument of Knowledge. zk-SNARKs let a program create a proof of a computation, then share that proof with anyone. Anyone with the proof can verify the computation very quickly, in just milliseconds, independent of how long the computation itself takes. While validating proofs is fast, creating them is quite slow, so creating this SNARK proof is much more computationally expensive. We use a few different SNARK proofs throughout Coda’s protocol, but the important one for this post is what we call the “Ledger Proof”.

A ledger proof tells us that given some starting account state \sigma_0 there was a series of k transactions that eventually put us into account state \sigma_k. Let’s refer to such a proof as \sigma_0 \Longrightarrow \sigma_k. So what does it mean for a single transaction to be valid? A transaction, T_i^{i+1}, is valid if it’s been signed by the sender, and the sender had sufficient balance in their account. As a result our account state \sigma_i transitions to some new state \sigma_{i+1}. This state transition can be represented as \sigma_i T_{i}^{i+1} \sigma_{i+1}. We could recompute \sigma_0 \Longrightarrow \sigma_k every time there is a new transaction, but that would be slow, with the cost of generating the proof growing with the number of transactions—instead we can reuse the previous proof recursively. These ledger proofs enable users of Coda to be sure that the ledger has been computed correctly and play a part in consensus state verification.

3 Note that we represent account states concretely as their hashes for performance reasons.

More precisely, the recursive bit of our ledger proof, \sigma_0 \Longrightarrow \sigma_{i}, or the account state, has transitioned from the starting state \sigma_0 to the current state \sigma_i after i correct transactions are applied, could naively be defined in the following way:

There exists a proof, \sigma_0 \Longrightarrow \sigma_{i-1}, and \sigma_{i-1}T_{i-1}^{i}\sigma_i such that \sigma_0 \Longrightarrow \sigma_{i-1} verifies and \sigma_{i-1}T_{i-1}^{i}\sigma_i is valid.

Let’s examine what running this process over four steps would look like:

Each transaction emits a proof that we can use along with the next transaction to get our next proof
Each transaction emits a proof that we can use along with the next transaction to get our next proof

The functional programming enthusiast will notice that this operation is like a scan[^The `~init` in OCaml refers to a named argument, and `’a` and `’b` are a type unification variables that work similarly to generics in Java.]:

4The `~init` in OCaml refers to a named argument, and `’a` and `’b` are a type unification variables that work similarly to generics in Java.

(* scan [1;2;3] ~init:0
~f:(fun b a -> b + a)
=> [1,3,6] *)
val scan : 'a list
-> ~init:'b
-> ~f:('b -> 'a -> 'b)
-> 'b list

A scan combines elements of a collection together incrementally and returns all intermediate values. For example if our elements are numbers and our operation is plus, `scan [1;2;3] ~init:0 ~f:(fun b a → b + a)` has following evaluation trace:

5 `::` means “cons” or prepend to the front of a linked list.

scan [1;2;3] ~init:0 ~f:add
(0+1)::(scan [2;3] ~init:(0+1) ~f:add)
1::(scan [2;3] ~init:1 ~f:add)
1::(1+2)::(scan [3] ~init:(1+2) ~f:add)
1::3::(scan [3] ~init:3 ~f:add)
1::3::(3+3)::(scan [] ~init:(3+3) ~f:add)
1::3::6::(scan [] ~init:6 ~f:add)

[^`::` means “cons” or prepend to the front of a linked list.]

However, what we really have is a scan operation over some sort of stream of incoming information, not a list. A signature in OCaml may look like this:

val scan : 'a Stream.t
-> ~init:'b
-> ~f:('b -> 'a -> 'b)
-> 'b Stream.t
6 We write streams as lists in the evaluation.

As new information flows into the stream we combine it with the last piece of computed information and emit that result onto a new stream. Here’s a trace with transactions and proofs[^We write streams as lists in the evaluation.]:

\begin{aligned} &scan [\sigma_0T_0^{1}\sigma^{1}; \; \sigma_1T_1^{2}\sigma^{2}; \; \sigma_2T_2^{3}\sigma^{3}] \quad\sim init:\sigma_0 \Longrightarrow \sigma_0 \quad\sim f:combine \\ \\ &combine(\sigma_0 \Longrightarrow \sigma_0,\sigma_0T_0^{1}\sigma_1):: \\ &\quad(scan [\sigma_1T_1^{2}\sigma^{2}; \; \sigma_2T_2^{3}\sigma^{3}] \quad\sim init:combine(\sigma_0 \Longrightarrow \sigma_0,\sigma_0T_0^{1}\sigma_1) \quad\sim f:combine) \\ \\ &\sigma_0 \Longrightarrow \sigma_1:: (scan [\sigma_1T_1^{2}\sigma^{2}; \; \sigma_2T_2^{3}\sigma^{3}] \quad\sim init:\sigma_0 \Longrightarrow \sigma_1 \quad\sim f:combine) \\ \\ &\sigma_0 \Longrightarrow \sigma_2::\sigma_0 \Longrightarrow \sigma_1:: (scan [\sigma_2T_2^{3}\sigma_3] \quad\sim init:\sigma_0 \Longrightarrow \sigma_2 \quad\sim f:combine) \\ \\ &\sigma_0 \Longrightarrow \sigma_3::\sigma_0 \Longrightarrow \sigma_2::\sigma_0 \Longrightarrow \sigma_1:: (scan [] \quad\sim init:\sigma_0 \Longrightarrow \sigma_3 \quad\sim f:combine) \\ \\ &\sigma_0 \Longrightarrow \sigma_3::\sigma_0 \Longrightarrow \sigma_2::\sigma_0 \Longrightarrow \sigma_1::[] \\ \\ &[\sigma_0 \Longrightarrow \sigma_3; \; \sigma_0 \Longrightarrow \sigma_2; \; \sigma_0 \Longrightarrow \sigma_1] \end{aligned}

Unfortunately, we have a serial dependency of proof construction here: you must have \sigma_0 \Longrightarrow \sigma_i before getting \sigma_0 \Longrightarrow \sigma_{i+1}. This is *very slow*. When using [Libsnark](https://github.com/scipr-lab/libsnark) it takes ~20 seconds to do one of these steps on an 8 core cloud instance, and that’s just for a single transaction. This translates to merely 3 transactions per minute globally on the network!

What we’ll do in this blog post is find a better scan. A scan that maximizes throughput, doesn’t incur too much latency, and doesn’t require too much intermediate state. A scan that takes advantage of properties of the zk-SNARK primitives we have. We’ll do this by iterating on our design until we get something that best meets our requirements. Finally, we’ll talk about a few other potential use cases for such a scan outside of cryptocurrency.


Now that we understand the root problem, let’s talk about requirements to help guide us toward the best solution for this problem. We want to optimize our scan for the following features:

  1. Maximize transaction throughput

Transaction throughput here refers to the rate at which transactions can be processed and validated in the Coda protocol network. Coda strives to be able to support low transaction fees and more simultaneous users on the network, so this is our highest priority.

  1. Minimize transaction latency
The more we sacrifice latency the longer proposer nodes have to keep around full copies of the state before just relying on the small SNARK itself.

It’s important to minimize transaction latency to enter our SNARK to keep the low RAM requirements on proposer nodes, nodes that propose new transitions during Proof of Stake.7 SNARKing a transaction is not the same as *knowing* a transaction has been processed, so this is certainly less important for us than throughput.

  1. Minimize size of state

Again, to keep low RAM requirements on proposer nodes we want to minimize the amount of data we need to represent one state.

And moreover, this is the order of importance of these goals from most to least important: Maximize throughput, minimize latency, minimize size of state.


We’ll start with some assumptions:

This is possible because of a cryptographic notion known as “Signature of Knowledge” which lets us embed information about the creator and a fee into the proof in a way that is unforgeable. We will talk more about how we use this information in another blog post.

– All SNARK proofs take one unit of time to complete
– Transactions arrive into the system at a constant rate R per unit time
– We effectively have any number of cores we need to process transactions because we can economically incentivize actors to perform SNARK proofs and use transaction fees to pay those actors.8

– Two proofs can be recursively merged:

Merging two transaction proofs

This merge operation is associative:

Here we see a visual proof of associativity

So we can actually write transaction SNARKs that effectively prove the following statements:

Base (\sigma_i \Longrightarrow \sigma_{i+1})

> There exists \sigma_iT_i^{i+1}\sigma_{i+1} such that the transaction is valid

Merge (\sigma_i \Longrightarrow \sigma_k)

> There exists \sigma_i \Longrightarrow \sigma_j and \sigma_j \Longrightarrow \sigma_k such that both proofs verify

Before we go any further, though, let’s abstract away some details here.



D_i := \; \; \sigma_iT_i^{i+1}\sigma_{i+1}

Base work:

B_i := \; \; \sigma_i \Longrightarrow \sigma_{i+1}

Merge work:

M_{ij} := \; \; \sigma_i \Longrightarrow \sigma_j

Accumulated value:

A_k := \; \; \sigma_0 \Longrightarrow \sigma_k

Let’s say that data effectively enqueues a “Base job” that can be completed to become “Base work”. Similarly, two “Base work”s (or two “Merge works”s) can be combined in a “Merge job” to create “Merge work”.

Initial Analysis

Upper Bound

Let’s set an upper bound efficiency target for any sort of scan. No matter what we do we can’t do better than the following:

– Throughput: R per unit time

We said new data was entering the system at a rate ofR per unit time, so the best we can do is complete the work as soon as it’s added.

– Latency: O(1)

In the best case, we don’t have to wait to get the piece of data included as part of the scan result. Whatever time it takes to do one step is the time it takes before our data is included in the scan result.

– Space: O(1)

We don’t need to store any extra information besides the most recent result.

As a reminder, we decided that the naive approach is just a standard linear scan. This “dumb scan” can be a nice lower bound on throughput, we can also analyze the other attributes we care about here:

Linear Scan

– Throughput: 1 per unit time

Our linear scan operation emits a result at every step and so we need the prior result before we can perform the next step.

– Latency: O(1)

Every step emits a single result based on the data

– Space: O(1)

We only have to hold on to the most recently accumulated result to combine with the next value.

Since our primary goal is to maximize throughput, it’s clear a linear scan isn’t appropriate.

Parallel Periodic Scan

Recall that the merge operation is associative. This means that we can choose to evaluate more than one merge at the same time, thus giving us parallelism! Even though data are coming in only R at a time, we can choose to hold more back to unlock parallel merge work later. Because we effectively have infinite cores we can get a massive speedup by doing work in parallel.

This gives rise to the notion of a “periodic scan”:

(* periodicScan 1->2->3->4->5->6->7->8
~init:0 ~lift:(fun a -> a)
~merge:(fun a b -> a + b) => 10->36
val periodicScan : 'a Stream.t -> ~init:'b ->
~lift:('a -> 'b) -> ~merge:('b -> 'b -> 'b) -> 'b Stream.t

A scan that periodically emits complete values, not every time an `’a` datum appears on a stream, but maybe every few times. This therefore has slightly different semantics than a traditional scan operation.

Rather than returning a stream emitting 1→3→6→10→15→21→28→36, we buffer data elements 1 through 4 and compute with those in parallel, and only emit the resulting sum, 10, when we’re done. Likewise we buffer 5 through 8, and combine that with 10 and emit that 36 when we’re done. We periodically emit intermediate results instead of doing so every time.

Naive Implementation of Periodic Scan

Let’s go over this tree construction step-by-step, considering what happens to our data over time as it’s coming through into the system. Let’s consider R = 8.

First we gather R pieces of data and enqueue R Base jobs for our network to complete. We use R of our cores and can complete all jobs in one time step. We hold back the data on the pipe, and we are forced to buffer it because we haven’t finished handling the first R.

As we add Base work, we give way for a series of Merge jobs that can be completed in the next step:

Now we have \frac{R}{2} pieces of merge work to complete and we use \frac{R}{2} cores and complete them in one time step.

We repeat until we reach the top of the tree. The completed Merge work at the top can be consumed by the rest of the system.


– Throughput: \frac{R}{log(R)}

Every log(R) steps, we have the opportunity to consume R more pieces of data.

– Latency: O(log(R))

It takes log(R) time steps before we emit our top-level merge work as we half the nodes in each layer of our tree at each step.

– Space: O(R)

We now have to keep parts of a tree around at each step. Since our trees have R leaves, typical binary trees have 2R-1 nodes when completed, and we have an extra layer, we actually use 3R-1 nodes.

Naive Periodic Scan

For the purposes of visualization, unit time is being replaced with *60 seconds*. We assume the space of a single node in the tree is 2KB.

| | Throughput (in data per second) | Latency (in seconds) | Space (in bytes) |
| ----------- | ------------------------------- | -------------------- | ---------------- |
| R=4 | 0.0333 | 180 | ~22KB |
| R=16 | 0.0667 | 300 | ~94KB |
| R=1024 | 1.71 | 660 | ~6MB |
| R=16384 | 19.5 | 900 | ~98MB |

Serial Scan

| | Throughput (in data per second) | Latency (in seconds) | Space (in bytes) |
| ----------- | ------------------------------- | -------------------- | ---------------- |
| R=4 | 0.05 | 20 | ~2KB |
| R=16 | 0.05 | 20 | ~2KB |
| R=1024 | 0.05 | 20 | ~2KB |
| R=16384 | 0.05 | 20 | ~2KB |

We have increased throughput at the cost of some latency and space when compared with the serial approach, so this is a little bit better!

However, this solution leaves something to be desired—why must we halve our parallelism as we walk up each layer of the tree? We have a stream feeding us R data values every unit of time, so we should have enough work to do. Shouldn’t we use this somehow?

Better Solution

Let’s take advantage of the fact that we get R new data values each time we complete work—still preferring earlier queued data values to minimize latency once we’ve exhausted available parallelism.

With this in mind, let’s trace a run-through, this time always making sure we have R pieces of work to do at every step—for illustration, let’s pick R=2:

In the first step we just lay out data.

Now we lay out data and do two jobs

We do three jobs completing the first tree

We again do three jobs and complete a tree

It repeats.

We do as we did before, but this time we have R jobs to complete and can dispatch to our R cores every step. We have exactly log(R) trees pending at a time. At every step, we complete the first tree (tree zero) and at tree i, we complete layer i.


– Throughput: R

Throughput of work completion matches our stream of data! It’s perfect, we’ve hit our upper-bound.

– Latency: O(log(R))

Here’s a short informal proof: Note that any sort of reduction operation on N pieces of data can’t be done faster than O(log(N)) span. If we assume we could handle our R units that we enqueue at a time in fewer than O(log(N)) steps then since we’re doing a reduction operation we would be doing it faster than O(log(N)) which is a contradiction.

Latency is still logarithmic, though now it’s log(R)+1 steps as our trees have R leaves and we an extra layer on the bottom for base jobs. In fact, this is actually the lower bound.9

– Space: O(R*log(R))

We have multiple trees now. Interestingly, we have exactly log(R) trees pending at a time. Again our longer trees take up an extra layer than traditional binary trees, so in this case 3R-1 nodes since we have R leaves, and we have log(R) of these trees.10

Now that we have thoroughly optimized our throughput and latency, let’s optimize for space.

Optimize size

In order to prevent latency and space from growing over time, we need to make sure we complete work as fast as we add it.

Do we really need to hold all log(R) trees? We only ever care about the frontier of work. All the information we need to perform the next layer of jobs. We clearly don’t need to store anything above that or below it in the trees.

Notice that we only use some of each layer of trees even across the log(R) trees. And so we can represent the frontier of the log(R) trees with only a single tree representing the work pipeline moving from leaves to the root in the following manner:

Before and after we take a step


– Throughput: R

Throughput is the same as before.

– Latency: O(log(R))

Latency is the same as above.

– Space: O(R)

We’ve reduced our space back down to a single tree with leaves 3R-1.

Space Optimization

Do we really need that extra layer? If we change how we think about the problem, we can use a perfect binary tree which we can manipulate to save even more space:

The leaves are base proof holes that can be filled with data. The inner nodes hold available jobs for workers to complete.

Now we’re down to 2R-1 nodes—a standard binary tree with R leaves.

How do we store the tree? Since we know the size a priori (a complete binary tree with R leaves), we can use a *succinct* representation.

This is a very interesting area of computer science research, and I very much recommend the curious to read more: See [Zhou, et. al 2013] and wavelet trees.

A *succinct* data structure requires only o(Z) extra space to manage the relationship between the elements if Z is the optimal number of bits that we need to express the information in an unstructured manner. Note that this is little-o not big-O—a much tighter bound.

In fact our structure as described is actually an *implicit* one because of our scalar cursor. An *implicit* data structure is one that uses only O(1) extra bits (In our case, just the cursor.). In later refinements (in part 2), we’ll go back to a *succinct* representation because we need to relax one of the assumptions we made here. This is similar to the popular *implicit heap* that you may have learned about in a computer science class.

Final Analysis

– Throughput: R

Throughput keeps up with production rate R, so we couldn’t do better.

– Latency: O(log(R))

Latency is proportional to log(R) steps, as we described earlier, so we don’t get hurt too badly there.

– Space: 2R-1 + O(1)

We have an implicit data structure representation for our complete binary tree with 2R leaves as described above.

Fully Optimized Scan

| | Throughput (in data per second) | Latency (in seconds) | Space (in bytes) |
| ------------- | ------------------------------- | -------------------- | ---------------- |
| R=4 | 0.0667 | 180 | ~22KB |
| R=16 | 0.267 | 300 | ~94KB |
| R=1024 | 17.1 | 660 | ~6MB |
| R=16384 | 273 | 900 | ~98MB |
| R=65536 | 1092 | 1020 | ~393MB |

We went from a sequential solution that at R=16384 only handled a throughput of 0.05 data per second to an initial parallel solution that handled 19.5 data per second to a fully optimized solution that handles 273 data per second. Our final solution even has optimal latency and space characteristics.

We did it! Coda can now be limited in its throughput by the speed at which information can flow across the network, and no longer by the time it takes to construct a SNARK. Moreover, we solved a more general problem: Efficiently computing an online periodic parallel scan over an infinite stream for some associative operation.

Other Use Cases

Deep space telescopes produce an astronomical amount of data per second. For example, the Square Kilometre Array will process petabits of data per second. If data frames are coming in faster than we can process them which is certainly true for some types of workloads like non-parametric machine learning, we can use this data structure to handle these streams.

More generally, certain map-reduce type workloads that act in an online fashion (on an infinite stream of inputs instead of a finite collection) with expensive operators, could benefit from using our same data structure.

You can also go through literature and try to find prior art. We didn’t find much searching through map-reduce papers. The only thing that was a bit related is a paper from the GPU programming world, but doesn’t address the infinite streaming bit. Please leave a comment if you want to share any related work.


We were able to take advantage of parallelism and other properties of our system to materialize this general “periodic scan” problem of combining data streaming in online fashion which as we described doesn’t limit throughput at all, has optimal latency characteristics, and is succinct. With this data structure, Coda is free to take advantage of succinctness to offer a high-throughput with no risk of centralization!

In a future blog post, we’ll talk about instantiating this parametric structure with concrete parameters and how we instantiate our infinite core machine model by farming work out to the network. We’ll also talk about the optimization problem we have for choosing how to fill out these trees with completed work.

If you like this sort of stuff, we’re looking for open source contributors and hiring.

Future work

We’ll explore modifying this structure to optimize latency in the presence of variable throughput. You can imagine that if we detect input data throughput becomes sufficiently slow we can remove a layer from the next virtual tree, and if it’s too fast we can add one. We haven’t yet explored how this will affect the further refinements we made on top of the virtual trees.

Additionally, we will want to explore a more efficient mechanism to share account states that are part of the scan tree to nodes that don’t care about the in-progress proofs, so that bandwidth-constrained nodes can still look up their most recent account states without waiting for a ledger proof to pop out of the tree.


We can reify this model with the following signature in the Coda codebase:

`’a` is the type of the top value and there’s some notion of an associative merging operation on the `’a` values. `’d` is the type of the data at the leaves that comes in at rate R.
val start : parallelism_log_2:int
-> ('a, 'd) State.t
(** The initial state of the parallel
scan at some parallelism *)val next_jobs : state:('a, 'd) State.t
-> ('a, 'd) Available_job.t list
(** Get all the available jobs *)val enqueue_data : state:('a, 'd) State.t
-> data:'d list
-> unit Or_error.t
(** Add data to parallel scan state *)val free_space : state:('a, 'd) State.t
-> int
(** Compute how much data ['d] elements we
are allowed to add to the state *)val fill_in_completed_jobs :
state:('a, 'd) State.t
-> completed_jobs:
'a State.Completed_job.t list
-> 'a option Or_error.t
(** Complete jobs needed at this state --
optionally emits the ['a] at the top of
the tree *)


Thanks to Evan Shapiro for working through these data structures with me when we were first figuring this stuff out. Thanks to Deepthi Kumar for collaborating with me on several optimizations. Thanks to Laxman Dhulipala for taking a video call early on and helping with an early core insight about the multiple trees. Finally, thanks to Omer Zach and Corey Richardson (and Evan and Deepthi) for their very thorough feedback on drafts of this post!

About Mina Protocol

Mina is the world’s lightest blockchain, powered by participants. Rather than apply brute computing force, Mina uses advanced cryptography and recursive zk-SNARKs to design an entire blockchain that is about 22kb, the size of a couple of tweets. It is the first layer-1 to enable efficient implementation and easy programmability of zero knowledge smart contracts (zkApps). With its unique privacy features and ability to connect to any website, Mina is building a private gateway between the real world and crypto—and the secure, democratic future we all deserve. Mina is stewarded by the Mina Foundation, a public benefit corporation headquartered in the United States.

More from our Blog

Community / 2022-12-27 / Mina Foundation
Meet the zkApp Builder — Nicolas Diaz
Entrepreneur and developer, Nicolas shares more about his projects and future plans for his zkApp on Mina.
Read more
Ecosystem Update / 2022-12-22 / Mina Ecosystem Contributors
Mina Ecosystem Roadmap – Q4 2022
Read more
Community / 2022-12-21 / Mina Foundation
On-chain voting for Mina Improvement Proposals (MIPs) – Part 2
Read more
Announcement / 2022-12-16 / Mina Foundation
Ledger Fully Integrates Mina with Nano X and Nano S Devices
Read more

About the Tech


Mina uses advanced cryptography and recursive zk-SNARKs to deliver true decentralization at scale.

Get Started


Mina makes it simple to run a node, build and join the community.