Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
crest
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
30 ms
·
421.
▲
by
crest
2y ago
So by design run0 does not do what sudo does. If I understand it correctly it has to stay a child of the daemon it's forked or does Linux provide an API to mangle the poor process table to change that since because according to POSIX t
422.
▲
by
crest
2y ago
Did you read the date of publication of the article benchmarks or did you just blindly assume the author published them on the day the embargo on publishing benchmarks for the chip fell?
423.
▲
by
crest
2y ago
Good old Internet of Things that shouldn't be on the Internet.
424.
▲
by
crest
2y ago
I suspect you haven't read the errata sheets for any modern EFI or even worse BMC? There is so much buggy crap in there that users are likely to run into that patching your firmware is a good idea just for stability and performance bef
425.
▲
by
crest
2y ago
[citation needed].
426.
▲
by
crest
2y ago
> On the other hand, GLIBC has, to my knowledge, the most hardened heap implementation out there. And there are more mitigations for double-free and other heap exploits on GLIBC. Check the OpenBSD libc...
427.
▲
by
crest
3y ago
The original Deus Ex (with a high res texture pack).
428.
▲
by
crest
3y ago
It can be an essential component, but for on-site replication you need to coordinate your caches to make the most of your available capacity. There're efforts to implement this on top IPFS to have mutually trusted nodes elect a leader
429.
▲
by
crest
3y ago
Give him some time to recover first. After all the haters destroyed the fruits of his tireless labour of love to which he dedicated years of his life. /s
430.
▲
by
crest
3y ago
CXL supports cache-coherent memories and even the numbers claimed in marketing materials are ~5x when it comes than DDR5 access times measured on desktop CPUs in microbenchmarks. It's still a lot better than having software handle the
431.
▲
by
crest
3y ago
Even the fastest (as in lowest latency) CXL memories claim a ~200ns latency (~4x worse than DDR5) and it wouldn't be free.
432.
▲
by
crest
3y ago
It's what got me pissed of enough with xmonad to discard it.
433.
▲
by
crest
3y ago
It's hard to believe that more and more compiler writers realise that language lawyering alone isn't going to improve anything but runtime on an unchanging set of microbenchmarks. I still remember the bad old GCC 4.x error message
434.
▲
by
crest
3y ago
I have to applaud taking even "failed" projects serious enough to come up with a reasonable exit plan (unlike some large companies).
435.
▲
by
crest
3y ago
Too much fallout.
436.
▲
by
crest
3y ago
Dedupe is an optional and often misunderstood feature. It's a solution to a niche problem and not something you should enable because it exists. Data protection doesn't require lots of memory, but the way it's implemented mea
437.
▲
by
crest
3y ago
The big problem with APFS is that it was designed by people believing in magical hardware that doesn't let the file system observe whole classes of errors...
438.
▲
by
crest
3y ago
I have a few questions I haven't found satisfactory answers for in the existing papers: * Are modern patrol read engines guided by the memory access patterns to respond to RowHammer style attacks? * How aggressive would a patrol read e
439.
▲
by
crest
3y ago
Neither block ciphers, nor stream ciphers, nor common public key algorithms (RSA, Ed25519) need or even profit from this. They just need fast access to the register-register math, maybe loop sequentially through all members of a fixed sized
440.
▲
by
crest
3y ago
Speculation is required to get even close to the single-thread throughput expected of any modern CPU for anything worth running on a general purpose CPU. The problem is that there is no formal specified model to reason over side-channels no
441.
▲
by
crest
3y ago
Unspeakable horrors like changing `$[` in old Perl5 versions to mess with someone's mind? Who doesn't like array indices starting at 0, 1, ... or 42?
442.
▲
by
crest
3y ago
Turning off prefetching while running crypto code would be a performance gain before you can implement the algorithms safely without even more expensive and fragile software mitigations. Just give me the option of configuring parts of the
443.
▲
by
crest
3y ago
GCD does a lot more.
444.
▲
by
crest
3y ago
Imo the question is do you want to protect passive users access to the code or developers freedom to use the code how they want it even if that does mean they take existing code, modify it slightly, put it in an embedded device, and enable
445.
▲
by
crest
3y ago
The other thing is that a bunch of stuff it auto-completes is way below any reasonable threshold for a copyrightable work even it bit for bit reproduces code from a piece of AGPL software. There are also only a finite sane number of ways to
446.
▲
by
crest
3y ago
The most common example for this is the fast inverse square root function from Quake engines. Start the function signature and the "auto-complete" will fill in the body implementing it.
447.
▲
by
crest
3y ago
IIRC because tuning PID controllers for vastly different heating and cooling rates isn't that easy. A CPU can ramp up/down a lot quicker than the cooling system could or should even attempt to react. It's easy to end up with
448.
▲
by
crest
3y ago
Even today 17,000 lines of Lisp can be dauntingly complex ;-).
449.
▲
by
crest
3y ago
It's no longer black and white like the FDIV bug, but if the default configuration leads to data corruption in heavy SIMD workloads... sure you can reduce clock speed or increase voltage until it works, but unless the mainboards violat
450.
▲
by
crest
3y ago
I disagree. This code is just lucky enough to be able to detect the data corruption, but without very deep understanding afterward the whole system state has to be assumed to be corrupted. You can retry until the code doesn't detect
More ›