Sign into an existing account

The algorithm has been nailed down.
Branch elimination core has been corrected and the new model uses logical ANDs to select the branch with the lowest possible child node values based on a metric of entropy.

non-trivial branches have been reduced from e-1 to 0 per base 10 digit of a key.

Testing in progress.

edit:
Locked down problem runtime. O(1) space complexity. O(log10 n) time complexity. We're solid.
Still generalizing code.
13-17 hours of work left by my estimate, mostly battle testing and extending to the full range to run with the push of a button.