I've had this idea since 2009: converting the integer factorization problem into a visual geometric constraint puzzle (based on Lattice/Gelosia multiplication). The idea is to see if we can spot symmetry-breaking patterns in the 'carry' bits, or constraints on the remainders/quotients over some radix based on divisibility implications of already selected units in the tableaux. In other words, the kind of domain-specific things that "domain-blind" SAT solvers miss.

It features:

- Arbitrary Radix support (Base-2 to Base-Infinity)

- Entropy Heatmaps to see constraints propagating

- Miller-Rabin prime generation

- It runs entirely in the browser.

Just somethng fun to play with to give you a feel for the puzzle. Definitely could improve a lot more!