Scale the blockchain with recursive ZK proofs about research-lab HOT 2 OPEN

A bounty (albeit vague in its current form) has been created for research in this area https://bounties.monero.social/posts/95

from research-lab.

We actually don't need a recursive proof, nor to burden miners as such.

If we have a pool of 1000 active proofs, someone about to send a transaction can randomly select one. They then produce two sets of TX proofs. One independent, one folded into the existing proof. This lets miners publish the folded proof without increasing the state size, as we can prune the old proof OR if it comes into conflict with another transaction (another TX decides to fold into the same proof), they can grow the state as they publish the independent proof.

This doesn't have as clean a path to recursive proofs though. Instead of recursively proving a list of proofs, we'd be recursively proving a list of proofs each of which are already the result of a list of statements which were proven. We'd likely want to:

1. Have archive nodes which archive all independent proofs (likely not feasible)
2. Bound folding depth to a low number such as 8. That way, we'd recursively prove proofs which are 8-folded (and any proofs not yet 8-folded would be artificially padded)

from research-lab.