HN user

timow1337

14 karma
Posts1
Comments11
View on HN

Compared to C, rust compiles much slower. This might not matter on performant systems, but when resources are constrained you definitely notice it. And if the whole world is rewritten in Rust, this will have a non-significant impact on the total build time of a bunch of projects.

The paper just describes a new method for selecting the main chain. Bitcoin uses the longest chain (with the most work) whereas this paper wants to use the block that is the child of the heaviest sub tree.

The ledger would still be a chain of blocks.

For real tree like blockchains there are a few examples such as IOTA, raiblocks and byteball.

If loops are implemented as tail calls, doesn't the call opcode get optimized away thus preventing the reduction checker from being run?