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.

It's been mentioned obliquely, but what's considered "part of the compilation process" is different between Rust and C.

Most of the examples of "this is what makes Rust compilation slow" are code generation related; for example, a Rust proc_macro making compilation slow would be equivalent to C building a code generator (for schemas? IDLs?), running it, then compiling the output along with its user.

Runtime memory issues probably have a significantly higher total cost.

But of course that doesn't negate this cost, but building can always be done on another machine as a way to circumvent the problem.

unfortunately, the sdk doesn't work with hi applications yet. the way the screen works has changed significantly. There are community projects that make it work though: https://github.com/ddvk/remarkable2-framebuffer

Yup, been throwing this link throughout the thread as well.

Does anyone have a list of which MEPs voted for and against? I can't find it yet.

The minutes will be published in the next few days.

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.

Does anyone know a similar project but for the client side? I've always thought using c++ instead of java would improve performance a lot.

There is a list of clients here: http://wiki.vg/Client_List

The Windows 10 version of Minecraft uses C++

Minetest ?

Too bad it doesn't support complex numbers

Satoshi Nakamoto also intended for the block sizes to go up after an amount of time, yet the bitcoin core team isn't willing to upgrade and tries to promote their own agenda (blockstream).

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

It marks the point just before the call as a yield. That yield remains after optimization.

Because they are doing business in said counties.

Maybe it is because of Facebook Ireland Limited, which technically is the company everyone outside of USA and Canada does business with

because if you wanna do business in some country you have to comply with local law even if it's internet company

now do the second example with an unsigned type.

The point is that a beginner does not need to care about signedness. When you get to that point, you can take the time to explain how to loop properly over it.