[ / / / / / / / / / / / / / ] [ dir / random / 93 / biohzrd / hkacade / hkpnd / tct / utd / uy / yebalnia ]

/vqc/ - Virtual Quantum Computer

Name
Email
Subject
REC
STOP
Comment *
File
Password (Randomized for file and post deletion; you may also set your own.)
Archive
* = required field[▶Show post options & limits]
Confused? See the FAQ.
Embed
(replaces files and can be used instead)
Oekaki
Show oekaki applet
(replaces files and can be used instead)
Options

Allowed file types:jpg, jpeg, gif, png, webp,webm, mp4, mov, swf, pdf
Max filesize is16 MB.
Max image dimensions are15000 x15000.
You may upload5 per post.


File: 2fdb2eab99edf2f⋯.jpeg (136.21 KB,1920x1080,16:9,the end.jpeg)

446221 No.6415

Welcome to /vqc/. New people tend to have some trouble understanding what this board is about, so this thread serves as an explanation. The long and detailed version will follow in the replies to this post. Here’s a shortened version:

>early on during the beginning of Q in November of last year

>someone calling themselves VQC starts posting Q-style crumbs to the annoyance of most and the curiosity of others

>makes some interesting claims, such as Agartha being real

>starts posting code around the end of November, calling it a Virtual Quantum Computer (hence the name) with unlimited qubits

>says it can be used to prove that P=NP, to factorize semiprimes (which allows us to break RSA encryption), and overall to demonstrate new mathematic principles that have been hidden from the public by the elite

>suggests that making these mathematic principles public is an important part of the idea of the public having freedom, despite it meaning large changes to encryption being necessary

>the code uses two numbers, i and j, to calculate several variables

>i and j are implemented in a nested loop, which in simple terms means j starts at 0 and increases by 1 each time the variables are calculated until it is equal to i, at which point i, which also started at 0, increases by 1, and j starts at 0 again

>a = i-j, b = i+j, and the other variables are calculated from these

>in the context of factorizing semiprimes, the two variables a and b multiply together and give us c, and if a and b are prime numbers, c is a semiprime

>semiprimes are a key component of RSA encryption because of the fact that, with current factorization methods, it would take thousands of years to factorize 1024-bit semiprimes, making it seemingly unreasonable to crack

>the variables are put into a spreadsheet (which we call The End) with the variable e as the x axis and the variable n as the y axis

>several anons have been working together for the last 7 months to try to figure out how we can use the grid to factorize semiprimes

>VQC continues to post crumbs occasionally and guide us in the right direction

>if VQC told us explicitly how it all worked, it would defeat the purpose

>we are all very far down the track from the beginning in November now, so there is a lot of information that (a) new people will need to read through before they can get up to speed with the rest of us, and (b) that those of us who have been here the whole time or most of the time won’t always remember, and thus being forgetful might be keeping us from solving it

>according to VQC, we’re very, very close to figuring it out

>also according to VQC, there are infinite other possibilities in regards to what we can do with this grid once we’re ready

A more detailed explanation that would make this a one-stop place for anyone new is currently in progress. If there’s anything specific you would like to know, ask about it in the RSA general sticky. I’m keeping this thread locked so it can be specifically for the explanation and the congregation of all of our findings so far, so any suggestions can go in the meta thread, which is >>193 here.

____________________________
Disclaimer: this post and the subject matter and contents thereof - text, media, or otherwise - do not necessarily reflect the views of the 8kun administration.
Post last edited at

8846fd No.7171

Before I go into detail, here’s a brief summary of the point of this board (at least as it stands as I type this): we’re learning how to factor any arbitrarily-large number by calculation, rather than by iteration. We’re being led by an anonymous person who uses the name VQC. The relevant mathematics principles have allegedly been hidden from the public by the elite, and now, with Q being a thing, the time is right to make it all public. You can either believe this or not, but we’re all still going to be here doing this.

Disclaimer: this post and the subject matter and contents thereof - text, media, or otherwise - do not necessarily reflect the views of the 8kun administration.
Post last edited at

8846fd No.7172

File: c1b177a04adfa98⋯.jpeg (663.41 KB,1300x741,100:57,grid.jpeg)

VQC posted code that creates what he calls a “virtual quantum computer”. It generates a .csv file, which is a spreadsheet (so you can open it with Excel, LibreOffice Calc, etc). If you know anything about these programs, you’ll know that they’re made of cells, with an x axis and a y axis (if you don’t know anything about these programs, I suggest looking into those programs so you know what I’m talking about – the latter, LibreOffice Calc, is free, and there are other free programs). Each cell is the VQC-equivalent of what’s known as a qubit. I’ll explain what a qubit is later. The code calculates lots of different sets of numbers, and each set of numbers is put into one of these cells in the spreadsheet. The co-ordinates of each one depend on the value of the set’s e and n values. I’ll explain where e and n come from later too.

In order to create the grid, you’ll need to run some code. If you don’t know anything about code, I put together a guide to how to take programming gibberish and make it do the thing it’s meant to do >>4391 here or https://archive.is/DMFE7#selection-1399.0-1399.1 here. Rather than waste space copying all of that here, I’ll just link to it. So if you run the code, you should see something similar to the thing in this picture. Mine’s a bit different. I formatted the cells slightly differently. The same set of numbers will be in each cell.

Disclaimer: this post and the subject matter and contents thereof - text, media, or otherwise - do not necessarily reflect the views of the 8kun administration.
Post last edited at

8846fd No.7173

You can find the code, ported to several different languages, within the first few posts of each RSA general thread. If you can read code, you’ll see how the numbers are calculated. Each individual cell is created in a nested loop. A nested loop is a loop within a loop. In programming, these loops are blocks of code that get executed over and over again until certain criteria are met. Here’s a snippet of the code that shows the loop:

for (int i = 0; i < i_max; i++){

for (int j = 0; j < i; j++){

//more code goes here – this is what a comment looks like in programming

}

}

Everything between these {} is a block of code. The outermost parentheses are for the outer loop, and the innermost parentheses are the inner loop. The outer loop has a variable called i. The code that runs the loop is

for (int i = 0; i < i_max; i++){

What this means is that at the beginning of the loop, i is equal to 0, and that every time the code within the loop runs, and then finishes running, i increases by 1. It does this until i is equal to another variables called i_max.

i_max is arbitrary. You can make i_max anything you want; it could be 10, it could be 100, it could be 1000. It doesn’t matter. It’s a constraint you can decide, so it isn’t relevant to any of the calculations. If you make i_max 1000, the highest possible i value will be 999, because once i is equal to i_max, the loop will stop running. If you set it too high, the program will take years to run (the amount of time the program takes to run increases exponentially as the maximum i value increases), so I suggest keeping it the same value as it’s set when you copy the code.

The inner loop does pretty much the same thing. The only different is, it stops running once j is equal to i. The code in the middle of this inner loop runs over and over again until j is equal to i. If i is equal to 10, j will start at zero, the code will execute over and over again with j increasing by 1 each time, and the last time the loop executes will be when j is equal to 9. Once j equals 10, the loop will stop executing. Because this inner loop is inside the outer loop, once j is equal to i, the outer loop will run again, so i will increase by 1, j will be set to 0 again, and the inner loop will start running again. All of this will happen continually until i is equal to i_max.

Disclaimer: this post and the subject matter and contents thereof - text, media, or otherwise - do not necessarily reflect the views of the 8kun administration.
Post last edited at

8846fd No.7174

So here’s an example of the i and j values, for those of you who don’t understand.

i=0, j=0. j=i so the code doesn’t run

i=1, j=0, code runs

i=1, j=1, j=i so the code doesn’t run

i=2, j=0, code runs

i=2, j=1, code runs

i=2, j=2, j=i so the code doesn’t run

i=3, j=0, code runs

i=3, j=1, code runs

etc

Now, the code that runs inside the inner loop calculates each of the numbers we’re sticking in the grid. There are several variables we need to calculate, and they’re based on each pair of i and j values.

a=i-j

b=i+j

c=a*b

d=floor(sqrt(c))

e=c-dd

f=e-(2d+1)

n=((a+b)/2)-d

x=d-a

t = either (x+2)/2 if e is even or (x+1)/2 if e is odd

In the original version of the code, the variables were put into the grid in the format of {e:n:d:x:a:b}. t and f are used slightly differently to the other variables, which I’ll explain in a bit.

The most relevant part of this to what we’re currently doing is that c is the product of a and b, and in modern mathematics the only way to find the factors of a number is to iterate. This means going “Is 2 a factor? Is 3 a factor? Is 4 a factor?” etc, and in the case of large numbers, that can take thousands of years. The relationships between these other variables are meant to be used to calculate the factors, rather than iterate through numbers for a very long time. This is what we’re learning how to do.

Disclaimer: this post and the subject matter and contents thereof - text, media, or otherwise - do not necessarily reflect the views of the 8kun administration.
Post last edited at

8846fd No.7175

More coming soon

Disclaimer: this post and the subject matter and contents thereof - text, media, or otherwise - do not necessarily reflect the views of the 8kun administration.
Post last edited at

342e32 No.9046

There are a bunch of variables we can directly calculate and a bunch of variables we can't directly calculate. The idea is that we use the patterns we've learned and the variables and cells we can directly calculate and somehow end up with one of the variables we can't directly calculate. Nobody's figured out how to do that yet. Those patterns and cells are all in >>6506

Disclaimer: this post and the subject matter and contents thereof - text, media, or otherwise - do not necessarily reflect the views of the 8kun administration.



[Return][Go to top][Catalog][Nerve Center][Random][Post a Reply]
Delete Post [ ]
[]
[ / / / / / / / / / / / / / ] [ dir / random / 93 / biohzrd / hkacade / hkpnd / tct / utd / uy / yebalnia ]