Kernogram Smashers

This: game does not work properly

A KERNOGRAM is supposed to be a compression moving two letters of a word in a specific font to a shorter word which CLEANLY with no extra material looks like a different shorter word, that is a real word with a meaning in the same language, and cleanly has no extra material left over IN the same font.

the Specification: steal my game and make it truly work for 600,000 words in the English language x 2,000 fonts.

Hoping some super PhD of both skills can nab this and make it true.

Meanwhile here's the (inadequate) beginnings.  The HTML zip file is available for free download.

But! I have officially raised the issue.

Props to eigenrobot on Twitch/X for telling me the term kernogram which apparently not a single search engine in the world on 2/16/2026 had ever even heard of the concept.

When I say doesn't work i mean it runs it doesnt crash BUT it lies to you it isn't cleanly building kernograms.

a LESSER GOAL which would be acceptable is someone curating by hand like thousands of kernograms (let's say 6,000) and getting a "reasonable enough game" that never plays the same twice but fully fools the human into thinking you found all these.  Operational enough that you'd never know the difference.

But enough in the lesser goal that there's 3 valid kernograms with no trash when it compresses, for EVERY font that you DO use and there's 2,000 fonts in it.

So it doesn't have to be full solved like Fermat's Last Theorem but a) you're the GOAT if you do b) if you hit the lesser goal you're still pretty damned good at this.