Viewing profile — sword_smith

"anarcho-tyranny"

Your obfuscation carries no argumentative weight, as the uncertainty your obfuscation attempts to introduce might as well be used in the reverse: maybe the guy who made the origina…

Sure. If you accept that we give up on equality before the law, one might be prosecutable and the other not. Some of us prefer not to give up on that though.

Corruption is defined as "the abuse of entrusted power for private (usually financial) gain". Lars' case falls under the category of conscientious objection, as he's ideologically …

That same prime minister supports the warrant-less use of medical records in police work and the ban of encryption through chat control. She wants to prevent the Danish population …

Lars is good at exposing the hypocrisy of the Danish government. In a former case he, sent the exact same threatening text to a prosecutor as that prosecutor had received a police …

Lars was a corrupt cop? Are you just using "corrupt" to mean "someone I don't like"?

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 the…

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 pro…

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 T…

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

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 ` Building sound and complete STARKs …

Unfortunately this can add some overhead to the memory table though. I wonder if there's a better solution than the one proposed here. Not that it matters for Brainfuck too much, a…