BigInteger sqrt_f = Lib.Sqrt(Lib.Abs(minus_f));
BigInteger sqrt_e = Lib.Sqrt(e);
//Section: determine rows (-f,n-1) and (e,n)
//using the diagonal to find pairs that are one row apart
//Build the tree recursively
Looks like at least two parties have solved this and one has extended to elliptic curves.
Watch crypto currencies. Mining, exchanges and embedding/retrieving messages…
Unsealing(s) coming.
The ReVeal.
The End is near for me, friends.
Look after each other anons.
God wins.
L(o)VE is on the inside.