frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Java4Shell: RCE in OpenJDK when processing Base64

https://calif.io/java4shell/
579•werrett•5h ago•153 comments

ID.me terms required for IRS sign-in

https://consumerrights.wiki/w/ID.me_terms_required_for_IRS_sign-in
130•DeepLogin•2h ago•45 comments

Google's AI answers reducing search traffic by 40%

https://revscope.co/blog/search-seo-geo-2026/
120•slashdev•2h ago•78 comments

GPT‑6.2 Astra and Sol

https://openai.com/index/introducing-gpt-6-2-astra-sol/
1118•jasondavies•9h ago•709 comments

Quad9's withdrawal from France: A canary in the coal mine

https://blog.cloudflare.com/quad9-withdrawal-from-france/
335•subset•4h ago•94 comments

Archive Team is archiving the Apple Support Community (closes November 20, 2026)

https://wiki.archiveteam.org/index.php/Apple_Discussions
95•digitaldragon•3h ago•36 comments

Microsoft's ONNX Runtime has disappeared from GitHub

https://github.com/microsoft/onnxruntime
151•nvader•3h ago•37 comments

Nvidia stopped disclosing Singapore sales as revenues hit $104B

https://www.ft.com/content/dbde7a30-548c-4f9d-a4be-7898a0c24dcf
413•louiereederson•9h ago•197 comments

jQuery 4.1.0

https://github.com/jquery/jquery/releases/tag/4.1.0
260•petecooper•7h ago•145 comments

MAI Code 2 and Code 2 Flash

https://microsoft.ai/news/introducing-mai-code-2-and-mai-code-2-flash/
301•lemonish97•8h ago•136 comments

Highly classified US national security communications network goes down

https://www.cnn.com/2026/11/17/politics/highly-classified-national-security-communications-networ...
491•monkeydust•11h ago•565 comments

Phrack 73 Released

https://phrack.org/issues/73/introduction_md
292•notmine1337•8h ago•46 comments

350 years ago, Ole Rømer discovered that light has a finite speed

https://www.sciencenorway.no/culture-history-history-of-science/350-years-ago-this-man-discovered...
259•dxs•7h ago•78 comments

Harvard researchers find AI coding agents shifted the bottleneck to code review

https://complexdiscovery.com/harvard-researchers-find-ai-coding-agents-shifted-the-bottleneck-to-...
69•judahmeek•5h ago•101 comments

Fun with Constrained Programming

https://blog.cmpxchg8b.com/2012/09/fun-with-constrained-programming.html
21•colejohnson66•3d ago•0 comments

Solid 2.0

https://www.solidjs.com/blog/solid-2-0-the-long-hold/
240•pier25•7h ago•62 comments

Cerebras Disaggregated Inference

https://www.cerebras.ai/blog/cerebras-launches-disaggregated-inference
25•emschwartz•1h ago•8 comments

What is the best harness for each model?

https://runta.com/blog/introducing-frontierharness-eval-v1-1/
340•Edward40•12h ago•118 comments

Nozzle: A streaming library that emits when possible and buffers where necessary

https://github.com/Robert-Cunningham/nozzle
6•robertvc•3d ago•0 comments

Launch HN: StarSling (YC P25) – Self-improving CI for agent-volume repos

https://starsling.dev
56•yonasb•7h ago•34 comments

Apple Services Down

https://developer.apple.com/system-status/
641•willy_k•9h ago•355 comments

Web Browser Engineering (2021)

https://browser.engineering/
127•ibobev•6h ago•20 comments

Latent Lattice Language Models

https://shivamduggal4.github.io/latent-lattice-language-models/
30•E-Reverance•4h ago•4 comments

Tencent Hy4 Flash

https://hy.tencent.ai/research/hy4-flash
61•lyra1337•5h ago•10 comments

Not Everything Needs an LLM

https://newsletter.posthog.com/p/decision-models
108•speckx•8h ago•43 comments

YC wrote software to run our internship expo – and an 8-bit SIM to show it off

1•ryankicks•9h ago

Effects of a Nuclear Detonation in Low Earth Orbit

https://arxiv.org/abs/2611.09827
84•PaulHoule•7h ago•51 comments

Who Builds the Machines That Build the Machines?

https://read.corematter.com/p/section-232-us-machine-tools
104•gmays•9h ago•30 comments

Mouse Party

https://aboard.com/lets-have-a-mouse-party/
70•bookofjoe•3d ago•11 comments

How the Claude Code team thinks about verification

https://claude.dev/blog/how-the-claude-code-team-thinks-about-verification/
269•craigmart•16h ago•214 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`