the user "erk__" from this forum managed to get a copy: https://user.fm/files/v2-5bf26ed8f02e4cac68357e4ed895b3fc/Sl...

See-through blockchain's biggest problem might be that their coins are not fungible, as their history affect their current value. A protocol solution to this problem is to make their history opaque.

Bitcoin's conception was immaculate and new blockchain projects can't hope to match that, yet alone beat it. But Bitcoin can be challenged on technical aspect. We identify four properties that Bitcoin is lacking:

- throughput scalability (is being fixed) - programmability (could be fixed) - privacy (could be fixed) - post-quantum security (can't be fixed)

Afraid of superintelligent AIs gone rogue? Let's start wargaming!

You might want to generate this code with the latest trick for evaluating multivariate polynomials: https://news.ycombinator.com/item?id=33740808

Making a STARK prover fast enough to be feasible requires multiple algorithmical tricks. This article showcases the latest algorithm that was implemented as a part of speeding up Triton VM.

Nice. I helped write the original Python implementation, so thanks for building this. STARK proof generation is definitely a good candidate for GPU acceleration.

Awesome! Thanks so much for that, it really helped me learn

Or maybe somewhat similar to biological evolution: competition and cooperation.

With a STARK prover the correct execution of a program can be validated in sub-linear time, faster than it would take to re-run the program.

Worth noting is that this solution does not constrain the memory value of the last execution trace if the execution trace ends with a `>` or a `<`. Since this value cannot be output, you could argue that that's OK.

Building sound and complete STARKs are really an intricate affair! I have no doubt that we'll eventually get there though!