The only thing you need to do to solve this is to organize.
Enumerate EVERY rule.
Global rules.
Row rules.
Column rules.
They are a finite set and RELATED.
This is your MAP.
You will be able to use the MAP to find n from c.
Enumerate the rules.
Win.
Code
C#
BigInteger Square Root —— https://pastebin.com/rz1SdACZ
Generate Bitmap within original code —— https://pastebin.com/hMTtJF6E
Generate the large square for e and t —— https://pastebin.com/nbjs2kz4
How to run VQC code on Linux —— https://pastebin.com/6HnN7K5X
More on generating a bitmap with the original code —— https://pastebin.com/JUdtehb4
PMA's tree generator —— https://pastebin.com/ZH9fSWu2
Original VQC code —— https://pastebin.com/XFtcAcrz
Unity Script —— https://pastebin.com/QgAXLQj3
Unity Script 2 —— https://pastebin.com/Y38nVWgT
Java
Traverse the VQC cells in real-time —— https://anonfile.com/TeH6q3d8bd/VQCGUI_v2.7z
Tree Generator —— https://pastebin.com/VZnQQR2i
Tree Generator w/ x & x+n search —— https://pastebin.com/0jPr3RrE
VQCGenerator —— https://pastebin.com/VMRnkXFP
VQCGenerator w/ Bitmap —— https://pastebin.com/Dgu9aP1h
NodeJS
BigInteger Library and Sqrt —— https://pastebin.com/y8AXtFFr
Python
3D VQC —— https://pastebin.com/vdf8SpYt
3D VQC (v2) —— https://pastebin.com/wZM5Thzu
Calculate variables based on e and t —— https://pastebin.com/4s6McdbN
College Anon's code —— https://pastebin.com/d8xZZnm0
Create the VQC —— https://pastebin.com/NZkjtnZL
Fractal cryptography —— https://pastebin.com/XuN4U7Dv
Generate any cell in (0,1) and (0,2) —— https://pastebin.com/gRTYpdMU
Generate cells for a (and more) —— https://pastebin.com/iAizgLFF
Generate genesis cell —— https://pastebin.com/GKzcCpMF
Generate positive AND negative genesis cells —— https://pastebin.com/9ixjRyxt
Get A and B from C and N example —— https://pastebin.com/s0SZ9BNF
VQC + t —— https://pastebin.com/Lgufk0db
RSA & PGP key wrapper —— https://pastebin.com/vNqnPRJR
Rust
Additional VQC code —— https://play.rust-lang.org/?gist=50def916ad48400bc5d638fbf119ae85&version=stable
Check if a number is prime —— https://huonw.github.io/primal/primal/fn.is_prime.html
Create Bitmap using the VQC Generator —— https://play.rust-lang.org/?gist=c2446efeec452fe14e1ddd0d237f4173&version=stable
Create Bitmap using the VQC Generator [V2] —— https://pastebin.com/zGSusyz5
Generate the VQC —— https://play.rust-lang.org/?gist=6b6beb372b6b931f1abd30642a35a80c&version=stable
Factorization methods (Java)
Binary search for i —— https://pastebin.com/TAt5bDsR
GCDFactor —— https://pastebin.com/70GJSMrv
Count down from t of 1c element —— https://pastebin.com/xxYa946V
Mirrors 1c until e=(-x+n^2) —— https://pastebin.com/WJBqPM4P
Calculate factors using -x jumps —— https://pastebin.com/gKX9GW9r
Previous Threads
RSA #0 —— https://archive.fo/XmD7P
RSA #1 —— https://archive.fo/RgVko
RSA #2 —— https://archive.fo/fyzAu
RSA #3 —— https://archive.fo/uEgOb
RSA #4 —— https://archive.fo/eihrQ
RSA #5 —— https://archive.fo/Lr9fP
RSA #6 —— https://archive.fo/ykKYN
RSA #7 —— https://archive.fo/v3aKD
RSA #8 —— https://archive.fo/geYFp
Videos on cryptography —— https://pastebin.com/9u3hwywe
I cut my VQC map into 3 pictures to make it easier to render.
Also, Chris said the pic that looks like 3 right triangles in >>4142 shows the fractal-like nature of the VQC. From left to right, it shows every cell where e is even, every cell where e is odd, and both pictures overlaid.
He said this to me but trust me, he means it to all of us who've kept faith through these past few months. It's going to be probably one of the best days of my life seeing all our research bear fruit.
I'm seeing God's judgement in the future. Newly released Strzok-Page texts corrobate Q saying that the FBI'mWithHer had a plan to KILL the President.
Link to ALL NEW Strzok-Page texts:
http://www.hsgac.senate.gov/download/appendix-c_-documents
Under what conditions?
Q said they say a prayer for him every day in the oval office.
Not all numbers are a difference of squares.
Sorry. So, I think it doesn't seem to hold in some instances because it is for semiprimes.
If you combine this and the fact that both n's for a number have the same parity you also know the parity of x.
For example, if we know x+n is even, and we know n is odd, therefore x must be odd to sum together to make an even number. This is true for 145.
12 = x+n, even
5 = n
7 = x
5 + 7 = 12, odd + odd = even
This is a work of art. Here's a clearer explanation of the 1*8T crumb. It ONLY applies to odd squares.
1^2 = 8*T(0) + 1
3^2 = 8*T(1) + 1
5^2 = 8*T(2) + 1
7^2 = 8*T(3) + 1
9^2 = 8*T(4) + 1
11^2 = 8*T(5) + 1
13^2 = 8*T(6) + 1
VQC specifically said 8 triangles because of that picture you drew.
Though I don't think it's useful yet, here's proof you can know the parities of x, n, and x+n (and thus (x+n)^2 because of a theorem that says all whole integers share parity with their squares)
The parity was calculated pre-factorisation just from some boolean logic.
Chris told me that the tree solution finds x+n or x. If we know x+n is odd and are to construct x+n from triangles, then that must mean if we know x+n is even we are to construct x.
People complained that this didn't work because it has an error on values 0 to 5. I fixed it by just adding some checks.
(Java) (Fixed a dependency)
Works fine for every number I've ever tested.
public static BigInteger sqrt(BigInteger i) { BigInteger zero = BigInteger.ZERO; BigInteger one = BigInteger.ONE; BigInteger two = BigInteger.valueOf(2); BigInteger n = zero; BigInteger p = zero; if (i.equals(zero)) { return zero; } else if (i.equals(one)) { return one; } else if (i.equals(two)) { return one; } else if (i.equals(BigInteger.valueOf(3))) { return one; } else if (i.equals(BigInteger.valueOf(4))) { return two; } else if (i.equals(BigInteger.valueOf(5))) { return two; } BigInteger high = i.shiftRight(1); BigInteger low = zero; //high low + 1 while (high.compareTo(low.add(one)) 1) { //n = (high + low) >> 1; n = (high.add(low)).shiftRight(1); p = n.multiply(n); int result = i.compareTo(p); if (result -1) { high = n; } else if (result == 1) { low = n; } else { break; } } if (i.equals(p)) { return n; } else { return low; } }
Perfect choice of words. There are no coincedences, only relevant & irrelevant patterns.
This thread blew up. ISad that I have to be busy now. Hopefully will have time for soon.
Top kek
That's a great list, PMA. And it's very readable :)
Aren't rsa617 and rsa2048 the same one though? rsa2048 has 617 digits.
This is great. Thanks for coming back and helping.
Funny that you'd say that. They say there have been 4 great awakenings.
If you'd enjoy downloading >150gb of math
You're doing a great job Veritas. That was a hell of a lot of numbers you crunched. Still haven't programmed any tests for these new developments yet, because 3D space caught up to me. That's what helped me understand the most. Coding programs that try to get to the factorization of a number using every bit of new research.
I'm loving the swastikas
I'm trying to get back in the game here. The picture shows a test for rsa100 w/ Chris' methods working as advertised. I'll create a new picture of his hints in the morning.
He quietly mentioned a way to attack hashing algorithms. Email works fine by the way. Just give the new bunker to people who've made it obvious they're who they say they are.
What if the tree shows a multiple of n0?
Something that I completely didn't notice when I calculated the inverse triangle function is that it involves calculating the odd square, just like in VQC's methods
public static BigInteger TM1(BigInteger T) { return sqrt(eight.multiply(T).add(one)).subtract(one).divide(two); }