/vqc/ - Virtual Quantum Computer

I'm the person who has been working on making a really simple explanation of everything. I've been attempting to cover everything anyone who wildly stumbles upon this might not know (so for example how RSA works, what big O notation means, what a nested loop is, as well as obviously explaining the grid and the whole point of all of this). Here's most of what I've done so far. I haven't had a lot of free time so I thought the most useful use of my time would be working on that "map" that VQC suggested we make. Obviously anyone is welcome to either suggest that this is complete shit or make changes or point out anything incorrect or work on their own version or anything like that. This work isn't about the individuals. It's about the result we get by working together. That's why if we can all get on the same level in terms of understanding, things might get done more quickly.

I knew this would make a swastika eventually.

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.

RSA General

Crumbs to focus on

In the (e,1) solution, d[t] = na+x

and a[t] = na

Therefore, if you can find the t value of this element, you can factor all semiprimes.

>Which column has NO gaps? [0]

>What is the pattern in COLUMN ZERO?

>One Row to Rule them All.

>A column that contains ALL and is the KEY to ALL the patterns.

>What are the patterns in COLUMN ZERO?

>If c is a semiprime, how many times does its square (c^2) appear in column zero? [5]

Why are there gaps?

The reason for the gaps may be because the VQC does not include decimal numbers. That is, because cells with gaps are the cells where the midpoint of a and b would not be a whole number. Or, worded another way, the difference between a and b would be an odd number.

There is a repeating pattern of gaps as you move horizontally from (0, n) to the right.

The pattern of gaps repeats every 2n if n is even.

The pattern of gaps repeats every n if n is odd.

>If first appearance of factor p is element t, second appearance will be at (p+1-t)

>p will be a factor of a in elements: t+p, t+2p, t+3p,…

as well as in elements:

>p+1-t, 2p+1-t, 3p+1-t,…

take d from all values of d[t] at (e,1) and there is a known pattern of (n-1) as factor in these values of d[t]-d that is different (increasingly) from the pattern of factors of n in aPost too long. Click here to view the full text.

Virtual Quantum Computer

Definition

The virtual quantum computer (VQC) is a grid made of infinite yet constructable sets that follow a known pattern. Like a quantum spreadsheet.

The grid is the superposition. The collapse of that superposition will be two input parameters, d and e which can be calculated easily for all integers, c, where c is the difference of two squares. Its purpose and our goal is to be able to factorize large semiprimes, all the way into the hundreds of digits, which would break the RSA cryptosystem.

When the integers that are the difference of two squares are arranged into the grid and their corresponding properties are shown, a pattern emerges that shows calculation instead of searching is possible.

Variables

The map's legend is {e:n:d:x:a:b}, where d is the result of removing the largest square from c AKA the square root,

e is the remainder,

n is what you add to d to be exactly halfway between a and b,

and x is what you add to a to make d.

c is any number that is the difference of two squares, so odd numbers are included. It is the number you want to factor.

f is what you add to c to make a square.

t is the third coordinate in the VQC..

Rules

Each cell of the grid (e,n) has infinite elements or ZERO elements.

Each cell with one value has infinite elements, since every element can make a new one.

By induction, a cell only needs one value to make infinite values, that's part of the power of this and is why it is a virtual quantum computer as a whole.

The t variable is what will allow you to walk across these infinite elements.

If a grid cell has elements, all elements are constructable from a finite set of root elements.

Post too long. Click here to view the full text.

Howdy Pathgawds!

Along my musics, I found a someone who's working on a very similar thing from a different approach, but it's all related and nothing is coincidence.

That being said, he's a bit of a newfag, so to spare everyone his getting his own report thread, I'm just setting this up so that the RSA stays RSA and y'all can look into this if it piques your interest.

Dnimeerf, the floor is yours.

Our task is simple. We are going to completely break the entire RSA cryptosystem! We're bigshots now.

But wait, how are we going to just crack RSA? With the Virtual Quantum Computer! Quick rundown to follow.

The main mathematical task that must be achieved to break RSA is to be able to factorize any integer instantly. The VQC is a promising way to do that.

What is the VQC?

The virtual quantum computer (VQC) is a grid made of infinite yet constructable sets that follow a known pattern. Like a quantum spreadsheet.

The grid is the superposition. The collapse of that superposition will be two input parameters, d and e which can be calculated easily for all integers, c, where c is the difference of two squares.

So, when the integers that are the difference of two squares are arranged into the grid and their corresponding properties are shown, a pattern emerges that shows calculation instead of searching is possible.

Legend

The map's legend is {e:n:d:x:a:b}, where d is the result of removing the largest square from c AKA the square root,

e is the remainder,

n is what you add to d to be exactly halfway between a and b,

and x is what you add to a to make d.

c is any number that is the difference of two squares, so odd numbers are included.

n*a and n*b for any c can be found n places apart in the cell at (e,1).

Rules of the grid: global rules

Each cell of the grid (e,n) has infinite elements or ZERO elements.

Each cell with one value has infinite elements, since every element can make a new one.

By induction, a cell only needs one value to make infinite values, that's part of the power of this and is why it is a virtual quantum computer as a whole.

The t Post too long. Click here to view the full text.

Our task is simple. We are going to completely break the entire RSA cryptosystem!

And how are we going to do that?! With the VQC! Quick rundown to follow.

The main mathematical task that must be achieved to break RSA is to be able to factorize any integer instantly. The VQC is a promising way to do that.

What is the VQC?

The virtual quantum computer (VQC) is a grid made of infinite yet constructable sets that follow a known pattern. Like a quantum spreadsheet.

The grid is the superposition. The collapse of that superposition will be two input parameters, d and e which can be calculated easily for all integers, c, where c is the difference of two squares.

When the integers that are the difference of two squares are arranged into the grid and their corresponding properties are shown, a pattern emerges that shows calculation instead of searching is possible.

Legend

The map's legend is {e:n:d:x:a:b}, where d is the result of removing the largest square from c AKA the square root,

e is the remainder,

n is what you add to d to be exactly halfway between a and b,

and x is what you add to a to make d.

c is any number that is the difference of two squares, so odd numbers are included.

n*a and n*b for any c can be found n places apart in the cell at (e,1).

Rules of the grid: global rules

Each cell of the grid (e,n) has infinite elements or ZERO elements.

Each cell with one value has infinite elements, since every element can make a new one.

By induction, a cell only needs one value to make infinite values, that's part of the power of this and is why it is a virtual quantum computer as a whole.

The t variable is what will allow you to walk across these infinite elements.

General RSA thread. The next thread will have a properly formatted OP.

Rules:

1. No spam

2. Try to keep posts on topic. I'm not going to be a dick and ban everyone for dumb shit, but if you start a thread about shotacon or something, you're getting banned.

thebuttonnexttocapslocktwice@protonmail.com if it's ever necessary