Good thread VA. Just copying and pasting some stuff from the last one.

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

VQC Triangle Number Methods —— https://pastebin.com/NCQ3HK2K

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

Static Java/C# class with all RSA numbers —— https://pastebin.com/XYFpsDWE

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

Videos on cryptography —— https://pastebin.com/9u3hwywe

>>6185

>What can be inferred from P!=NP?

That NP problems aren't solvable in polynomial time, you mean?

>Anything useful?

It would infer that our security algorithms are safe. If P!=NP was somehow proven, people would stop paying so much attention to NP problems, and we could all just go about our lives as they are now. Sounds boring to me.

>We also know that we will end up back at the grid.

Hopefully ISP's code here >>6178 works for that. I haven't tried it out yet myself.

>We also know we need to use input c of a reasonable size to show the pattern properly, again hints were given but too subtle.

Do you mean bigger than we're currently using?

>The solution to this problem introduces a new form of algebra where two concurrent forms of equations run side by side and then merge.

>Take some time to think about what that means.

>Have you seen this approach before?

Simultaneous equations and Fermat are the only ones I can think of.

>What could it look like?

I suppose what you're implying (and I remember you talking about this previously) is that two seemingly irrelevant equations end up equaling the same thing every time. The way you're wording it makes it seem like maybe you're not referring to c being the difference between two squares (x+n) and (d+n), but maybe you are and I'm just looking for crypticism where there isn't any. If you are being cryptic, that implies that we haven't quite gotten to this stage yet and that we'll figure out that one of the variables scales with another unrelated variable or something along those lines.

>Does it seem obvious in hindsight that in order to solve a multivariate equation, that something new but similar to what we have always done, would be the solution? Just taken in a new direction? Expanded thinking.

Well, yeah, I suppose. If every variable was completely independent of one another, you'd have to use several simultaneous equations to look into how the variables scale with one another and how they each change when one increases and the others stay the same etc. If there was something inherently linking every variable that we weren't already aware of that would allow us to solve it with one equation, firstly it doesn't sound like it would make any sense, but secondly it would obviously make things far easier.

>Take some time to think what this will look like and how the diagrams (especially animated) might show this.

I would think it would be this kind of thing >>6178 which I'm glad someone put together (thanks for the hard work Isee, and apologies for the complaining, anons, but I didn't think anyone was paying attention to that one VQC post I was bumping since nobody was replying).