Equational

2025 Update:  Wikipedia now states: The BIGMIN problem has first been stated and its solution shown in Tropf and Herzog.[10] For the history after the puplication see [11].  What is below seems to be a variant of BIGMIN, with the advantage of running in log bit length. The original BIGMIN is proportional to the bit length. Many years ago, while doing my thesis, I played a bit with z-order / Morton coding (see   https://en.wikipedia.org/wiki/Z-order_curve ). Therefore I share here a little snippet of code from ~1995, that I happened to fall upon while cleaning up an old laptop. I have not noted that the equivalent logic has already been shared, therefore I took an hour to write it up in Python ( Jupyter notebook style uploaded here ). I would be curious to know if it can be found elsewhere. First a bit of historical context. My first job (before my PhD) had me writing a Design Rule Checker (DRC) for the world's first analog CAD tool, developed at the CSEM   https...