Get your RSA crack here
We are the mathematicians now
abcdefghijklmnopqrstuvwxyz
abcdefhijnqtux
The Solution Is The Iterations
Kek, boomers get triggered so easily
How many iterations are you supposed to solve in?
Natural logarithm of the bitlength of c?
Reread crumbs
https://archive.fo/XmD7P
What is that value for rsa2048?
log2(c) = 2047
loge(bitLength) = 7
7 iterations
e is the derivative of the grid
so it makes sense that the amount of steps is governed by a natural logarithm
We've always looked at what data is contained in the grid, but not very much on how to actually use it.
d, e is the input
the trivial element is the value we don't want
the non-trivial element is the value we want
how do we use all the surrounding elements, cells, rows and columns (the qubits) to perform the Fourier transform? Where does the grid perform the QFT? Somewhere foundational? (1,1)?
Imagine that the amount of elements you need to use to calculate the factors of an RSA-4096 bit number can be calculated by hand.