frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Gemini 4 Neon

https://blog.google/innovation-and-ai/models-and-research/gemini-models/introducing-gemini-4-neon/
511•yigitdemirag•5h ago•468 comments

AI Will Not Make You Rich (2025)

https://colossus.com/article/ai-will-not-make-you-rich/
49•madars•1h ago•30 comments

Unauthenticated remote code execution in Nginx

https://www.wiz.io/blog/nginx-http2-rce-vulnerabilities
1174•speedping•11h ago•524 comments

Gemini 4 Neon looks like an Opus 5.5 competitor

https://micjm.com/blog/gemini-4-neon-looks-like-a-top-model/
102•seizethecheese•2h ago•34 comments

Multiple vulnerabilities in Regexp and String case conversion

https://www.ruby-lang.org/en/news/2026/11/18/multiple-vulnerabilities-in-regexp-and-string/
97•runesoerensen•3h ago•21 comments

Anthropic prices initial public offering

https://www.anthropic.com/news/anthropic-prices-initial-public-offering
100•surprisetalk•3h ago•48 comments

Seven new models at scalable price-performance

https://microsoft.ai/news/microsoft-ignite-2026/
465•gmays•10h ago•323 comments

AI agents ask better questions than KPMG accountants in audit trial

https://europeanbusinessmagazine.com/ai-agents-better-questions-kpmg/
376•Betelbuddy•11h ago•165 comments

LLM assisted reverse engineering

https://www.slowchronicle.com/posts/llm-assisted-reverse-engineering
83•ioma8•4h ago•19 comments

Inside Deutsche Bank

https://www.inside-db.com/
572•gyre007•11h ago•192 comments

DNS resolvers are the wrong place to fight piracy

https://techstackups.com/articles/quad9-leaves-france-dns-blocking/
612•ritzaco•13h ago•228 comments

DaisyRose-27B

https://www.radixark.com/blog/daisyrose-27b
150•de_sty•7h ago•42 comments

Unreal Tournament 2004 in the Browser

https://ut2004.dev/
25•TheAceOfHearts•1h ago•5 comments

Previous-Token Prediction Based LLM Inversion for Prompt Reconstruction

https://arxiv.org/abs/2607.29378
11•dalmo3•1h ago•4 comments

Dumping an AES key from a MyQ garage opener to stop rebooting when offline

https://kusha.me/blog/stop_myq_homebridge_819lmb_rebooting/
52•kusha•2d ago•18 comments

FailTrace – Reproduce a failed GitHub Actions run locally from its URL

https://github.com/Ri4dH/failtrace
9•ri4dh•1h ago•0 comments

We need smart people who give a shit

https://violetpixel.com/blog/2026-11-17-we-need-smart-people-who-give-a-shit/
261•ExMachina73•3h ago•138 comments

Genie 4 is now available

https://blog.google/innovation-and-ai/models-and-research/google-deepmind/genie-4-now-available-p...
201•leumon•8h ago•143 comments

Advancing chip design with OpenAI models

https://openai.com/index/advancing-chip-design-with-our-models/
167•vighneshiyer•9h ago•107 comments

My computer misbehaved so I went down a rabbit hole (2019)

https://leonwu.tech/posts/my_computer_misbehaved_so_i_went_down_a_rabbit_hole
4•sammatilda•1d ago•0 comments

The Cambridge Dictionary has named ‘human’ as the Word of the Year 2026

https://www.cam.ac.uk/news/cambridge-dictionary-reveals-word-of-the-year-2026
244•DeepLogin•12h ago•173 comments

Cuttlefish on Mac: Android's Virtual Device Framework on Apple Silicon

https://engineering.fb.com/2026/11/13/android/cuttlefish-on-mac/
46•acossta•3d ago•9 comments

Show HN: ExitPath – Open-source ways out of Slack, Notion and Microsoft 365

https://exitpath-ruddy.vercel.app/
174•zerocool0101•10h ago•52 comments

Show HN: Take Voyager 1 apart, down to a single memory chip

https://rshekhar.com/voyager/
159•raj-shekhar•10h ago•34 comments

A Collage Showing 49 Drill Holes Made by NASA's Curiosity Mars Rover

https://science.nasa.gov/photojournal/a-collage-showing-49-drill-holes-made-by-nasas-curiosity-ma...
35•wawayanda•2d ago•3 comments

Palo Alto Networks to Acquire Applied Compute for $4.5B

https://investors.paloaltonetworks.com/news-releases/news-release-details/palo-alto-networks-acqu...
18•alpb•3h ago•2 comments

Show HN: Open-source, real-time object tracking for live video feeds

https://github.com/aryamandarda/tamserve
49•aryaman_darda•2d ago•2 comments

Launch HN: Maritime (YC F26) – A managed cloud for production AI agents

45•ashriv•9h ago•39 comments

Black high school students sue after AI mistakes Doritos bag for gun

https://www.lawyerscommittee.org/lawyers-committee-files-lawsuit-on-behalf-of-black-students-deta...
33•DeepLogin•2h ago•0 comments

Collisions in Hash Functions

https://collisions.zksecurity.xyz/
8•baby•2d 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`