Still a long way from being able to understand all that is going on, but bits and pieces are starting to come together here and there for me :)
Now applied this to aut-ct in a branch:
https://github.com/AdamISZ/aut-ct/tree/delta
Proving is now down to 1-2 seconds even for large trees like 500K, but this is more from me fixing inefficiencies in my code; the real advantage of their new technique for me is just that they made the algorithms much simpler, *and* we have an easy way to batch proofs now (though I haven't done it).
So currently it's:
1-3 minutes to start up a server (which can be left running as long as you use the same curve tree)
1-2 seconds to do a single curve tree inclusion proof
50ms to verify a proof.
This already usable for the kind of 'satoshi millionaire' proofs like the one in my blog post, with sets of 500K or so and even larger, but for some long running system which wants to update the curve tree with new utxos all the time, like lightning it should be possible to get rid of most of that startup cost by using an 'accumulator update' method as discussed in the paper(s).
Discussion
Feel free to ask.
Appreciate it. Already got some recs from you a couple weeks ago (included your 02bp writing, moonmath manual, and a couple others I haven't gotten to yet.
Luckily I have enough background on the non-crypto math to get up to speed at a reasonable rate, but still a long way to go.
Will undoubtably have some questions down the line, but just taking in what I can for now
Yeah it does take a while!