Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
valentynkit
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
1.
▲
by
valentynkit
1mo ago
Incredible tool! Really liked playing around with it.
2.
▲
by
valentynkit
2mo ago
The recoverable part all comes down to one offline copy the compomised credentials never touched. Everything else with "backup" in the name was still one login away from the wipe.
3.
▲
by
valentynkit
2mo ago
Anything that assumes /proc/self/exe points at the real binary, sandboxes and supervisors especially, quietly breaks under this. Worth a grep across that class of code before it lands broadly.
4.
▲
by
valentynkit
2mo ago
The delta layer is the part I'd want more detail on: once you're doing frequent consolidations against a multi-GB immutable core, what does write ampflication look like? That's usually where "runs in low hundreds of MB&q
5.
▲
by
valentynkit
2mo ago
Leaning on the original ROM for PRINT/INPUT/FP math is what makes this faithful instead of merely functional, since you inherit the hardware's quirks instead of reimplementing the away. Instruction-level rather than cycle-acc
6.
▲
by
valentynkit
2mo ago
You've basically build an LRU page cache with readahead for streaming 21, 504 experts off disk. Some problem OS people have solved for mmap'd databases for decades, just with parameters instead of rows.
7.
▲
by
valentynkit
2mo ago
The bug itself is almost boring - remove_waiter() clearing current's pi_blocked_on instead of the actual waiter's — which is exactly why it survived 15 years.
8.
▲
by
valentynkit
2mo ago
The thing that usually pushes you off Postgres is rarely raw throughput, it's two workloads that want opposite tuning on the same box.
9.
▲
by
valentynkit
3mo ago
That's TLS, crypto, and git-protocol code physically leaving the process that turns your source into machine code, and compiling the fetcher in ReleaseSafe while the compiler itself doesn't is the right call for code parsing untru
10.
▲
by
valentynkit
3mo ago
This is the trick that kills the dual-write bug in money-movement systems: co-locate the checkpoint with the write so a mid-workflow crach can't leave you half-commited.
11.
▲
by
valentynkit
3mo ago
Bounds and div-by-zero are the easy wins; the real tax with contract systems is the loop invariant Z3 can't infer on its own, where you end up hand-writing an `ensures` longer than the function body. What's the gnarliest invariant
12.
▲
by
valentynkit
3mo ago
Curious how you're handling supervision after the switch. The remoteproc unit you converted by hand is the part that gets interesting: when it crashes, what restarts it, and what guarantees it came up only after its dependencies were a
13.
▲
by
valentynkit
3mo ago
Quick one on the benchmark: was the 2.8GB peak virtual or resident? Go reserves a large virtual arena it mostly never faults in, so RSS tends to be a fraction of the virtual peak, and if Postgres headroom was getting squeezed off the virtua
14.
▲
by
valentynkit
3mo ago
Those cores aren't idle for lack of software, anything embarrasingly parallel eats all 144 fine.