Nil

This account is verified. Learn more

@Nil053

· isomux.com: agents as coworkers
· isomux.app: hosted product
· beyondctci.com: book
· bigOspeedrun.com: track big O races
· wallgame.io: fun
· dsatoolkit.com

SF nilmamano.com Joined January 2023

1.6K Following 328 Followers 1.7K Posts

Latest posts 5

Pinned post

Nil @Nil053 Oct 10

bigOspeedrun.com

On Oct 6, many long standing bounds got broken, ushering a new era of agentic speedrunning toward the real bounds

I built the leaderboards

bigospeedrun.com Big O Speedrun Track improved algorithmic bounds for classic problems, with results, proofs, and progress over time.

Nil @Nil053 Nov 4

Lately I've been doing product demos for Isomux.

First one, I didn't ask questions

Second one, I asked questions but then proceeded to demo something unrelated to their answers

Third one, I set up integrations for their own tools (asana, Teams, etc.) ahead of the demo, but I didn't know the tools well enough

As Brian Armstrong says, action produces information. The corollary: every attempt tells you how to do the next one better.

Nil @Nil053 Nov 3

I recall X dogpiling on this @ValsAI result when it came out, with the community note and all (which I rated as unhelpful for "missing the point").

It's actually cool as hell. And lean verified too. Dijkstra is provably optimal *except* between m = O(n/log n) and m = O(n log n), so any progress in that range is a breakthrough.

I'm going to turn it into a @bigospeedrun race.

Vals AI Verified account @ValsAI Sep 22

We asked ten Claude Opus 5.5 agents to devise a faster shortest-path algorithm and prove it in Lean. Within 15 hours, they produced C-HD: a formally verified improvement over the published bounds.

View quoted post on X

Nil @Nil053 Nov 2

Any other proof ecosystems I should integrate?

Prove2Me Verified account @prove2memath Nov 2

We're excited to announce our collaboration with @Nil053 on bigospeedrun.com!

Big O Speedrun now features results from Prove2Me, backed by Lean-verified proofs.

Let's see how many more bounds we can break together!

prove2.me/blog/big-o-spe…
View quoted post on X

Nil @Nil053 Nov 2

Screenshot from my site bigospeedrun.com/integer-factor…

very cool

bigospeedrun.com Integer Factoring · Big O Speedrun Compare deterministic integer factoring bounds, their evidence, and progress toward subexponential time.

Cinna Davis @1337isnot1337 Nov 1

🚨🚨🚨 New integer factoring progress!!

Shockingly, interval products with up to 2^n factors compress into O(n+p)-size circuits mod 2^p.

An exact polytime GCD over Q could yield exp(O(√n)) factoring.

YOU can help! point your agents at the repo below

github.com/1337isnot1337/…

View quoted post on X