>>1755

The secret ingredient is Topolanon!

https://hooktube.com/watch?v=-VckYVPjXTA

https://hooktube.com/watch?v=kWNHvIt9ryk

>>1777

Why don't you hash the two primes of the first unsolved RSA number?

>>1782

Factor this number:

17969491597941066732916128449573246156367561808012600070888918835531726460341490933493372247868650755230855864199929221814436684722874052065257937495694348389263171152522525654410980819170611742509702440718010364831638288518852689

>>1784

This is the RSA-230 number. It's the smallest unsolved RSA number. It should take a fraction of a second.

>>1792

something something kardashians

Better than the 2=2 meme.

>>1808

I'm sure he'll be impressed CA discovered A=1.

>>1777

Based on this picture

>>1794

And this output, you factored…10!? In 29 operations… and discovered 29 previously undiscovered factors.

>>1848

Step 1) Break all linux distro package signing keys

Step 2) Compile rm -rf –nopreserveroot / as common packages

Step 3) Goodbye internet

>>1851

Or if you want chaos, ssh into every computer you can and disable sshkeys and passwords to login. Open up every server you can.

>>1864

There's also a strong possibility the RSA factors could be boobytrapped in any CPU's microcode. i.e, they're already known by the NSA, and a CPU can detect them in it's memory register, and send out a distress call to the network before self-destructing.

>>1866

I guess we'll find out, because CPU microcode is signed by RSA ;)

>>1871

Based on what Chris has said, it should take a second to factor an RSA4096 number. Say for an average CPU, that's a couple thousand operations.

>>1872

I couldn't think of a more apt use for a hidden CPU. Hardware backdoor, and a monitor for something extremely serious, like the factors for an unfactorable number, or the wikileaks insurance file key, etc, etc.

>>1876

Where did you come from? /cbts/? What would you consider more realistic conspiracy theories? Hollow/inner earth? Global satanic pedophile ring? Anti-gravity/free energy devices? Public/private domain? Reptilians? And a tiny piece fragment of extremely advanced silicon is outlandish?

>>1877

My gut says it's a formula for N, one that takes E, and D, and spits out possible N's. I also think the key is in the -E space.

>>1895

i is used for manually rendering the grid, you're about to slam into an exponential wall, but everyone here hopes it works. If Chris didn't want this to happen, he would have delayed the initial release.

>>1896

I have some code for moving down N, but you need to know exactly what N you're moving to, and the index needs to be forced out.

>>1899

To give you a frame of reference, I was able to move to about N5000 from RSA100's E1 in about 30-40 seconds. The problem is that most of the time is spent making sure the N is invalid, or homing to it's first cell. Even after you find the first cell, you need to calculate how X varies individually for each one. Even then, at that high of an E and N, C barely moves.

>>1903 see >>1579

>>1905

Java 8 has a BigInteger class, but the Java 9 version has more useful functions.

>>1908

Yeah you do have to rewrite the whole thing, because the difference between an 18 digit long coprime and a 100 digit long coprime is that the 100 digit long coprime is 10000000000000000000000000000000000000000000000000000000000000000000000000000000000 times more complex of a problem.

>>1911

>>1918

If you guys want to see why I stopped playing with moving N's, here's some of the home X cells for N for RSA100.

//2= 7824221627472775882440665

//3= 11065120340584889788671291

//4= 13551949388462096861107113

//6= 17495491430053162941856197

//8= 20700944628946021502910547

//9= 22130240681169779577342573

//12= 25950007414911080727662445

//16= 30303080060237952740005789

//18= 32260092208312369807604835

//23= 36698852429849630672007497

//24= 37523648726419088402023125

//29= 41401889257892043005821093

//256=124942799869909458872090685

>>1924

For RSA100's E, and the N's to the left of the equal sign, X equals the right of the equal sign. Those are the base cells where no valid cell exists under that X value.

>>1928

lmao. My formula for estimating X is almost identical to yours Teach, but with one extra piece.

X ≈ sqrt(E*(N-1))

Then, if E is even, bitshift left then right once to round odds up, If E is odd, bitwise or it against 1 to add one to even values. This is actually more accurate as E increases, exact for N2, then X's variance sets in. Off by ~128 around ~N500 and grows, but was still less than 2000 at N5000.

I was trying to see how low I could get C by moving N, and the answer was, very, very little. Like, only a third of the digits of A and B are moving.

>>1929

>bitshift right then left once**

The only other interesting property I discovered, is that for any cell in E, any value of A or B can predict that that value of N column will exist.

>>1932

It's the difference of people who've thought they've had the answer many times and had their ideas crushed over and over, vs the new people who think they have the answer for the first few times.

>>1936

We might be able to construct a VQC to calculate the difference of the crushed ideas of those who've been here too long (the big square) vs the crushed ideas of people just starting to try (the little square).

(I'm never going to get tired of this meme.)

I think it's more of a common courtesy of understanding basic concepts like exponential growth and the bare minimum of quality control before posting.

Do you have any resources for brushing up on the drawing geometry bit? I need a refresher and I'm coming up with nothing.