For all a[t] in (e,1)

If p is a factor in a[t] then there exists (e,p)

For a c at (e,n), there exists (-f, n-1)

The difference between e and -f is 2d+1, making columns e and -f unique as a pair to c.

The position of column 0 acts as a key with these two unique columns to fufill an equivalent role of the quantum Fourier transform in Shors algorithm.

In essence, the grid acts a lookup for integer factorisation and turns the sub exponential big oh search into a log t calculation where t is the length of c in bits.