SkiFire13

5 ms·

31.
by SkiFire13 2mo ago
As they wrote, it's "a bit sad" indeed because they cannot blame Rust for this.
32.
by SkiFire13 2mo ago
> 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 different than the sum of the closest numbers to
33.
by SkiFire13 2mo ago
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.
34.
by SkiFire13 2mo ago
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 avoided with some extra complexity, but that require lot of work
35.
by SkiFire13 2mo ago
> 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't change from the previous compilation. For big proj
36.
by SkiFire13 2mo ago
> 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 to be file based (because it's really unit
37.
by SkiFire13 2mo ago
You're saving $1000 if you were normally throwing away your 2/3 year old phone instead of selling it to someone else.
38.
by SkiFire13 2mo ago
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 couple of them (without the bullshit) and peo
39.
by SkiFire13 3mo ago
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` statements, so you'll pay the performance tax
40.
by SkiFire13 3mo ago
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: https://doc.rust-lang.o
41.
by SkiFire13 3mo ago
You're 2-3 orders of magnitude off for a JVM
42.
by SkiFire13 3mo ago
> 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. However GC's solution to data races (make every
43.
by SkiFire13 3mo ago
> 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
44.
by SkiFire13 3mo ago
> You could even use Rust alongside Fil-C to ensure the unsafe blocks are safe. Isn't this what MIRI already does?
45.
by SkiFire13 3mo ago
Happy to see it's finally getting union types in 2026
46.
by SkiFire13 3mo ago
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 properties. On the other hand statically checking bounds
47.
by SkiFire13 3mo ago
> 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 losing money too until recently, when they started
48.
by SkiFire13 3mo ago
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 the whole execution tree when hashing. Their downsides is
49.
by SkiFire13 3mo ago
> 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 what has come before can cloud your view of an "
50.
by SkiFire13 3mo ago
Yup, and everyone measures it to be part of the algorithm, otherwise you start getting nonsensical results.
51.
by SkiFire13 3mo ago
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. Moreover it only works with bounded inputs. If your in
52.
by SkiFire13 3mo ago
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.
53.
by SkiFire13 3mo ago
> 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 that model adds do not complete in negligible time, a
54.
by SkiFire13 3mo ago
> Booth's idea is to rewrite one of the inputs in base (usually) "4", except that the digits go from -2 to +2 instead of 0 to 3. That's base 5 then. It needs to go from -2 to +1 if you want base 4
55.
by SkiFire13 3mo ago
> There doesn't seem to be any reason functionality like this couldn't also be added to Typst though. If I have to guess it's because the temporal inconsistency tradeoff can actually affect the current page too, since it m
56.
by SkiFire13 3mo ago
> EDIT to respond to the comments: in the article, they are only counting the number of multiplies in the O() value. They are not including the adds. This simplification relies on the fact that after making a multiplication the cost of m
57.
by SkiFire13 3mo ago
> There's little card payment fraud You're confusing fraud as in unauthorized payments with fraud as in you not receiving what you paid for. The latter is not prevented by 3DS in any way.
58.
by SkiFire13 3mo ago
Loggin into Paypal for me requires a 2FA code sent through either SMS or Whatsapp, both of which require a phone.
59.
by SkiFire13 3mo ago
Stripe's and Braintree's fees are like night and day, at least for us.
60.
by SkiFire13 3mo ago
> 3-D Secure has been a fiasco IMO. > I can recall when we first tried 3DS in the US Exactly, it has been a fiasco in the US, but it's working quite well in Europe. > When we finally decide we don't want to get lapped by

More ›