frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Hurried Announcement: Alessandro Masullo GRH

https://math216.wordpress.com/2026/11/20/hurried-announcement-alessandro-masullo-grh/
1741•jasondavies•9h ago•775 comments

Levent Alpöge claims proof of the Generalized Riemann Hypothesis [pdf]

https://alpo.ge/remark.pdf
2445•iamronaldo•14h ago•1651 comments

Inkling 2 Mini

https://thinkingmachines.ai/news/inkling-2-mini/
797•jasondavies•8h ago•135 comments

NINLIVE: The Nine Inch Nails live archive

https://ninlive.com/
168•CharlesW•5h ago•42 comments

We promoted developers into architects without informing them

https://manidoraisamy.com/developer-to-architect.html
342•QueensGambit•10h ago•209 comments

Unforced Navier-Stokes Singularity and the Generalized Riemann Hypothesis

https://terrytao.wordpress.com/2026/11/20/unforced-euler-singularity-unforced-navier-stokes-singu...
378•archon1410•11h ago•154 comments

Valkey kills the skiplist, cuts sorted set overhead by up to 43%

https://valkey.io/blog/from-skiplist-to-b+tree/
72•reconditerose•3d ago•30 comments

Language Models Can Rewrite Their Own Weights

https://arxiv.org/abs/2611.21885
361•lwhsiao•11h ago•114 comments

Clojure will affect the way you think about programming (2017)

https://eli.thegreenplace.net/2017/clojure-the-perfect-language-to-expand-your-brain/
13•sammatilda•1h ago•1 comments

Sir Brian May adds new dimension to Hera asteroid

https://www.esa.int/articles/about-us/directorates/operations/space-safety/hera/sir-brian-may-add...
58•mooreds•5h ago•13 comments

DreamCoder: Coding harness and IDE from the author of Mastering Emacs

https://www.masteringemacs.org/article/announcing-dreamcoder
143•facundo_olano•8h ago•27 comments

Finite-time blow-up for the Navier–Stokes equations

https://github.com/tristanbuckmaster/navier-stokes/
267•trotro•12h ago•86 comments

Substrate: A Lisp for WebAssembly

https://substrate-lang.com
7•unignorant•3d ago•1 comments

Restricting AI agents in mobile operating systems platforms from capturing data

https://signal.org/blog/protecting-your-privacy/
528•dotcoma•18h ago•310 comments

And yet, it moves

https://signoregalilei.com/2026/11/20/and-yet-it-moves/
116•notfried•8h ago•60 comments

Vibecoding an inference chip

https://ankitg.me/blog/vibecoding-inference-chip/
124•ankitvgupta•10h ago•49 comments

Re: Riemann

https://borretti.me/article/re-riemann
175•_dain_•4h ago•167 comments

Serious cyberattack thought backed by wealthy operators

https://www.ruv.is/english/2026-11-20-serious-cyberattack-thought-backed-by-wealthy-operators-493411
34•Bender•4h ago•18 comments

The stochastic parrots have apparently proved the Riemann Hypothesis

https://scottaaronson.blog/?p=10344
240•stratos123•8h ago•221 comments

Winedroid – run Android apps without Android (WASM demo)

https://winedroid.soham.sh/demo/
115•sohzm•8h ago•36 comments

BlackBlaze now explicitly states selling your data for advertisement

https://www.backblaze.com/company/policy/privacy
21•meysamazad•1h ago•1 comments

Why the Airbus A321XLR often gets stuck climbing for first few hours of flight

https://simpleflying.com/airbus-a321xlr-often-stuck-climbing-1st-few-hours-flight/
98•edward•6d ago•67 comments

Show HN: I made an audio-to-MIDI model 60x more efficient

https://kobi.music/research/dettato
256•hidude562•4d ago•55 comments

I can’t believe it’s 1!

https://aperiodical.com/2026/11/i-cant-believe-its-1/
53•ColinWright•4d ago•56 comments

The Hungry Butler Effect: Concealed Commercial Incentives in LLMs

https://www.researchgate.net/publication/418143113_The_Hungry_Butler_Effect_Concealed_Commercial_...
23•undefinedmethod•6h ago•8 comments

How to Bypass Rust's Orphan Rule

https://edvong.com/bypass-orphan-rule/
25•todsacerdoti•2d ago•4 comments

US SEC's Nvidia probe is examining potential accounting issues – sources

https://www.marketscreener.com/news/us-sec-s-nvidia-probe-is-examining-potential-accounting-issue...
260•ftchd•8h ago•133 comments

I'm Peter Roberts, immigration attorney who does work for YC and startups. AMA

103•proberts•11h ago•147 comments

Show HN: OpenComputer – an open source alternative to Devin

https://github.com/diggerhq/opencomputer
76•iacguy•8h ago•22 comments

I Don't Trust Visual Recordings Anymore. But One Day I Will Again

https://spectrum.ieee.org/fighting-back-against-deep-fakes
14•jnord•3h ago•1 comments
Open in hackernews

Garbage collection of object storage at scale

https://www.warpstream.com/blog/taking-out-the-trash-garbage-collection-of-object-storage-at-massive-scale
96•ko_pivot•1y ago

Comments

juancn•1y ago
Another possible mechanism for doing GC at scale (a variation on Asynchronous Reconciliation in the article) in some file/object store, is doing a probabilistic mark and sweep using bloom filters.

The mark phase can be done in parallel building many bloom filters for the files/objects found.

Then the bloom filters are merged (or'ed together essentially) and then a parallel sweep phase can use the bloom filter to answer the question: is this file/object live?

The bloom filter then answers either "No" with 100% certainty or "Maybe" with some probability p that depends on the parameters used for the bitset and the hash function family.

cogman10•1y ago
What does the bloom filter solve?

The expensive portion of the mark and sweep for the object store is the mark phase, not the storage of what's been marked. 100s, 1000s, or even millions of live objects wouldn't hardly take any space to keep in a remembered set.

On the other hand, querying the S3 bucket to list those 1M objects would be expensive no matter how you store the results.

But this does tickle my brain. Perhaps something akin to the generational hypotheses can be applied? Maybe it's the case that very old, very young, or very untouched objects are more likely to be garbage than not. If there's some way to divide the objects up and only look at objects whose are in "probably need to be collected" regions, then you could do minor fast sweeps semi frequently and schedule more expensive "really delete untracked stuff" infrequently.

Cicero22•1y ago
I was thinking they could use something like cloudwatch events, or something, to trigger sweeps and significantly reduce scheduled sweeps.

They could even use cost allocation tags to predict if a bucket or group of buckets should be scanned if it's growing unexpectedly. Cost isn't a perfect metric but there's definitely signal there.

juancn•1y ago
Building the set of used files or objects (which is what mark does in a mark/sweep).

Sometimes it's too expensive to mark in place, even if it's a bit that you need to write to disk and keeping a set of references may be prohibitive (or the structure holding the references is mostly/effectively immutable).

If it's all memory and mutable it doesn't (normally) really matter, but when it's not, you ideally would have some mechanism to move the code to where the data is, rather than stream the data to where the compute is (it is really wasteful for large scale data processing).

In any case, you would not be moving/scanning the files themselves, but the metadata is what you want to read for the mark phase.

The article if I understood correctly implies that the files and the metadata of the files (Kafka queues and so on) are separate, so presumably, the metadata is much much smaller than the data itself, but still potentially large.

For example if you had a large scale content addressed store (think a massive version of git's blob storage), you typically add to something like that and keep a few mutable root references to start your GC from to seed a mark/sweep.

Following the git example, the roots would be the branches, tags and reflogs, and the metadata you scan the transitive closur of the trees that are reachable from those (simplifying a bit) but not the file blobs themselves.

I use git as an example because a a CAS lends itself very well to large scale distributed systems because you can reason about it as an immutable data structure, but you can still change it effectively with sane semantics.

donavanm•1y ago
If you like big beautiful storage and probabilistic structures check out https://www.usenix.org/conference/osdi14/technical-sessions/.... The coho data folks ended up in AWS S3 a few years later.
juancn•1y ago
Thanks! I hadn't seen it and it may come handy!
deathanatos•1y ago
> Why Not Just Use a Bucket Policy?

I've heard these words so many times, it's refreshing to see someone dig into why bucket policies aren't a cure-all.

As for "Why not use synchronous deletion?" — regarding the pitfall there, what about a WAL? I.e., you WAL the deletions you want to perform into an object in the object store, perform the deletions, and then delete the WAL. If you crash and find a WAL file, you repeat the delete commands contained in the WAL.

(I've used this to handle this problem where some of the deletions are mixed: i.e., some in an object store, some in a SQL DB, etc. The object store is essentially being used as strongly consistent storage.)

(Perhaps this is essentially the same as your "delayed queue"? All I've got is an object store though, not a queue, and it's pretty useful hammer.)

telotortium•1y ago
> HN Disclaimer: WarpStream sells a drop-in replacement for Apache Kafka built directly on-top of object storage.

First time I’ve seen one of these. That’s actually a better way to advertise your product than putting it at the end.

hencq•1y ago
Yes, though I think they meant to say disclosure instead of disclaimer.
siscia•1y ago
What I see working extremely well, arguably in a setting where cost was not really an issue was a much simpler approach.

Keep compacting files at some regular cadence `t` and keep a bucket policy to delete files older than `t+delta+buffer`.

Then have an alarm for files older than `t+buffer`