Hacker News

I built an open-source AI agent that has already indexed and can search the entire Epstein files, roughly 100M words of publicly released documents.

The goal was simple: make a large, messy corpus of PDFs and text files immediately searchable in a precise way, without relying on keyword search or bloated prompts.

What it does:

- The full dataset is already indexed - You can ask natural language questions - Answers are grounded and include direct references to source documents - Supports both exact text lookup and semantic search

Discussion around these files is often fragmented. This makes it possible to explore the primary sources directly and verify claims without manually digging through thousands of pages.

Happy to answer questions or go into technical details.

Code: https://github.com/nozomio-labs/nia-epstein-ai

exa-d is our internal data processing framework that stores the web in S3. It helps deal with the complexity of data at (web) scale using specific design decisions like declarative typed dependencies and enabling sparse updates.

https://news.ycombinator.com/item?id=46608577. It occurred to me that HN has a tradition of posts called "The {name} programming language" (part of the long tradition of papers and books with such titles) and it might be fun to track them down. I tried to keep only the interesting ones:

https://news.ycombinator.com/thelang

Similarly, Show HNs of programming languages are at https://news.ycombinator.com/showlang.

These are curated lists so they're frozen in time. Maybe we can figure out how to update them.

A few famous cases:

The Go Programming Language - https://news.ycombinator.com/item?id=934142 - Nov 2009 (219 comments)

The Rust programming language - https://news.ycombinator.com/item?id=1498528 - July 2010 (44 comments)

The Julia Programming Language - https://news.ycombinator.com/item?id=3606380 - Feb 2012 (203 comments)

The Swift Programming Language - https://news.ycombinator.com/item?id=7835099 - June 2014 (926 comments)

But the obscure and esoteric ones are the most fun.

(* where 'new' might mean old, of course - https://news.ycombinator.com/item?id=23459210)

It’s early and rough, but usable. Would love feedback on whether this is useful and what relationships are most valuable to visualize.

https://github.com/tsoniclang/proof-is-in-the-pudding

And a hugo clone (which compiles to native code) here: https://github.com/tsoniclang/tsumo

Linux and macOS for now.

I was inspired by a version I saw at 38C3 and built my own interpretation for 39C3. Lots of people enjoyed playing it and even Elliot Williams featured it in his 39C3 Hackaday Podcast. And I can attest: it's truly fun because it's sooo simple at first sight - but wait until the speed increases... Not a bad work to fun created ratio for such a little project.

I used the opportunity to play around with Claude Code on my preexisting codebase to publish a nice-ish repo on GitHub. It worked great without any hitch or compile errors - impressive. What a nice way to test some capabilities.

Have fun with it an build your own version. And there are soooo many ideas that could be implemented. I am waiting for your feedback!

Will we end up with a league of networked 1D-Pong games? ;-)