iiinova — where your digital self keeps evolving

This was a lot of work with many false starts. I finally got to use the fancy category theory I learned through Haskell for some real math. It hasn't been fully peer reviewed yet but I'm finally confident enough to not doubt it. #math

@www.stephendiehl.com finally been putting my new lean skills to good use

Repo github.com/tavisrudd/cu... The lean formalized proof is in github.com/tavisrudd/cu... along with proofs for its companion papers. Each manuscript claim has detailed verification metadata and the paper's LaTeX is marked up for rendering with leanblueprint

github.com

100

My new paper on a geometry problem open since the 1970s: can a cubic threefold (a 3D geometric object defined by a cubic equation) become "simple" if you give it an extra dimension? No. Even after adding that extra dimension, its underlying algebraic complexity stubbornly survives.

200

I've reached out to a bunch of specialists whose work I've cited and extended and expect at least part of this to be classical work rediscovered or just wrong in various ways. I hope what survives is interesting.

000

... My naive questions and challenges seemed to help the models push past their natural stopping points and not cheat. /goal is dangerous for this type of work and I've avoided it.

100

This was not zero-shot! I've been in the loop over 1,552 codex and claude code sessions choosing and reframing problems, steering exploration and later proof & manuscript development, challenging arguments, and designing verification gates. ...

They ask two related questions: how much structure can be recovered after most of the original information has been discarded, and which obstructions persist under operations, such as stabilization, that might be expected to weaken them?

100

Tavis Rudd @tavis.damnsimple.com · 02/07/2026

Since Sol and Fable came out I've been obsessively using them for research math and putting my Lean skills to use. The result is a series of thematically connected papers in algebraic and finite geometry, coding theory, algebraic combinatorics, and quantum information. github.com/tavisrudd/ma...

github.com

130

Fable landed at 12.43s / 176M nodes. 270x faster than my original and half the time of its already heavily optimized starting point.

Tavis Rudd @tavis.damnsimple.com · 01/07/2026

Fable in its first 200K tokens shattered the record Opus and I had been stuck at for days on Non-Attacking Queens 16x16 solves. -38% wall time, -37.6 % nodes. 14.6 seconds. It moved like a killer. bsky.app/profile/tavi...

Tavis Rudd @tavis.damnsimple.com · 30/06/2026

The book cites cloud cover and blueness of the sky in English landscape paintings over the centuries as a climate data proxy

Tavis Rudd @tavis.damnsimple.com · 30/06/2026

I binged on European climate (and disease) history a few months ago. These were all excellent. The future may be scary but the past was far more so www.amazon.ca/1177-B-C-Civ... www.amazon.ca/Fate-Rome-Cl... www.amazon.ca/Little-Ice-A...

amazon.ca

1177 B.C.: The Year Civilization Collapsed: Revised and Updated: Cline, Eric H.: 9780691208015: Books - Amazon.ca

Michael Coyle @oplopanax.ca · 29/06/2026

Reposted by Tavis Rudd

A post by my friend Steve about the expansion plans of Mount Seymour Resort. The ski hill operates almost entirely within a Provincial Park and it already places roadblocks for public access. The expansion effectively transfers park land to a private operator, locking out the public.

stevejoneshikes.medium.com

Mount Seymour Provincial Park: An Alternative Vision for a Park We Love

Mount Seymour Provincial Park forms part of the stunning backdrop to the Greater Vancouver area. It’s a place British Columbians visit to…

193

Tavis Rudd @tavis.damnsimple.com · 28/06/2026

Have you read Ministry for the Future? www.gatesnotes.com/the-ministry... can't stop thinking of the opening heatwave but that he got the setting wrong

gatesnotes.com

Tavis Rudd @tavis.damnsimple.com · 27/06/2026

n=18 result is legit. verified via: • 2 independent solvers: same verdict, same move (I9), byte-identical 15-move PV • Lean-checked game recurrence • oracle differential, 3,400 subpositions • reproduces known n≤16 results (Jenrich) • rules-only certifier, zero solver code

Since Claude Code and Codex came out all my hobbies have been geeky versions of "Faster, Better, Stronger". I need to step away from this addiction and get back to making my body that. bsky.app/profile/tavi... bsky.app/profile/tavi... bsky.app/profile/tavi...

000

The solvers are "exact" unlike chess or go solvers which can't possibly be.

100

Consumer hardware: 12 core (24 hardware threads), 26GB ram, ryzen 5. Geekom A9 Max. Rust code leveraging all the hardware optimizations it can, following "Tiger Style" perf rules. DRAM latency on the Transposition Table is the limiter not core count or speed. Faster memory would improve it further

In English: boards into occlusion maps; folded rotations/reflections; cache repeated positions; packed into tiny cache entries; pre-solved small endgames; CPU bit tricks; tried most-forcing moves first; cache check before search; parallelized roots; tuned with detailed search telemetry.

000

The final used Normal-play minimax with ab pruning Node Kayles reduction D₄ group actions Canonicalization Graph isomorphism Dynamic programming Transposition DAGs Dense endgame tables Bitset set algebra Cutoff-rank statistics And a bunch of asm micro optimized kernels for various hotspots

My 1st solver was a parallel depth first search using D4 symmetry fold, Transposition Table, minimax + alpha-beta pruning, and Younger Brothers Wait parallelism.

200

The charts above are absolute and relative scale progress on wall time, search node count, and ns/node. The algorithmic improvements in node pruning dominate.

100

This isn’t the classic n-queens puzzle. It’s a two-player game: players alternate placing queens so none attack; each move blocks its row, column, and diagonals; the player with no legal square left loses.jstor.org/stable/27646335 PSPACE-complete complexity vs NP or #P for n-queen

loses.jstor.org

100

Tavis Rudd @tavis.damnsimple.com · 13/06/2026

I've been obsessed with coding fast adversarial game tree solvers this week. Warmed up on Othello and then wrote dozens of increasingly fast solvers for Non-Attacking Queens. Record 16x16 in 24sec. This needs to be verified but here is the first ever 18x18 board solve.

100

In the month since I posted this latency chart for my search engine project bsky.app/profile/tavi... I've managed to eek out another 57x speedup on the p99 -> 12µs. 450x faster than the original chart.

000

Tavis Rudd @tavis.damnsimple.com · 09/06/2026

Managed to shave another 110 off the p99 with all caches off. P50 36µs, p95 83µs, p99 117µs.

000

Reposted by Tavis Rudd

Armin Ronacher @mitsuhiko.at · 03/06/2026

In case you are in the camp of “Andrew Tridgell is vibefucking rsync” please read this.l and adjust your priors. medium.com/@tridge60/rs...

medium.com

rsync and outrage

I gave up blogging a long time ago (apart from an occasional thing about ArduPilot), I tend to just write code and hope people find it…

512523

Tavis Rudd @tavis.damnsimple.com · 03/06/2026

This is about as far as I can take it. One run with all caches/speculation on, another with them all off

100

Tavis Rudd @tavis.damnsimple.com · 01/06/2026

To the max now with vastly improved speculative prediction of the queries as you type. P99 = 41µs

000

Tavis Rudd @tavis.damnsimple.com · 01/06/2026

Oh, totally from scratch. I described what I wanted and it just coded up a custom set of plots

000

Tavis Rudd @tavis.damnsimple.com · 28/05/2026

Another level up: p99 139µs. Aiming for sub 100

210

Tavis Rudd @tavis.damnsimple.com · 28/05/2026

Claude made them for me as part of the tool

100

Tavis Rudd @tavis.damnsimple.com · 17/05/2026

PGO build: 22µs p50, 253µs p95, 615µs p99, 1.1ms max from keystroke to first-page results

100

Tavis Rudd @tavis.damnsimple.com · 17/05/2026

Been going "tiger style" with perf optimizations. 10x speedup between first image and second/third. Now p50@ 26µs p95@ 271µs p99@ 695µs :)

Tavis Rudd @tavis.damnsimple.com · 06/05/2026

Having fun making my new incremental search tool very fast p75 @ 82μs, p95 @ 515μs

Tavis Rudd @tavis.damnsimple.com · 20/04/2026

Noisy teenage ravens in the park

120

Tavis Rudd @tavis.damnsimple.com · 20/04/2026

@carlbergstrom.com have you seen www.imdb.com/title/tt2642...? It's on Prime Video atm (appropriately directed by Vance *Crofoot*)

imdb.com

100

Tavis Rudd @tavis.damnsimple.com · 11/03/2026

Seeing plenty of good posts on modeling and verification x.com/dominiktorno... Opus suggested and then cranked a formal machine executable lang spec for me last week github.com/tavisrudd/ii.... This is quality I couldn't afford without agents

x.com

020

Tavis Rudd @tavis.damnsimple.com · 09/03/2026

It also nailed a port of a complex concurrent pubsub msg bus from Cython to Zig. Lack of training data is definitely not a constraint. Only place I've seen it struggle is balancing parens in Racket. The rest of the lang and ecosystem is no challenge but counting is hard