Thanks AA.
I can verify once I'm at a desktop.
Now, quick reminder on triangular numbers and the construction of the grid.
Column 0.
The values of a[t] at 0,0 are twice the square numbers.
The values of d[t] at 0,0 are 4 multiples by the triangular numbers. All other cells at row 1 can be constructed from these values by adding to them or subtracting from them.
Tomorrow we will go through where the product of BigN and c are found in (e,1) and where the other value of c is in (e,1) and what information that gives us.
Then we will look at the key that is made by column -f with the locations of c in (-f,1) and how to find x for an and a(n-1).
Then we build the algorithm.
Then one of you anons can edit the Wikipedia page with the remaining RSA numbers and their new factors.
This was all done alone.
From scratch.
I realised that if I learned to build my own software for multiplying large numbers together and trying new views of number properties, I could see something where information was lost.
The first truly new idea came out of reading Revelation one afternoon in 2011.
The red text in the first chapter looked like description of odd (prime) numbers in binary, since "I" is the first and last number of all binary odd numbers.
I think binary is not new.
It looked like a coded algorithm using allegories to keep it secret.
The first version of the grid, looks very different, was in binary.
Sorry, yes, they are derived from 0,0 but are in 0,1.
Good catch.
A good reason to have checks and balances.
In the scheme of things, given the "coincidences", I think this was always meant for you guys.
Just appreciate being given the chance to share.
Thank you.