/vqc/ - Virtual Quantum Computer

Someone threw this at me on the boards…

(e,n) : (4,1) : a[t] where t = 2,3,4

>>5068

More context?

Did you do the translation, or was that how thrown @u?

Did they mention a 34 or 52?

>>5068

(4,1,2) = {4:1:6:2:4:10} = 40

(4,1,3) = {4:1:14:4:10:20} = 200

(4,1,4) = {4:1:26:6:20:34} = 680

DJT

re: >>>/qresearch/568681

>>5071

ty. And context for this, posted by same user:

>>>/qresearch/568733

Hope he is ok!?

See you guessed:

>>>/qresearch/568750

thought the same reading:

>>>/qresearch/568702

>Hmmm, is the pope a believer in hollow earth theory?

>Nice find anon.

..and ya pissed the BV off:

>>>/qresearch/568644

(left trip on few posts)

>>>/qresearch/568803

>>5074

ty!

>>5077

>>5078

ftfy.

>>5078

Oh, did I switch over and it loaded into thingy?

My B. I try to be conscious off that…

It's why I derp and post as Anon over here every now and then.

Tell BV he has my sincerest apologies.

Also… >>>/qresearch/568733…

I… hmm…. missed something the first time…

Wife and son?

My whole life I didn't smoke, and it was all for naught, because the BV gave me cancer anyways.

https://archive.fo/W0nZE

Tons of VQC references in this thread. Was it you guys?

>>5080

>>5081

>BV

Now what's that stand for?

>>5084

I'm not VQC.

>>5089

I didn't link to anything.

Pump Hardbass and drink some Kvass Komrade, you're not drunk enough.

Unit Triangle.

Not sure if anyone noticed, but Q has been talking about The End recently.

Also, recent Q post linked (a few steps removed) to a Haiti photographer in bed with Comcast who had been working on blockchain debt products.

Hrm. Also, where is VQC twitter, he seems to have been disappeared?

Been away from VQC board for a while. What'd I miss?

>>5093

Who dat be? Q is talking about The End? Sauce? Block chain and all encryption will suffer a loss of confidence when we solve this math challenge. VQC twatter has been down since last week, part of the purge. You missed a bunch of cool ideas and shitposting. Same thing you'd miss on any other board. Welcome back, Anon!

wow, just caught up. incredibly sad if true.

>>5093

IIRC Q mentioned The End before VQC.

>>5093

>>5094

>>5096

I know, but it's been a while and its frequency increased in span.

>>568863

https://wikileaks.org/clinton-emails/emailid/3672

Who are we taught to trust the most?

This will not be easy.

The END.

Q

https://8ch. net/qresearch/res/568699.html#568863

Is the stage set for a drop of HRC +++ + +++++(raw vid 5:5). EX-rvid5774.

We have it all.

Re_read re: stage.

The nail in many coffins [liberal undo].

[Impossible to defend].

[Toxic to those connected].

WE must work TOGETHER.

WE are only as strong as your VOICE.

YOU must organize and BE HEARD.

THIS is why they keep you DIVIDED and in the DARK.

WEAK.

We are here to UNITE and provide TRUTH.

Dark to LIGHT.

EVIL surrounds us.

WE are FIGHTING for you.

Where we go one, we go ALL.

The choice, to KNOW, will be yours [end].

Q

https://8ch. net/qresearch/res/563179.html#563806

Working through n0 and this piece:

>>4426

>>The objective is to find a base larger than n and smaller than x+n at this stage.

>So 5 is a "base". The objective I think is analogous to Newton's method; you need an initial guess to get the process started. The process will transform our initial guess to be n < HERE < x + n

>>5098

3D Anon in the house! It's fun to start a new thread and see all your favs checking in. Red 5 standing by. I agree with your n0 idea of an initial guess. Let's have fun and get to work!

>>5100

Also I didn't post it in that thread, somebody else did

>>5101

Thanks for the explanation. This is kind of over my head but maybe I can program something to work with it.

>>5103

The theorem for calculating the terms out is this:

let N(t) be the numerator of the tth fraction. Guess what D(t) is. This is for [a0,a1,a2,…]

N(0) = a0

N(1) = a0*a1 + 1

D(0) = 1

D(1) = a1

Then, N(t) = at*N(t-1) + N(t-2), and D(t) = at*D(t-1) + D(t-2).

These formulae make it easy to see how [1,1,1,1,..] is fibonacci. This could be easier to program cuz you can cache the stuff

>>5104

Also basically the higher your t value, the more precise a fraction you will get to approximate the true value of the continued fraction. N(0)/D(0) will be a shit approximation, but N(100)/D(100) will be pretty damn close to the number you want.

Hate to be a fag but was the “have succumbed to alcohol, can’t handle my son’s death, see you on the other side - vqc” /qresearch/ post shown to be false in any way?

I hope so, obviously, but I haven’t noted any VQC posts here since.

>>5107

When was that?

>>5107

Apparently he's not drinking…

Though this iiiiiiis the second time drinking has come up. Is Mr. E Melange at it again?

Was he right the first time?

>>5108

Lemme try to dig it up. I thought it was an expertly-crafted shill/troll sce it was around the time of the Revelations post from VQC.

Plus, it had no trip and was signed lowercase vqc. If VQC is around, he could clear this up quickly…….

>>5110

But who would know that about him? He told me about that stuff in DM which I didn't release.

>>5109

When it happened I almost posted it here but, honestly, PMA was kicking so much ass and it seemed like such a predictable shill tactic that I didn’t out of shill propagation caution. However, now that a number of weeks have elapsed, I’m more concerned.

>>5111

Two thoughts: (1) there was a guy on /qresearch/ that reported being threatened around the same time, (2) you may not have been the only DM or private comm.

I think I speak for us all, we definitely trust you.

>>5109

>>5113

Yes, I recall the threatening post back then.

Also the suicide exchange that Topo references.

I believe VQC was in todays thread referenced earlier >>5082 and also the following one.

Took these 2 posts to be VQC, 2 different threads:

>>>/qresearch/568733

>>>/qresearch/568803

The first is ODD. Seems a compartmentalization of personality, or perhaps it's multiple individuals working together.

>>5113

Well, I'm not gonna believe that shit. Chris is fine, and he disappears periodically as we all know. He beat alcohol with nothing to return to, and now he has us and an amazing truth to reveal. He has no reason to do any of that.

Fake.

>>5115

Well… that's the thing.

CHRIS is fine.

But mayhaps a something happened to NOT Chris…

>>5114

I mean… I been tellin' y'all that the VQC handle/mantle gets passed around…

And… y'all noticed who they're responding to, right?

>>5082

Read through all that and it sounds like someone Is "driving" him. Idk. Something is off. Not sure what but something.

>>5117

I couldn't figure it out topol though I tried. What do you think?

>>>5114

>qresearch posts you posted!!!

>I remember the topo posts because back then I was insisting he be banned (sorry bro)

What the absolute fuck is going on?

VQC please post with trip and verify, even if it is the worst, we can handle it.

>>5115

Hey, I really, really, really hope so. I hope this is fake with every fiber of my being. Hopefully we’ll all laugh about this in the future.

>>5121

I believe so.

To clear the air, the "threatening post" was this (at bottom). Including prior posts for context, same ID, same thread:

on 2018.01.02

https://8ch.net/cbts/res/228142.html - #270

▶Anonymous 01/02/18 (Tue) 09:47:46 153378 No.228325>>228412

I wondered when this card would be played.

North Korea is going for the 'nuclear option'.

"Threatening to release classified information on the Moon landings."

What other NASA secrets is NK threatening?

▶Anonymous 01/02/18 (Tue) 09:49:41 224158 No.228335>>228353

>>228321

Who controls the gold??

Peter Munk

▶Anonymous 01/02/18 (Tue) 09:54:01 153378 No.228353

>>228335

Controlled

▶Anonymous 01/02/18 (Tue) 10:10:24 153378 No.228445>>228450 >>228459 >>228461 >>228463 >>228491

>>228412

It's not the first time.

KYU's dad did it previously and every time the US backed off.

Google for the sauce.

Site has decent info and disinfo.

Choose wisely.

Do you think NASA has things to hide?

Why no unshopped pictures of the North Pole.

Let's not pretend there is nothing in that.

Let's not assume what is or isn't there.

All roads lead to the revelation about the poles, what (all) the pyramids really are, what is in Kentucky, Tibet, etc.

Critical thinking.

Why are satellite pictures of the North Pole above 40,000ft classified?

Why on Earth would this be?

It is DEFINITELY connected.

▶Anonymous 01/02/18 (Tue) 10:14:26 153378 No.228471>>228478 >>228484 >>228562

>>228450

Kek

When all this is done, the reality is pretty special.

Critical thinking.

No one needs to leap to Hollow Earth.

Just post a single unshopped image of the North Pole from 40,000ft or above (satellite preferred) and I will never come back.

▶Anonymous 01/02/18 (Tue) 10:17:31 153378 No.228487>>228492 >>228497

>>228461

I've been here every single day.

Sometimes you recognise me, sometimes you don't.

We're on the same side.

We all want the Cabal locked up or executed.

Some of us want the Revelation.

Personally, I'm just about done waiting.

Fortunately, this wait is almost over.

It's about Time.

▶Anonymous 01/02/18 (Tue) 10:18:57 153378 No.228493

>>228463

I will leave (well, I'll not post) for good if you show me a single unadulterated photo (preferably satellite) image of the North Pole from 40,000ft or above.

▶Anonymous 01/02/18 (Tue) 10:19:47 153378 No.228498>>228511

>>228484

What did I lie about?

▶Anonymous 01/02/18 (Tue) 10:21:20 153378 No.228509

>>228501

Expand your thinking.

It's all connected.

The 40,000ft that is classified.

THAT is what it has to do with Q.

▶Anonymous 01/02/18 (Tue) 10:27:15 153378 No.228537>>228543 >>228545 >>228546 >>228550 >>228557 >>228558 >>228561 >>228569

>>228511

Fair enough.

Some answers then.

The round up has started in the EU.

Assange is about to drop bombs.

Iran will spill evidence everywhere.

The Cabal will flood with NASA truth bombs as their very last card. It's their only card left.

Everything is about to get very real, very quickly.

It's been a pleasure anons.

I'll go back to anon posting.

BUT we will meet up for a picnic inside the Earth at some point.

I'll be the one on the unicorn.

I'm not even joking.

▶Anonymous 01/02/18 (Tue) 10:30:38 153378 No.228558

>>228537

One more thing.

The next time (((you))) send someone to my home, or even anywhere near it, I will take care of it personally and there will be the worst kind of Hell to pay.

You know who you are and you know EXACTLY what I mean.

▶Anonymous 01/02/18 (Tue) 10:32:04 153378 No.228565

>>228562

>>228561

>>228550

<3

▶Anonymous 01/02/18 (Tue) 10:32:54 153378 No.228570

>>228545

XXX

>>5123

I absolutely hate saying this: could also be an AI bot trained on /vqc/ as well as /qresearch/ or /cbts/. A muddy-the-waters type of thing.

>>5123

Yes, I've figured out you were one of the people in the thread, ya fag.

CBTS #270 ID: 153378

https://archive.fo/jzRqB

This is definitely Chris.

I think he's right about the pole stuff. It's so fucking easy to shop a hole out of the poles, they're covered in white.

>>5125

Most of the conversation is with me on both threads. Yes.

As for what you linked to…

"You have a certain… bickleness"

Know where I've seen THAT before?

https://ia802300.us.archive.org/8/items/rofschildv1/IAmARofschildAxeMeAQuestion.html

>>5125

Topol is certainly the easiest to spot of all. Though there are a few ponies that are give-aways too, ha.

Topol, you couldn't help yourself yesterday, taking the CDC plane and putting the little DaWae on the tail. imo, that was distracting to anons trying to work and dig, just one example - this is not a game. Trying to change the course of the future of humanity, let alone what this entire operations costs (yuge), and you can't help shitposting. Anyway, enough preaching from me.

While we're clearing the air, I don't think in retrospect this was VQC, but this is the suicide context. And the one that Topol got bent wrt my reaching out directly (which took about 3minutes of searching) .

ID: 40e61e in:

https://8ch.net/cbts/res/148453.html

After that, there were more and more 'kill myself' scenarios over time, and it appears to have been a new shill tactic, possibly with some real cases mixed in.

>>5099

>Let's have fun and get to work!

Yes, let's get to work!

>>5101

CA, one thing that's been lingering is the reference to "pyramids", specifically with square base (versus triangular, or tetrahedron pyramid).

The Johnson solid J_1 is the square-based pyramid with equilateral faces. Numbers that are simultaneously Triangular and square pyramidal satisfy the Diophantine Equation.

Also, there is the concept of a "Pyramidal Frustrum". A Frustrum is defined as the portion of a solid which lies between two parallel planes cutting the solid. (e.g. our 5-layer thick blue zone!).

Get your prayers out and believe!

>>5128

Cool, looking back, only (3) posts by that user id in the thread, so couldn't have been you. j/k!

Here's the CDC plane, check the tail (this was posted short bit later in bread after first):

>>>/qresearch/569919

>>5127

You're so not living that down!

MY POOR MAMMY!

:P I had to say you were some professor's assistant and it was regarding some yob interview.

That being said…doooon't hate me buuuut:

A person with a history of alcoholism who has a wife and son to worry about: Quinn Michaels.

That or Assange, who the current VQC is not, but if anything happened to his wife and kid… I feel like that'd be frontpage news.

Aight, I'm going back to the EZ Bake to have a Russian Tea Party with my ponies.

>>5131

I have never had postal relations with that meme.

>>5130

Yes, all will be well!

>>5132

No worries. No regrets.

And alcohol is a hard one for many, I've gotten sucked in at times for sure.

So, this is what I had focused on earlier:

>>4340

>The objective is to find a base larger than n and smaller than x+n at this stage.

So, that gives us a window of "x" for the start. Is that an 'x' for that iteration, or the final result? Not sure.

Also, the start. Have been starting with the (1,c). I don't think that's correct, better to start using the f-2 method, or even using (d+1) as 'a' and 'b'. We need to move TOWARD the 1,c, and if we get there before finding a factor pair, then c is prime. This says the (1,c) should be the destination of the iteration, no?

>>4343

>We will add a method to calculate what would be missing from the triangles if we could only fill them with n0 squared and multiples of 2d.

>That gap will allow us to use more geometry of triangular numbers to establish what multiple of 2d could be added to make our eight triangles.

>That geometry with multiples of 2d will give us the solution, if it exists (which in our example we know it does). If doubling the width of the chunks of (f-2) didn't give us a solution, the number c would be prime, the worst case (doubling the width of (f-2) chunks very quickly determines this as the number of times it doubles is logarithmic in the length of (f-2)).

>>5133

Ya, figured that out now.

Have a good night all.

I wish I could help more with the math but I'm both overrun with other things to do and some pretty intense non-physical developments in my life lately. Shit's absolutely crazy, but I don't want to derail the thread. Still here daily to mod if anyone needed reassurance of that. It always makes me happy to see how many of you are still here too.

>>5107

>>5110

Keep in mind, there was that person who kept posting about Chris saying he was going to kill himself and that his only evidence was Topolanon being there. Topol said here >>3121 that it was a lie. Another thing to keep in mind is that drunk people barely ever spell things properly, so even if drinking would make it more likely that he'd spell vqc in lowercase, what are the chances that being drunk enough to do that wouldn't be too drunk to be able to spell every other word in that post properly? If it's true, obviously it's going to be significantly harder to do this unless someone actually is going to take over, but it obviously isn't impossible, and it's also obviously going to be easier with several people working on it. If it isn't true, which I think is the case, all we have to do is keep working and he'll pop in at some point.

>>5129

Yeah those would be sums of successive squares, which would appear in the last pic on the second graph in the third column. I think my hypothesis about the n-gon of x-dimensions may be false but it is true for the 1,1 grid on the top left.

Hello lads! Working and thinking over here. I have a few good new ideas, just working on testing them first. Thinking on the (x+n) square and this:

>Then fill the square with n0^2 and multiples of 2d.

I'm thinking of n0^2 as little squares inside the bigger (x+n) square. Like doing a block puzzle with n0^2 pieces and 2d sized pieces. Or maybe 2d(n0-1) pieces?

>>5142

Recently in the qresearch Q posted USE LOGIC. Could this mean we are supposed to utilize logical functions? Such as AND, OR, NAND, or XOR. I don't know if there are any proofs about these functions and the integers but we might get something

>>5142

Hello PMA! Your diagrams are great, and exactly what I was working on, increasing n0^2. Don't forget that f = 2d + 1 - e. Would that help remove the green squares? Or said in formula, e has already been removed in the formula for f…

((n0 * n0 - 1) + 2d(n0 - 1) + 2d +1 - e)

That would effectively take away the 3 green squares and make a match for the correct (x+n). Am I missing something here? Looks like you've successfully increased values of n0^2 and 2d(n-1) until finding a match.

Also, having n0^2 in the upper corner really helps observe the increase in n0^2.

>>5145

>Looks like you've successfully increased values of n0^2 and 2d(n-1) until finding a match.

For small numbers, I have a process that works, but it essentially just increments u until it finds a match. When taking larger jumps of u, it's hit and miss. Trying to analyze a possible next step.

>>5147

Ok, I'm looking at the u values. This is the base of 1Tu, correct? Have you noticed that the other side of the 1Tu is always u+1? If you draw the straight lines from the center square, for (x+n)=15 you always get Tu with base of 7 and side of 8. How can we connect this with n0 base estimation?

>>5148

>This is the base of 1Tu, correct? Have you noticed that the other side of the 1Tu is always u+1

Correct. u in the formula 1+8*T(u).

T(u) = n*(n+1)/2. The other side is always u+1.

>>5149

Ok, so if we find u, we can solve (x+n). How does n0 work into this? For smaller examples we can iterate by 1. Then, once f is big enough to divide (f-2)/8 we can iterate by n0. Then when we’re dealing with RSA sized numbers we do (f-2)/40 and iterate by n0. What are the problems you’re currently having with the iteration process for larger numbers? It seems like we have a good working process for smaller numbers. The key is tying the verification calc to the formula ((n0 * n0 - 1) + 2d(n0 - 1) + 2d +1 - e).

I think this is what VQC was getting at. n0^2 and 2d(n-1) combine to form the (x+n) square. I could be stating the obvious, but this is news to me.

>((n0 * n0 - 1) + 2d(n0 - 1) + 2d +1 - e)

>>5150

These formulas are all equivalent.

(x+n)(x+n) == 1 + 8T(u) == (nn-1) + 2d(n-1) + f

VQC refactored into:

8T(u) == nn +2d(n-1) + f - 2

T(u) == (nn +2d(n-1) + f - 2) / 8

And then reduced size by 1/5 as an estimated starting position. That's where the (f-2) / 40 came from.

What's missing in the iteration process, is a way to appropriately handle the (nn + 2d(n-1)) / 40 piece and it's mod. This is where inaccuracies come into play as the numbers get larger. We know d and are estimating n as n0. And for RSA size numbers, we fly right on bye extremely quickly with this approach.

So something else has to come into play.

>>5151

Hmm. Understood. How can we create a method to know if we’ve “flown by” the correct (x+n), and then backtrack with smaller values until we find the solution?

>>5152

>"flown by"

or approaching. That's what I was trying to get at in >>5142.

>>5153

Gotcha. This is what I was also getting at about using the quadratics to verify by solving for n using the (x+n) estimation.

>>5154

Good news is we're learning tons about triangles!

>>5155

PMA, you just made a triangle joke! And you made your first shitpost last week. Nice!

I miss you all, triangular anons!

Sorry - I became very busy with work.

I'm trying to catch up a bit, and still trying to understand the triangular number formulas - if anyone has any specific posts they recommend I read first, I'm all ears.

I've been thinking a bit about the relationship between triangles and squares, so here's a list of things I've been thinking about regarding that topic (not sure if my whitespace formatting is going to work as intended):

1. We know that the series of all odd squares are described as 8 triangles + 1. (8T(u) + 1).

series of odd squares:

1, 9, 25, 49, 81, 121, 169, 225, 289, 361

minus 1, divide 8:

0, 1, 3, 6, 10, 15, 21, 28, 36, 45

Interesting to note the parity of the numbers here. Similar to the columns of e.

2. We know that the series of all even squares can be divided by 4.

series of even squares:

0, 4, 16, 36, 64, 100, 144, 196, 256, 324, 400

divide by 4:

0, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100

So we have a way to break a square into either a smaller square or a triangular number. I've been thinking about how a triangular number can be expressed as a square, so my own 3 observations (although I think others have already expressed maybe some of these).

3. Any triangular number can be expressed as a square minus the triangle of number -1.

T(u) = u^2 - T(u-1)

I'm not sure if I like this expression, because in algorithmic terms the movement of u is linear.

Conversely, a square can be expressed as the sum of 2 consecutive triangular numbers.

u^2 = T(u) + T(u-1)

4. An even triangle number can be expressed as the largest square that fits under it (u/2) plus 2 smaller triangles of size (u/2).

T(u) = (u/2)^2 + 2T(u/2)

5. An odd triangle number can be expressed as the largest square that fits under it ((u+1)/2) plus 2 smaller triangles of size (u-1)/2.

T(u) = ((u+1)/2) + 2T((u-1)/2)

What I like about these last two is the u/2 in the recursive part of the algorithmic interpretation.

Ok, so another couple of known relationships:

6. The series of differences of 2 consecutive squares is the series of odd numbers:

1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144

- 0, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121

=1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23

7. The series of differences of 2 consecutive triangle numbers is the series of whole numbers:

1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 78, 91

- 0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 78

=1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13

8. The relationship between the two series above is 2n - 1.

So I'm not quite sure what to conclude of all this. I can imagine growth in several aspects of the relationship. I'm going to continue to get caught up. I hope this helps someone!

>>5157

Hello Teach! Good to see you, and thanks for all the solid breakdown of ideas.

>>5153

Hello PMA! So my question is how do we know when we’re approaching the correct (x+n) when doing a real calc starting from c? Or if we’ve passed it by? Do you have a method yet to check each iteration?

>>5158

>Do you have a method yet to check each iteration?

Only thing we have at this point is a check on the result from Get_Remainder_2dnm1. And still not seeing how that helps us determine the "more geometry of triangular numbers" hint.

I was under the impression in the last thread that VQC dropped enough clues to solve the odd number RSA values. And he would stay away until that was accomplished. (Although it would be AWESOME if he came back soon!)

Going to once again go back and review previous posts to see if anything jumps out.

>>5159

Working on improving the quadratics to help verify (x+n) iteration path. Check this out, found a major (but very basic) improvement for the formula. Staet with the difference of squares equation, and sub in (Tu XPN Est) for the small square. Then begin to solve the equation for n (isolate n). When taking SQRT of c and (Tu XPN Est), we need to include the remainders of both c and (Tu XPN). c = dd + e. For clarity, I'll call remainder of SQRT(Tu XPN) var g.

c = (d+n)^2 - (Tu XPN Est)^2

c + (Tu XPN Est)^2 = (d+n)^2

Floor SQRT(c) + e + Floor SQRT(Tu XPN Est) + g = d + n

dd + e + (Tu XPN Est) + g = d + n

dd + e + (Tu XPN Est) + g - d = n

We're looking for a match where n is a whole integer. Should be easy to spot in a list of calcs.

>>5160

Duh. Mistake here. (x+n) is a perfect square, so no remainder exists, and no var g needed. But we need to include e. This will eliminate fractions when using the quadratics.

>>5161

>>5160

Kind of confusing, are you saying start with the squares that give 1 and c as a factor? (They always exist, can be calculated easily)

>>5163

4 0 4 0 4 0 4 0 4 0 4 0 4 0

>>5163

1 1

6 6

15 15

28 28

45 45

66 66

91 91

120 120

153 153

190 190

231 231

276 276

>>5163

Any triangle number plus the previous is the square of the longest side of the first triangle number

>>5167

Hey PMA.

I too am confused with the description of the last steps in the process.

I'm confused about the triangle stuff.

There are many cases when n-1 is larger than (x+n-1)/2, and therefore 1+8T(n-1) is larger than (x+n)^2.

Also, there many cases where (f-2)/8 doesn't lie between n-1 and (x+n-1)/2.

I'm very confused indeed.

I've been focused on understanding this post:

>>4678

In particular how the multiples of 2d can be turned into a square, or parts of the triangles.

This last series of posts in RSA 10, were super messy, and contained many errors.

Very unlike Chris.

And now his twitter is gone.

>>5169

He has deleted his Twitter before you know.

>>5168

Teach - in looking at that >>4678 post, and VQC's previous question "Why is (n-1) important?".

Doesn't it seem that n-1 gives the width of one side of the nn-1 square?

With regards to the 2d(n-1) contribution to the triangle, I posted a few pictures in the previous thread that connected the (x+n)(x+n) square for the prime solution to the starting c small square.

>>4758

This idea, and subsequent posts, was the closest I've come to understanding how the triangles work. The red blocks represent the 2d(n-1) contribution. When coupled with the f and (nn-1) pieces in the center prime small square, always form an outlining square or "capstone".

Those formulas work everywhere, but I wasn't able to figure out a way to arrive at that "capstone" square.

Same iteration problem that we're running into now with f-2.

>>5172

I went about the problem a bit differently than VQC explained, so I may have gone down a wrong path. Who knows?

The image VQC posted shows the relationships between small and big squares of a single record.

I combined the nn-1 + 2d(n-1) + f formulas from both the c and prime records into a single image. Think of them as one square layered on top of the other, sharing the f value and portions of the nn-1 and 2d(n-1) values.

To me this represented a nice growth perspective. Fractal even.

The positioning of the f value didn’t really matter.

What was really interesting was the appearance of the 2d(n-1) as a square every time. And then the ability to represent the inner nn-1 algebraically.

The relationship definitely exists. But don’t know how to connect the dots so to speak.

>>5173

Ah, ok, I'll take another look at your images with that in mind.

You're saying that 2d(n-1) is a square? In which cases? In the solution and the prime? That could really help me.

>>5178

Love the new images. The world is a confusing place.

Tetrahedral numbers.

>>5174

I feel like I'm being Captain Obvious here but 2d(n-1) is a square when n-1 = 2d.

>>5178

The first one kinda looks like rainbow udon noodles.

>>5182

What about them?

Seeing as how I haven't checked in in awhile, hello everything. Special welcome back to Teach. So I've been working on some patterns, and have reduced my work into one, fairly underwhelming formula.

N = (D-A)^2+E / (2*A).

I'll be extra salty if this was stated somewhere else, other than the known "X^2+E = 2*N*A". I'm using the form D-A instead of X, because this is the fruit of working on the X+N square, and my observation that it seems like an overly complex way of iterating over A.

Here in this formula, if (2*A) evenly divides (D-A)^2+E, A is valid, thus X, and you get N. Which isn't useful except, finding the intercept of these two equations, (where (D-A)^2+E < 2*A) gives us the upper bound for A, (i.e, the lower bound for X). It may also be possible to push X into the negative (where B and A become swapped) and give us the upper bound for B.

There's some more patterns with this I'm exploring, and I could do a visualization, but what's happening here is fairly complex to show without coloring it manually.

Hello. Some math stuff has showed up in

>>>/truthlegion/

He says hes related to Q. Also has some stuff to say about Phi, Phi, Fibonacci, etc. Could be insane though. I believe him

Hey lads! Still working on tying the n0 iterations together with the quadratics to verify when we reach the correct n value. Just checking in.

>>5190

Show me, faggot.

>>5194

>Again, take with a massive grain of salt. I've recently had some experiences that lead me to believe this type of stuff though.

It's good anon, we are open minded. Be comfy.

>>5194

Regarding crop circles, yes there are "real" and "fake" ones. The 'real' are likely created using a space-based microwave beam technology, painted onto fields (think x-y galvanometer such as in confocal microscopes or stereolithography systems). We don't know the exact purpose of these demonstrations, nor who is creating them.

Could be a star-wars weapon from Reagan days, protecting EU countries, and the crop-circles are demonstrations of 'operational readiness' to serve the mission (therefore, "pay up for your protection, we're operational!").

Could be blackmail - "pay up or else!"

The geometries are fascinating though.

>>5196

I thought that might deter people so I deleted it. Can't come off as too crazy

>>5199

Look up the Arecibo Response

>>5200

>Can't come off as too crazy

Too crazy? Our senpai claims insight into all millennial challenges, as the Lamb of God. You are fine.

>>5201

Familiar with the Arecibo Message And the Chilbolton Reply. Carl Sagan was likely in an elite circle of scientists, likely a hidden group, just a theory.

His first wife, Lynn Margulis, is very interesting. She did some very novel work regarding bacteria and species merging. Think - how did mitochondria get into our cells? Is this 'alien' life within us?

Also some interesting views on 9/11:

https:/ /hooktube.com/watch?v=SS3fz3yfVbU

>>5201

I looked this up the other night. We are in the midst of first contact. Have been for a while. Powerful people are trying to control that influence. If they Do we are ruined. We have to wake up. Good luck everyone.

>>5212

VA - think we're getting close.

The key to the problem with iterating, I believe, lies in understanding how the remainder works.

>>5204

In the "capstone square", there is a remainder of 48 (6 per triangle). This value is different from Get_Remainder_2dnm1. Each iteration (unless by chance we happen upon a perfect match), is going to be off by a remainder evenly divisibly by 8.

In >>5206 it is labeled as "capstone remainder".

We need a formula to calculate this.

>>5212

>>5213

So is this just a matter of running tons of different tests and analyzing results or is this a matter of thinking outside the box and just happening to come up with the correct ideas? I have been following along this whole time and I can tell how close we are, but I haven't been able to put a great deal of time towards doing math. VQC went through a full example and gave the answer, so we've obviously got all the tools we need. I just can't tell if it's a matter of taking a whole bunch of examples of each of these new functions with various a and b values and their corresponding (x+n) squares and analyzing the relationships as finely as possible to figure out the f/40 thing etc or if there's a fundamental rule behind these concepts that we haven't picked up on yet.

More Ancient Mathematics. Magic square. My teacher said we would be going over "ancient indian math" next class (monday). Now I don't know what it is, but he said it had to do with the Pell Equation (x-ny^2=1) and he mentioned that Pell didn't even create it (maybe THEY wanted to hide its origin). Then, as a complete COINCIDENCE, I stumbled on these magic square concepts, which are related to the Pell Equation somehow (saw on wikipedia, ask me monday how they actually are).

You have an nxn square, and fill the square in such a way with the values 1,2,…,n^2 such that each row and column and diagonal have the same sum. The universe named these Magic squares so they might mean something. Each n, here are the column numbers:

n

3 45 15 (3*5)

4 136 34 (2*17)

5 325 65 (5*13)

6 666 111 (3*37)

7 1225 175 (5*5*7)

8 2080 260 (2*2*5*13)

9 3321 369 (13*13)

10 5050 500 (3*3*41)

11 7381 671 (11*61)

12 10440 870 (2*3*5*29)

13 14365 1105 (5*13*17)

14 19306 1379 (7*197)

A mathematician that worked on the Pell equations also came up with another thing, a seperate fibonacci type guy.

f(0) = f(1) = f(2) = 1

f(n) = f(n-1) + f(n-3)

[fib is f(n) = f(n-1) + f(n-2), so this is a small modification]

But then look at our numbers for this sequence:

1, 1, 1, 2, 3, 4, 6, 9, 13, 19, 28, 41, 60, 88, 129, 189, 277, 406, 595, 872, 1278, 1873, 2745, 4023, 5896, 8641, 12664, 18560, 27201, 39865, 58425,…

I don't want to get all nazi-ie because I actually think they were a Rothchild scheme, but this simple modification gives us 88, which in (>>5219) is related to the fibonacci sequence (55a+88b). 88 is also the 14th number in the sequence, so go at it nazi larpers.

>>5214

Hello AA! I think there's a fundamental idea we haven't quite grasped yet. It will take calculations to verify, but we need the idea first. Remember this crumb?

>the fractal nature of integers. They are related into families

>Our current understanding of math and numbers is lacking

>New Math Kangz

Also, VQC hinted that this iteration process could be done (shortcut?) by using the grid. PMA has been working on tying together the (1,c) and (prime) records using a capstone calculation.

>>5206

Hello PMA! Would you please give a quick explanation to us of how and why the capstone idea works? Does it connect (1,c) and (prime) records in the grid? We know we're looking for a method to verify the correct answer.

>>5216

Hello Baker! Love these verses, ideas, and images. How about this verse for a Sunday?

“If you abide in my word, you are truly my disciples, and you will know the truth, and the truth will set you free.”

>>5218

That's some cool ass triangle math Topol! Inspiration to step our thinking up a few levels.

>>5219

Whoa! Great images and math. More mind expanding ideas!! Thanks Anon!

>>5220

>Nine Nine Nine!!!

I seriously LOLd

>>5221

Hello CA! Magic Squares? That is some cool shit. I'll study this in detail later today.

Lads, "The Kingdom Of Heaven Is Within Us" so let's raise our thoughts and emotions up a few quantum levels and visualize our success with happiness, joy, and excitement. We don't have to know the answer yet, we need to know that we WILL find it.

>>5222

Also I read something from book 2 of Corpus Hermeticum (early christianity/the actual religion. Is the same as other ancient religions) it says:

"21. And he learning diligently and understanding their Essence, and partaking their nature, resolved to pierce and break through the Circumference of the Circles, and to understand the Power of him that sits upon the Fire."

Which has to do with pi. Also there are also mentions of the 7 holy circles in book 4. There are 7 notes in music. 7 Colors (ROYGBIV). There are 7 chakras. Someone in an earlier thread said 7 is important because it is 111 in binary (3 horns in book of revelations).

>>5223

>Corpus Hermeticum (early christianity/the actual religion. Is the same as other ancient religions)

Are you saying the Corpus Hermeticum is from early Christianity? Hermeticism is its own thing. Maybe you just worded that confusingly.

>>5224

Maybe a particular power of 2 comes up throughout all of the primes or something. That seems a little too obvious but at this point it could be anything.

Oh I thought that was Christianity my bad. I remember learning about it as an issue in the Catholic church with people trying to revert to hermeticism, so I just assumed it was a previous iteration of Christianity so to say. Thanks for the clarification

>>5226

Catholicism and papacy are a stain on all of Christianity. It's sad

>>5225

>>5224

What if the integers themselves are a type of tagged pointer? https://en.wikipedia.org/wiki/Tagged_pointer

On 64 bit architectures, pointers to word-aligned objects have the lower 3 bits clear. What if an implementation detail of our universe is integers are tagged pointers that can be partially decoded to 3 bit detail before being dereferenced?

Jesus Christ some of the ideas spawned from these threads are truly heretical…

>>5230

Posts like these keep me aboard the /vqc/ train. If we do crack the code eventually, history will note your outsized contribution.

>>5231

I've thought something like this. Like for an NP problem, say backpack, it would point to a record, then you read in the next possible item for the backpack and it points you somewhere else, then , the next and the next and finally your last pointer is pointing at the solution, so no real calculations were done, the optimization is implicit in the directing.

>>5230

Great work PMA! So it is a recursive adding back in of remainders? I studied your output closely and understand. This example is the prime, but it also works for capstone and starting c as well?

So to clarify, we iterate by n0, but check each iteration against all possible remainders?

I never thought remainders would be so important again! Who would have known, lol :)

>>5231

Read the article, and I think that's what VQC is hinting at! Integers are grouped into families somehow.

>>5232

Seconded. PMA is our MVP for sure!

>>5239

Sorry to be a dick. I still don’t understand why 40 keeps popping up. Sure, 8 * 5, but why 5?

Is 5 arbitrary or is 5 key?

>>5241

Stated another way: you are making (f-2)/40 jumps but why that small? For what specific, articulatable reason? Why are we doing 5 * 8 rather than 6543277645 * 8 to really speed things up?

Note that at the end of the day I have no fucking clue what I’m talking about, I’m just trying to help by pointing out what I don’t understand about your generally excellent posts and program output.

>>5244

If I wasn't 49 days into nofap I'd probably appreciate that more, but it's the thought that counts. How are you?

Further from >>5243

Here's the grid with e, n, d and x in base 2 and a and b in base 10

https://files.catbox.moe/dzbpoe.csv

And here's the same but with a and b as the x and y axes instead of e and n (maybe it'll help us see patterns in cells with the same a or b values if there are any)

https://files.catbox.moe/qasjuc.csv

>>5239

>>5241

>>5242

I had gathered that (f-2)%40 was specific to the example VQC used because (f-2) from that RSA number could be divided by 5 and there are 8 triangles. I don't have any useful suggestions but it seems weird to use it universally.

>>5246

>Non-Euclidean Riemann Jackoffery

Kek

>>5247

Super duper busy, and it's bumming me out, but I thought I'd come procrastinate here a little.

Alright guys I may have a new strategy. VQC said it only took a couple steps for a c=145 right? So I am making an exhaustive search for a certain depth of steps using functions we know. I have generated a ton of pathways doing this

def AB(A,B):

C = A * B

D = int(math.sqrt(C))

E = C - D * D

X = D - A

N = int(((X * X)+E)/(2 * A))

return (int(E),int(N),int(D),int(X),int(A),int(B))

def EDX(E,D,X):

C = D*D + E

A = D - X

B = int(C/A)

N = int((X*X+E)/(2*A))

return (E,N,D,X,A,B)

def F(rec):

newE = rec[e] - ((2*rec[d])+1)

newN = rec[n] - 1

newD = rec[d] + 1

newX = rec[x] + 1

return (newE, newN, newD, newX, rec[a], rec[b])

def FI(rec): #F inverse

N = rec[n] + 1

D = rec[d] - 1

X = rec[x] - 1

E = rec[e] + (2*D) + 1

return (E,N,D,X, rec[a], rec[b])

def C(C):

return AB(1,C)

def nextT(rec):

A = rec[b]

B = 2*rec[b] - rec[a] + 4

X = rec[x] + 2

D = rec[b] + rec[x] + 2

return (rec[e], rec[n], D, X, A, B)

def search(c, depth):

for i in range(2,c):

if(c%i==0):

if(i<c/i):

goal = AB(i,int(c/i))

else:

goal = AB(int(c/i),i)

start = AB(1,c)

path = "S/"

inSearch(start, goal, depth, path)

def checkRec(a,b, path):

for i in range(len(a)):

if(a[i]!=b[i]):

return

print("True", path)

def l(i):

if(i==0):return "e"

if(i==1):return "n"

if(i==2):return "d"

if(i==3):return "x"

if(i==4):return "a"

if(i==5):return "b"

return "?"+str(i)

def inSearch(rec,goal, count, path):

if(rec==None): return

checkRec(rec,goal, path)

if(count==0): return

inSearch(F(rec), goal, count-1, path + "F/")

inSearch(FI(rec), goal, count-1, path + "Fi/")

inSearch(nextT(rec), goal, count-1, path + "+t/")

for i in range(len(rec)):

if(rec[i]<0):continue

inSearch(C(rec[i]), goal, count-1, path + "C("+l(i)+")/")

for i in range(len(rec)):

for j in range(len(rec)):

if(rec[i]*rec[j]<0):continue

if(rec[i]==0 or rec[j]==0):continue

inSearch(AB(rec[i],rec[j]), goal, count-1, path + "AB("+l(i)+","+l(j)+")/")

for i in range(len(rec)):

for j in range(len(rec)):

for k in range(len(rec)):

if(rec[j]-rec[k]==0):continue

inSearch(EDX(rec[i],rec[j],rec[k]), goal, count-1, path+"EDX("+l(i)+","+l(j)+","+l(k)+")/")

Here is all the python code.

Here is some output:

>>> search(145,2)

True S/C(n)/EDX(a,e,d)/

True S/AB(e,n)/EDX(a,e,d)/

True S/AB(n,e)/EDX(b,e,d)/

True S/AB(n,a)/EDX(b,e,d)/

True S/AB(a,n)/EDX(a,e,d)/

>>> search(145,3)

True S/+t/C(n)/EDX(a,e,d)/

True S/+t/AB(e,n)/EDX(a,e,d)/

True S/+t/AB(n,e)/EDX(b,e,d)/

True S/C(n)/C(b)/EDX(a,e,d)/

True S/C(n)/AB(a,b)/EDX(a,e,d)/

True S/C(n)/AB(b,a)/EDX(b,e,d)/

True S/C(n)/EDX(e,n,d)/EDX(n,e,x)/

True S/C(n)/EDX(e,d,x)/EDX(a,e,d)/

True S/C(n)/EDX(e,d,a)/EDX(n,e,d)/

True S/C(n)/EDX(e,d,a)/EDX(x,e,d)/

True S/C(n)/EDX(e,a,d)/EDX(d,e,x)/

True S/C(n)/EDX(n,d,a)/EDX(x,b,d)/

True S/C(n)/EDX(d,e,a)/EDX(x,d,e)/

True S/C(n)/EDX(d,a,e)/EDX(d,x,e)/

True S/C(n)/EDX(d,b,e)/EDX(n,x,e)/

output for depth of 3.

I am going to make a thing that generates these strings and matches them up against other correct pathways for other coprimes and I'm going to see if we can brute force this thing.

>>5251

Here are some paths that worked for this 3 depth.

So for the products of the primes [3,5,7,11,13,17,19] I did a depth search where I went at most 3 steps deep to see if I could solve for the correct record. Each step deeper could either be F, F inverse, next T (didn't do previous t), or AB(1,y), AB(x,y), EDX(x,y,z), where x,y,z could be any 3 entries in (e,n,d,x,a,b).

S/EDX(e,a,d)/EDX(x,e,a)/EDX(d,e,n)/ 7 27

S/EDX(n,e,d)/EDX(x,d,n)/EDX(d,e,n)/ 6 27

S/EDX(d,b,e)/EDX(b,x,e)/AB(a,n)/ 6 27

S/EDX(x,e,d)/AB(a,b)/EDX(d,x,e)/ 9 27

S/EDX(x,d,e)/AB(a,b)/EDX(x,d,e)/ 6 27

S/EDX(d,e,n)/EDX(d,e,n)/EDX(e,d,b)/ 6 27

Numbers at the end are amount of times this path worked, then the total times tried. Someone want to take a crack at analyzing these? It doesn't work for every one, but maybe one step (or a couple) need to be iterated.

>>5252

Here is output:

https://pastebin.com/M17sJM8A

It works a good amount of times. Next I'll break down each of these individual steps and do an individual search just with those. The depth things took wicked long but I might run it in the background for depth=4 for more primes while I write a paper.

I broke it down into 13 moves

"EDX(e,a,d)/", "EDX(x,e,a)/", "EDX(d,e,n)/", "EDX(n,e,d)/", "EDX(x,d,n)/", "EDX(d,b,e)/", "EDX(b,d,e)/", "AB(a,n)/", "EDX(x,e,d)/", "AB(a,b)/", "EDX(d,x,e)/", "EDX(x,d,e)/", "EDX(e,d,b)/"

Then went for all the products of these primes

[3, 5, 7, 11, 13, 17, 19, 23, 29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97]

this is a total of 184 coprimes. I found 3 patterns that work 41/184 times:

41 184 C(c)/EDX(x,e,d)/AB(a,b)/EDX(d,x,e)/

41 184 C(c)/EDX(d,x,e)/EDX(d,x,e)/AB(a,b)/EDX(d,x,e)/

Also I found some other notable ones:

23 184 C(c)/EDX(x,d,e)/AB(a,b)/EDX(x,e,a)/EDX(e,a,d)/

26 184 C(c)/EDX(x,e,d)/AB(a,b)/EDX(x,e,d)/EDX(x,e,d)/

28 184 C(c)/EDX(x,d,e)/AB(a,b)/EDX(x,d,e)/

Some of these may overlap or be redundant. But not all the AB(a,b) are worthless, because sometimes you can have same a,b with different other values.

>>5251

Hello PMA! Studied your output closely. So the (x+n) and u values are the same for both (1,c) and (prime). This the essence of your capstone idea, correct?

Also, I understand and follow your idea about dealing with the remainders, especially the large remainders in the (1,c) calcs.

For this improved method, we are now essentially running an iterative search that also accounts for the remainder at each iteration and searches for a value where rm (x+n) = 0 and rm 2d(n-1) = 0. Have I understood your idea correctly?

>>5256

VA - I'll try to summarize my recent posts and the current iterative approach using f-2 chunks of (f-2)/40.

1) Starting from a 0 factor, create an initial square as 1+8T(u) + remainder. Where u is a multiple of chunks and the remainder is the mod.

2) Calculate the next u (I'm calling this rm u) as u + (f-2 chunk).

3) Within the area between u and rm u, a solution may be found. Iterate through this section by adding 8 times incremental f-2 chunks to the initial square, plus another remainder.

4) At each iteration, calculate the n0, and remainder for 2d(n-1). Subtract this remainder from the estimated XPN to get a final XPN.

5) This final XPN is a perfect square with no remainder. This is the x+n rm column and is only a sanity check. Test the final XPN against the rm 2d(n-1) to see if we have a match.

The recent work on the "capstone square", lead to an understanding of how the remainders are always evenly divisible by 8. Which in turn lead to a more accurate iterative approach.

The slow part of this process is checking within the u and rm u area.

>>5257

Thanks PMA, very clear explanation. So are we still looking for a way to verify when we arrive at the correct solution, or will this give us a match when we reach the correct u value?

>>5258

>still looking for a way to verify when we arrive at the correct solution

No. This part is done.

I'll post a bit later some thoughts on how to tackle speeding up the remainder search.

I've been briefly looking for some patterns in the binary versions of various things since nobody else is. Maybe if we find that particular patterns in powers of 2 come up that we can find a way to go from iteration to calculation. VQC has hinted as such, after all, however vaguely.

Here are the first 100 triangle numbers in base 2:

0000000000001

0000000000011

0000000000110

0000000001010

0000000001111

0000000010101

0000000011100

0000000100100

0000000101101

0000000110111

0000001000010

0000001001110

0000001011011

0000001101001

0000001111000

0000010001000

0000010011001

0000010101011

0000010111110

0000011010010

0000011100111

0000011111101

0000100010100

0000100101100

0000101000101

0000101011111

0000101111010

0000110010110

0000110110011

0000111010001

0000111110000

0001000010000

0001000110001

0001001010011

0001001110110

0001010011010

0001010111111

0001011100101

0001100001100

0001100110100

0001101011101

0001110000111

0001110110010

0001111011110

0010000001011

0010000111001

0010001101000

0010010011000

0010011001001

0010011111011

0010100101110

0010101100010

0010110010111

0010111001101

0011000000100

0011000111100

0011001110101

0011010101111

0011011101010

0011100100110

0011101100011

0011110100001

0011111100000

0100000100000

0100001100001

0100010100011

0100011100110

0100100101010

0100101101111

0100110110101

0100111111100

0101001000100

0101010001101

0101011010111

0101100100010

0101101101110

0101110111011

0110000001001

0110001011000

0110010101000

0110011111001

0110101001011

0110110011110

0110111110010

0111001000111

0111010011101

0111011110100

0111101001100

0111110100101

0111111111111

1000001011010

1000010110110

1000100010011

1000101110001

1000111010000

1001000110000

1001010010001

1001011110011

1001101010110

1001110111010

>>5261

There are a few complicated visual patterns but there are some simple things I noticed that I'll point out first. Whether these patterns have any relevance, I don't know. The point is to find patterns and then figure out if they're relevant. What I thought was that maybe some of these patterns also occur in prime numbers or something, as in maybe they're made up of similar patterns of powers of 2. Either way, some of them definitely don't seem like visual coincidence.

For anyone who doesn't know much about how binary works, from right to left, it you want to convert it to decimal, you add each column based on it being 2 to the power of however many digits in you are minus 1. So, if there's a 1 in the fourth column across and the second column (i.e. 1010), the rightmost 0 represents 2^0 (but it's a 0 so you don't add it), the next one represents 2^1 (so add 2), the next is 2^2 (but it's 0), and the next is 2^3 (so add 8). That means 1010 in binary is 10 in decimal.

So, patterns. Firstly, in the 2^0 column from top to bottom (far right, 2^0 = 1 to translate to decimal), the pattern is 1100 repeated. In the 2^1 column (next one to the left, 2^1 = 2), it's 01111000 repeated. From then on the patterns get more complicated (so in the 2^2 column, it's 0010111111010000). It seems like the patterns double in size each time, but I don't know how patterns from 2^2 onwards come about. If there is some way of figuring that out, there's a way of calculating which powers of 2 are in which triangle numbers.

Secondly, you can see how many triangle numbers there are with a particular highest power of 2 (based on the leftmost 1), and this has a pattern too. It seems like a weird pattern so far.

1 1 1 2 3 5 7 9 13 19 27

That's how many triangle numbers there are with each ascending power of 2 as its highest. So there are 27 triangle numbers with 2^10 as their highest power of 2. I don't know about the earlier numbers, and I've only looked at this for the first 100 triangle numbers so far, but from 2^6 onwards, it's +2, +4, +6 and +8. So maybe it keeps going like that. That might means there are 37 triangle numbers with 2^11 as their highest power of 2.

Thirdly, there are some things I've noticed visually so I'll have to draw them in Paint or something.

>>5260

This is fucking awesome.

A couple stupid questions from your pastebin output: what happens if you keep going past the solution? Does x+n diff become negative? Just looking for stably-sorted things to binary search. If x+n diff did become negative and we could jump around, it would be an attractive binary search target.

Also, I don't really understand u but it's weird in your pastebin output that final u is x+n diff/2.

>>5265

They're two of the same triangle number mirrored, yeah. I meant triangle in terms of the shape I guess. So at least based on your image, it's going 1, 3, 1, 6, 1, 3, 1, 10, 1, 3, 1, 6, 1, 3, 1, 15, 1, 3, 1, 6, 1, 3, 1, 10. The peaks of the triangles are always predictable since the 2^0 pattern is 1100 over and over and wherever there are zeroes in the 2^0 column there are mirrored triangles, so the peak of the mirrored triangle number shapes is always on the 3rd and 4th triangle numbers. That means the 115th and 116th triangle numbers should make a mirrored triangle of 21 out of the zeroes. I really can't tell if I'm taking this too seriously but he did say that patterns would be more obvious in binary, and this is a pretty obvious fucking pattern.

>>5260

BOOM. PMA you are a fabulous faggot (!!!!)

>And T(12) = 78 just happens to be the remainder portion that solves our prime problem. (!!!!!) The math breakdown is on the right hand side.

So you can verify solution because the remainder is accounted for? if so, then we may have this ==>>

So then we solve for n:

SQRT( c + (x+n)^2) - d = n

SQRT(6107 + (83^2)) - 78 = 36 (prime n)

BAKER=

RSA #10 —- http://archive.fo/anGD7

I've got all VQC maps and archives saved offline. Can upload to anonfile if anyone wants to save offline as well.

>>5264

>Does x+n diff become negative

The x+n diff column is a sanity test against the known prime solution x+n value. We won't know this value when searching through unsolved RSA numbers. I just use it as an indicator.

u is a triangle base. For odd x+n values, it is defined as u = (x+n-1)/2. And the area for any triangle base is T(u) = u*(u+1)/2.

>>5273

Question (3 points):

This anon has no posting history on this board. Why would they pose a question we've already discussed in great detail?

Answers:

a) Because they didn't read the thread.

b) For demoralization purposes because they're that one person I keep having to ban who just keeps coming here and spamming the threads telling us to give up.

If the answer is (a), I don't intend to be patronizing, but we've already discussed this and everyone seems to have come to the conclusion that it doesn't matter and that we should keep working on it. It would be a bit of a waste of time to repeat ourselves so read the thread and post something a little more constructive. If the answer is (b), fuck off.

Don't let the discouragement shills derail (You).

Chris is dealing with something.

Keep Nerding Out,

And

No Lewding The Ponies.

>>5275

>also no posting history

I don't know who this is.

>>>/qresearch/799197

>What about VQC?

>Has anyone heard from that side of the pond lately?

>EU in progress?

>>>/qresearch/799228

>I'm here in almost every thread, every day, just no namefagging.

>I've got to put my dog down this evening. He's got cancer and it's sad.

>Good to be amongst fine anons.

>Much loves.

>>5279

>>5277

What I meant when I said they were triangles was that they were reflected triangle numbers, not that they were visual triangles. Although, that non-linear triangle you pointed out (the red one) makes me think that maybe the whole thing really is the triangle, if this does actually mean something. Partially because once it isn't linear (one less 0 the lower the column) the number of 0s until the next column is 1, 1, 1, 1, 2, 2, 3, 5. Aside from the first one, that's the same sequence as here >>5261 in terms of rows where the highest power of 2 is. 1, 1, 1, 2, 2, 3, 5. So I'm just blindly extrapolating here but I would think bigger triangles might follow that pattern and that the next would be 7, then 9, then 13 and so on. That's if it isn't the other explanations I was thinking, which is that it is reflected triangle numbers and that the fact that its a big triangle means it overlaps with other 0 patterns that we haven't figured out yet.

>>5278

If that wasn't a larper and you're reading this VQC, I had to have my dog put down about a month ago for similar reasons. You aren't alone. It would also be good to have confirmation with trip that you didn't an hero, but obviously that's not a priority when you're going through whatever you're going through, so whenever you're ready.

>>5127

VQC would not be asking about Discord.

He would know.

Hey guys, long time lurker. I've really admired the effort you guys are putting into this and have wanted to help. But I've been hesitant because I don't know a lick of coding and didn't want to drag you guys down. But as I see the world changing and changing I really want to give this a try.

So I guess I'll ask this dumb question but how do I start and how do I catch up to what you guys are working on now?

>>5288

If you want to learn some basic coding and create the grid for yourself, see what you think of this thread >>4379 here. If you're wondering what the grid is and what it's used for, you might like to read the pdf here >>5290 if you aren't paranoid about pdfs (I wrote it so if you'd prefer a text dump I or someone else could do that), read this guy's (the baker's) other post above it too, and maybe read through the images in the OP of each of these threads if you don't want to have to read 11 entire threads. Don't worry about being a burden or anything. At the moment it seems like PMA is the only one who has any idea where to take the mathematic side of this (I mean, just personally, I understand most of the current stuff but presently have no idea where to take it next or what other things to test). Don't worry about needing a name, either. Most of the time these names come from necessity.

>>5288

>>5290

I should mention: the thing about f in the pdf is wrong. I wrote that based on an earlier version of the Java code that had some errors in it. I haven't actually edited (or looked at) that pdf since probably November or December. You might not understand this until you read to that section but f is kind of like a negative e value. It isn't fbaxdn (that's what the error was); it's still endxab but e = f and n = n-1. It's used to make the side of the grid for a negative e value. e is the difference between c and the highest square number below it. f (from my understanding) is the difference between c and the lowest square above it.

>>5287

>Coincidence? I think not.

Very cool!

>>5288

Welcome, Anon! Glad to have you on board.

>>5283

Howdy Topol! Thanks for the snacks.

>>5285

Hello PMA! Thanks for the new ideas and output. I've studied them closely and understand. So at this point you're working to speed up the iteration process by looking for quicker ways to deal with the remainders, correct? Remember these crumbs? Handling remainders is key, base selection is arbitrary. We're on the right track, lads!

>The objective is to find a base larger than n and smaller than x+n at this stage.

>>4338

>>4339

>>4340

>>5296

(1, 61, 6) = {1:111101:1100:1011:1:10010001}

(1, 1, 6) = {1:1:1001000:1011:111101:1010101}

(1, 5, 4) = {1:101:1100:111:101:11101}

(1, 1, 4) = {1:1:100000:111:11001:101001}

>>5299

Hmm I wonder if the correct path ends up being some monkey business in the original “the end”

And, fuck it, since I just so happen to be here:

5303 – Sophie Germain prime, balanced prime[5]

And shits'n'giggles:

5329 – 73^2, centered octagonal number[2]

5333 – Sophie Germain prime

5335 – magic constant of n × n normal magic square and n-queens problem for n = 22.

4

>>5297

Thanks for the binary output AA! I looked it over closely and see some possible patterns. I guess I'll need to learn binary and examine some other examples for na to verify!

>>5298

Hey Topol, I'm open to the idea, just wondering bc lots of people on /GA/ keep saying Discord is a honeypot. Is it compromised in some way?? Honest question here.

>>5299

Nice digits PMA! I studied your output and understand your idea. So do we actually have a way to know when we're getting Closer or Farther away from a solution? Do the calcs for x+n rm and rm 2d(n-1) show us when we're approaching a solution?

>>5307

Already got Komrade Baker, Minecraft, PMA, and Sheeeeeeitbaked. Think about what you've been doing on an open forum already. Think of all the doubt being seeded about 8chan, let alone a tool that lets talk with people in real time. Why wouldn't (((they))) try to dissuade you from utilizing it.

And again, think of what you've been doing, publicly, for the last 5 months. If you or any of us were boned, we'd be boned by now. If you're comfy with your OPSec here, then you'll be fine on Discord. Otherwise, you might as well get off the internet. The whole thing's #COMPED, anyway.

The work's been going so much faster on the Discord server. Do the verification and join us! There are no "bots" in the server that would inject screwball activity. I've never trusted those things and some of them WILL fuck with the servers so I keep mine clean.

Savvy?

>>5298

>>5307

>>5308

Discord is definitely a honeypot. I saw a detailed explanation on 4chan a while ago. I swear I'm not saying this because I'm the BO here and I'm on some kind of stupid power trip, but I really don't see any reason why we should be using Discord.

>Why wouldn't (((they))) try to dissuade you from utilizing it

It could be argued that they would actually try to persuade you to use it.

>it'll be all the same people with the same names from here, so it just means moving to a different platform that does the same basic thing but with less useful features

>people can impersonate each other because there aren't tripcodes

>there's less shill protection because you won't have someone who can see IP hashes

>we can't have multiple threads about different topics

>this is meant to be a completely public disclosure

That's my opinion. So why do you think we should use Discord?

>>5309

Long time lurker from the start. This place works. Yall do good work. Don't leave a public forum for a private one. If this thing you guys are making is made in private it will be captured and used for evil. If it is public and free it can't be. Don't fix what's not broke.

>>5311

>they have access to your information anyway, just give it to them even easier

There's a difference between having all of your metadata funneled into NSA warehouses and having it sold to advertising companies. One you can't prevent and the other you can avoid by not going on those websites.

>Can they magically read more than they are here?

I don't understand the relevance.

>CAPITAL LETTERS FOR EMPHASIS

I hope you're not getting mad over this. I'm just trying to have a conversation with you.

>with voice capability

So it's less anonymous? That makes me want to use it less.

>Because we're getting so much more done so much faster due to the difference in platform and usage

How is being on a slightly different website getting anything done any faster?

>Because we're not concerned with working up a solid post.

What, do people actually care about whether their posts seem like they had effort put into them? This is an anonymous imageboard. Nobody's ever cared when people have made useless posts here in the past. Why would they start caring now?

>So that this isn't a bunch of individuals working in the loosest possible tandem by themselves.

How does 8ch force us to work as individuals? People work together on the same things all the time here.

>It's time to come together and wrap this shit up.

That isn't going to happen specifically because we started using Discord. In fact, splintering us and creating a space where we can forget about anons who potentially have useful ideas could quite easily slow us down.

This is the first I've heard of anyone using Discord as a supplement to this board so the fact that everyone thinks some of their posts aren't "complete enough" to post here is news to me. And it doesn't make any sense to me either. This entire time people have continually posted ideas they hadn't fleshed out yet and that nobody understood for a while. I still seriously don't see any reason why using Discord is a good idea that doesn't already apply to 8ch where we're already firmly established, where every post is public, and where people who don't pay attention very often know where to find us. Being secretive also really doesn't seem like a good idea to me. I won't and obviously can't really stop anyone from using it but you're yet to convince me.

>>5312

I'm glad someone agrees with me.

>>5313

Yep for sure. I, and another have been backing up all the work here. You know for a rainy day. I just don't understand the sudden heavy handed push to leave here. I think it is a bad idea at best and a trap at worst. Don't do it.

I'll be keeping my home base here, but I'm willing to check out Topol's "side oven" on Discord. My vote is for this board to remain the main HQ where ideas are being presented, discussed, and improved. We've accomplished a lot here, and I enjoy my daily routine of checking in and catching up on everyone's posts. One day we're all gonna meet up at Tony Stark's lab anyways, right? :)