est31

42 ms·

541.
by est31 4y ago
It's a nice piece of research but I wouldn't call it a fiasco. Many parts were well engineered, they just found some edge cases that yes had devastating effects. It's the old attacker's advantage again, in security, even
542.
by est31 4y ago
Due to topography, Autobahn roads can still be very curvy. The Albaufstieg [0] is an extreme example but not the only one. Notice the sign at 3:04, it's limited to 60 kmh. Weather can make those curves even more dangerous, e.g. rain or
543.
by est31 4y ago
> which part of the fatalities happened > 130kmph? Usually (not always) you realize that something bad is going to happen so you are going to brake. Let's assume there is an obstacle in front of you that is 150m away. After a rea
544.
by est31 4y ago
The issue with ground based traffic is that you have a lot of non-moving objects around you, like trees, walls, animals, etc. So even if all cars drive at 250 km/h, those non-moving objects still remain there and pose an ever increasin
545.
by est31 4y ago
It is a highly unlikely process that is the result of a chain of events, not just at the "creation" end but also at the "discovery" end: that the bones are close enough to the surface to be detected, but haven't bee
546.
by est31 4y ago
Tbh in the hypothetical scenario where all of a company's configuration were handled via nix, you'd be staring at tens to hundreds of thousands of lines of company-custom .nix files where one single line might cause the bug you ar
547.
by est31 4y ago
So Amazon with its 3-fold ratio is in fact giving a better argument for ipv6 than the average, nice. Generally a factor of two doesn't say much about ipv6 creating less allocations at all, given how ipv6 is roughly within a factor of t
548.
by est31 4y ago
site-local addresses are deprecated since RFC 3879. Link-local addresses are indeed another standard, but have the very same length problem. You have these horribly long ipv6 addresses... those can't reasonably be parsed by humans...
549.
by est31 4y ago
One of the ideas of ipv6 was to reduce routing tables, those tables that backbone providers have to keep in memory and look up for incoming traffic. With ipv4's fragmented allocation scheme, these routing tables are huge. With ipv6, ev
550.
by est31 4y ago
Firefox doesn't: https://bugzilla.mozilla.org/show_bug.cgi?id=1281469 (But it's the only browser that doesn't support CT)
551.
by est31 4y ago
There are definitely limitations in GNU/Linux root stores. E.g. to my knowledge it's impossible to distinguish between the root coming from the distro vs coming from a custom configuration, e.g. for corporate MITM proxies. So you
552.
by est31 4y ago
They have encountered an interesting algorithmic problem here, very cool. To determine whether the universe as a whole has a preferred handedness, they had to repeat the analysis for all tetrahedra constructed from their database of 1
553.
by est31 4y ago
> Try buying a PC with an open source BIOS or CPU, you can't! https://support.system76.com/articles/open-firmware-systems/ The "open firmware" marketing term is a bit of a misnomer here as there
554.
by est31 4y ago
> if people who are shown ads could add tags to the adds for the type of product/service the ad is for, or other aspects of the ad (e.g. “this ad is horny”), and indicate classes of ads which they claim they would not be interested
555.
by est31 4y ago
In those tech companies, that knowledge has arrived. Of course, among software people, similar is true, because who doesn't like being told they are important and valued. But there are various kinds of "tech" companies. Ones
556.
by est31 4y ago
The Android project compiles the standard library themselves: https://android.googlesource.com/platform/prebuilts/rust/+/a...
557.
by est31 4y ago
You can confirm it by looking into the source code: https://android.googlesource.com/platform/build/soong/+/refs... Not an expert, but a file named "global.go" makes me confident :).
558.
by est31 4y ago
> Only time will tell whether Rust will reach the critical mass necessary to displace C/C++ in most new low level projects As someone who has been in the Rust community since a couple of months after 1.0, I only see growth, year aft
559.
by est31 4y ago
> there are many other memory safe languages around and there has been thousands in the past. Yes, and in fact they write about how they are replacing C/C++ with Kotlin or Java. All three are memory safe languages. But Rust is the o
560.
by est31 4y ago
Rust programs can have vulnerabilities, but thankfully the fuzzer scene is well developed. Recently a memory safety bug was found in a Rust library (that used unsafe) and it turns out the original C++ implementation had it too. So here, fuz
561.
by est31 4y ago
Yeah Rust's syntax was inspired to be similar to C++.
562.
by est31 4y ago
You don't start at the cutting edge immediately. You start where it is better understood. Then you can still pay the enormous investments needed for getting to cutting edge and furthering it, if you want. Also, from an economic perspec
563.
by est31 4y ago
Not all markets are equally accessible by public companies as is the case with the US. Often you have a lot of private companies, companies owned by people close to the government, etc. If you own real estate it might suddenly be disowned a
564.
by est31 4y ago
Yeah, if the number of people shrinks, so does the size of a market, and so do revenues of companies. If you own stocks, those will be worth less. If the number of people shrinks, so does the demand for living space, and the value of your a
565.
by est31 4y ago
A better comparison is: fn foo_arr(v: &[u8; 5]) -> u8 { v[2] } fn foo_vec(v: &Vec<u8>) -> u8 { v[2] } In the foo_arr case, the index lookup can be optimized out. In the foo_vec c
566.
by est31 4y ago
Actually that made me think... you might be right. I just saw this opinion in earlier threads and repeated it but upon second inspection I either remembered it wrongly, or it is a wrong theory. I think the issue is more the side effects tha
567.
by est31 4y ago
It will still implement that with a loop over the array where there is a (bounds) check for the integer when it's being incremented (the i < len in int i; for(i = 0; i < len; i++)). That's no different from a loop over a sli
568.
by est31 4y ago
Yeah this is because the error message printed contains the location of the error as well as the attempted index. Thus, there are differences between the bounds failures and the optimizer can't hoist the check out (plus probably some c
569.
by est31 4y ago
Interesting observation. So one should instead do the comparison with something like: 1. if (x >= 0) && (x < arr_len(arr)) 2. get element from array index x 3. else 4. core::hint::unreachable_unchecke
570.
by est31 4y ago
Rust has a tool for that, it's iterators. It is only limited however.

More ›