>>3361

>>3564

>https://archive.fo/RgVko (RSA#1)

VQC:

Anonymous 12/05/17 (Tue) 09:34:37 ID: ecb64b No.36154

I'll work through RSA100. If you're using C# the BigInteger namespace is handy.

c = 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139

d = 39020571855401265512289573339484371018905006900194

e = 61218444075812733697456051513875809617598014768503

n = 14387588531011964456730684619177102985211280936

x = 1045343918457591589480700584038743164339470261995

a = 37975227936943673922808872755445627854565536638199

b = 40094690950920881030683735292761468389214899724061

In the element at (Rsa100e,1) you find that the element where x = Rsa100x, you will find a = Rsa100n x Rsa100a

If you find a that is Rsa100n elements further down, then that a will equal Rsa100n x Rsa100b

Then at grid cell (Rsa100e, Rsa100n) which is obviously in the same column, you'll find the product c.

In summary, the factors in any cell in the first row govern ALL the behaviour in the column below in a pattern or, if you perfer, in MANY patterns.

A member of Pink Floyd said in an interview during a documentary on MUSIC PRODUCTION that the GAPS are absolutely as important as where there are NO gaps.

Let the VQC take the strain. The more you c it's beauty, the more it will give you (back).

You all amaze me.

Can't find the crumb, but VQC mentioned we can take a prime of our CHOOSING. The crumb you pulled is an example of this, using 5.

>>3579

What changes? Is there a branch in the binary tree? Does the growth pattern remain the same?

>>3580

Oh, hello VQC! Wow, that is a lot to digest, but makes perfect sense. Please provide a moment for the 'in due course' bit to hit. Feels YUUGE. Much gratitude.

>New inputs! factorise d and e!

Excellent, was digging into the d-primes. Hadn't thought about the e-primes. ok!!

Question please? With the Einstein crumb.(and 2 c's), was going down the path of Eisenstein and Conway and Gaussian and Eisenstein integers. Wrong turn for Part 1?

>>3589

Disinfo is necessary and used.

anon thinks can at times be related to requirement for plausible deniability.

>>3592

please drop a screencap of that!

>>3597

Good to see you Teach!

Exactly! Been picturing this, including ordering of the factors.

When we look up at the tree, we see primes. If there is something behind, obstructed, then what we are seeing can factor that integer.

>>3594

Nice. Thanks.

>>3597

>>3598

Wasn't quite picturing everything you put down, that was helpful. Good notation.

>>3602

Keep going anon!!

Was looking at your 'screencap', >>3594

playing a bit in Wolfram Alpha. Then you drop this.

What a big week.

etetoolkit.org

Title:ETE Toolkit - Analysis and Visualization of (phylogenetic) trees

Description：The ETE toolkits is Python library that assists in the analysis, manipulation and visualization of (phylogenetic) trees.

>>3601

>I was wondering the same thing. Chris did say you could pre-factorize by dividing by 2 until odd. Then you take d and e and repeat until those branches terminate in a factor.

That recursive part is starting to make sense, using the power of the VQC (on d and e).