Viewing profile — SkiFire13

> because they already have the code for it That's not how it generally works in most businesses.

The word kernel always meant "the most important part of something". Likewise "harness" can be used to mean "to collect and control something so that it can be used effectively".

As they wrote, it's "a bit sad" indeed because they cannot blame Rust for this.

> The usual "0.1 + 0.2 != 0.3" is _not_ imprecision. It _is_ imprecision. Even if you cannot represent 0.3 exactly, you can consider the closest representable number, and that is d…

We do that too sometimes but it doesn't create the same kind of memories as spending a week in a tropical paradise or going on some kind of adventure together.

The downside of this is that if two crates use the same function each of them will have to codegen it, duplicating the work needed for those functions. As always this could be avoi…

> To me compilers should be content-addressed databases Rustc already does something like this. The issues are: - when you have to rehash everything to check that they indeed didn'…

> Haskell GHC's model of incrementality, which is currently file-level From what I see in Haskell files are the unit of compilation, and that's what allows incremental compilation …

You're saving $1000 if you were normally throwing away your 2/3 year old phone instead of selling it to someone else.

I've mostly seen "retreat" being used for cases where you go on a pseudo-vacation with collegues paid by your company, with or without pseudo-therapy bullshit. I've been on a coupl…

I thought you meant to use Fil-C as a kind of sanitizer too. I don't see a point in running Rust code in Fil-C. Due to the way Fil-C works it won't be enough to check the `unsafe` …

Is this the classic "split out obviously wrong facts to get corrected"? I'll take the bait then. Here's rust official documentation stating that it doesn't prevent race conditions:…

You're 2-3 orders of magnitude off for a JVM

> One of the basic ideas behind Rust's memory safety story is that eliminating race conditions Rust does not prevent race conditions. You're getting confused with data races. Howev…

> Strictly speaking, there's an owning_ref crate owning_ref is unsound and shouldn't be used. self_cell/yoke/ouroboros are much better alternatives, ableit more complex

> You could even use Rust alongside Fil-C to ensure the unsafe blocks are safe. Isn't this what MIRI already does?

Happy to see it's finally getting union types in 2026

But that's also arguably pretty boring because it's very easy to dynamically check and the cost for doing so is relatively small compared to what needs to be done for other propert…

> This means that these frontier labs are truly susceptible to "predatory pricing" (economic term for a competitor selling at a loss to eliminate you) OpenAI and Anthropic were los…

What you're describing is akin to a basic pull-based incremental engine, akin to salsa. The base design is straightforward, but you need some additional logic to avoid following th…

> You can claim that it is obvious, and trivial, and uninteresting, but that doesn't invalidate it. Sometimes thinking outside of the box is required and such strict adherence to w…

Yup, and everyone measures it to be part of the algorithm, otherwise you start getting nonsensical results.

What you are stating is simply that any algorithm whose inputs are bounded can be solved in O(1) time with a lookup table. That's known and obvious, which makes it not interesting.…

The lookup table is part of the algorithm, and is not finite. In general any problem can be solved in 1 step with a lookup table, so here you go P=NP solved.

> If we're disregarding shifts and adds as completing in negligible time When considering multiplication algorithms the parameter N is the number of digits of the two numbers. In t…