Hello Lads! I'm reviewing crumbs looking for traction. We haven't figured out yet how 2d and f limit the possible (n-1) values. Based on VQC's instructions in the attached pic, we split off one (n-1) value in the x+n square formula. The formula looks like this after being modified:

nn+(2d-1)(n-1)+f+(n-1)-1

I was just thinking about a new way to examine the mods.

Let’s take familiar c values, and break them down in two ways:

Method 1: Using the (f-1)div 8 method, showing all mods as well.

Then let’s have columns with 2d-1 and f for that c.

Method 2:

Then let’s have columns breaking down each part of nn+(2d-1)+f-1 into div 8 and mod 8.

Goal is to find the connection between 2d, f, and the n or (n-1) values that give a correct lock for the x+n square. We need to see how EVERY piece contributes to completing the x+n square.

To make it work, I think we need medium/large c values, like in the millions range.