Ask HN: What Are You Working On? (March 2026)

Continuing to make fantastic progress on Breaka Club, where we teach kids to code, be creative and make games:

https://breaka.club/blog/why-were-building-clubs-for-kids

The recent Netflix Games edition of Overcooked with K-Pop Demon Hunters is cool, but not nearly as cool as kids coding and playing their way through Overcooked levels in our custom educational mod for Overcooked:

https://youtu.be/ITWSL5lTLig

I'm also maintaining GodotJS, strongly typed TypeScript bindings for Godot, which is used to build the Breaka Club RPG (see first link):

https://github.com/godotjs/GodotJS

And last week I also put together the first release of MoonSharp in ~10 years; Lua runtime for Unity. That's not for Breaka Club though, I also consult for Berserk Games on Tabletop Simulator:

https://github.com/moonsharp-devs/moonsharp/releases

I made an idle version of the 1999 MMORPG "EverQuest". There's maybe around 50 people playing at any given time and has a enthusiastic discord group for it. It's relatively fully-featured to the original game, and has a lot of new mechanics to make the idle format work well. The 3D graphics aspect of it is really more of a screensaver, though, and all game interactions are done through menus.

I recently converted a bunch of stuff to be client side instead of server side (turns out running a real-time MMORPG server is expensive) so there's a new round of bugs I'm still resolving, but it's still fun to play:

https://www.idlequest.net/

I made a web-based speaking clock: https://alexsci.com/time-at-the-tone/

I had been doing lots of time-based work for a blog post and ended up annoyed that so many clocks around me were visually out of sync. Especially my microwave and oven clocks. Using the tool I got them synced up beyond what I could perceive.

A 16×16 multiplication table that encodes quoting, evaluation, branching, recursion, an 8-state counter, and IO — all as lookups in the same table. 83 Lean theorems, zero sorry. The project asks: can a finite algebra with a single binary operation be forced by axioms to contain its own representation layer? The answer is yes. Axiom-driven SAT search finds the constraints, Lean verifies the witness. I should be upfront: Claude wrote most of the Lean proofs and Z3 search scripts. My role was the ontological framework, the axiom design, and deciding what to search for and why. The AI-human split was roughly: I provided the "what should exist and why," Claude provided the "here's the code that proves/finds it." Every Lean theorem compiles independently regardless of who typed it. Universal results (hold for all satisfying algebras, not just this table): every model is rigid, judgment and synthesis provably cannot commute, and the tester's acceptance partition carries irreducible information that structure alone can't determine. The specific table fits in 256 bytes and can be recovered from a shuffled black-box oracle in 62 probes. https://github.com/stefanopalmieri/Kamea