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

A ring you can talk into and it controls an agent on your phone. Eg say "pick me up" and an Uber arrives.

Looking for people who know hardware well. Let's get to know one another on a flight to Shenzhen :P

I coded a visual novel/adventure game framework in pygame. Pretty much just to see if ai could handle a full project.

Eventually I got scope creeped into a full game with branching stories, item crafting, and a custom cutscene engine...even Trained a model for a few specific art assets.

https://store.steampowered.com/app/4301600/Cherrys_Dungeon/

I'm back to searching for numbers that are palindromes both in decimal and in binary. [0]

I had an insight the other day, that as I fix the n least (and most, it's a palindrome!) significant decimal digits, I also fix the remainder from division in 5^n. Let's call it R. Since I also fix by that point a bunch of least (and most) significant bits, I can subtract how much they contribute mod 5^n from R, to get the remainder from division in 5^n of the still unknown bit. The thing is, maybe it's not possible to get this specific remainder with the unknown bits, because they're too few.

So, I can prepare in advance a table of size 5^n (for one or more ns) which tells me how many bits from the middle of the palindrome I need, to get a remainder of .

Then when I get to the aforementioned situation, all I need to do is to compare the number in the table to number of unknown bits. If the number in the table is bigger, I can prune the entire subtree.

From a little bit of testing, this seems to work, and it seems to complement my current lookup tables and not prune the same branches. It won't make a huge difference, but every little bit helps.

The important thing, though, is that I'm just happy there are still algorithmic improvements! For a long while I've been only doing engineering improvements such as more efficient tables and porting to CUDA, but since the problem is exponential, real breakthroughs have to come from a better algorithm, and I almost gave up on finding one.

[0] https://ashdnazg.github.io/articles/22/Finding-Really-Big-Pa...

https://github.com/Realman78/Kiyeovo - I'm currently working towards the full release of my P2P dual-network mode messenger which is currently in beta. The reviews were overwhelmingly positive when I released the beta a week ago so that motivated me to try extra hard to make it pseudo-perfect upon full release

Recently I have been doing a modern Lotus Agenda clone as a native iOS app. I have been implementing a custom CRM using that platform.

Also, Arch Ascent, which is a tool for evolveing microservice-heavy architectures.

https://github.com/mikko-ahonen/arch-ascent/blob/main/doc/de...