>>6726

Thanks! Its great to see you posting more often, and I really appreciate the guidance.

I'm personally very interested in your path VQC. I have so many questions - may I ask a few?

Based on the date of the youtube post, you obviously discovered this years ago - what happened when you first found this solution?

Were you working in university research? NZ, I assume, at the time? How did your peers and superiors respond?

I imagine many people would go very far to get their hands on this. Were you safe, or at risk?

I'm really very curious about your story.

I understand that many of these questions you may not be able to answer. But thank you!

>>6728

I've read your post GA, still trying to process it into what it means. I'll definitely continue to think on it.

Sorry that I have nothing to add on this at the moment, great post though :)

>>6723

I couldn't imagine this community without you Topol.

Thanks for defending all of us.

>>6730

Thank you for your thoughts. I've been here in spirit! But I too missed being part of this math family, I missed you all!

>>6772

Thats where I went with it too.

I actually share a homeland with someone who has been in exactly that situation…

I guess my next thought is, of all the people in the world, who knows this algorithm? Just 1 person? Any governments? Or NSA/military?

What do you think Topol?

>>6769

Hey PMA! The d[t] pattern is found in (0,1), but the a[t] pattern repeats!

Each n = a perfect square ((0,1), (0,4), (0,9)…), a[t] is 2 * a square.

>>6774

Looking forward to the process. Thank you.

>>6775

I've thought about this so much. If other people know, how many and how is it kept secret? Military organizations are structured in a way that embeds secrecy, so I can understand those groups, as I can secret organizations. But in the business sector, I really have no idea.

But if John knew (>>6776), then it's likely others have known over time.

>>6777

I wonder if we can anonymously update the wikipedia page via vpn's or tor or a public wifi access point. A starbucks in a major city would be pretty anonymous.

>>6776

Thanks for sharing this.

I'm really curious about the religious connections, but I'm very ignorant about religion unfortunately. Your quotes from Revelations took me down a research path, one that I intend to continue. One of the things I found interesting was the etymology of apocalypse - "to uncover".

Do you have any info you could share on following your interpretation of binary in Revelations?

>>6789

I love it.

>>6791

I don't at the moment, should I? Am I missing much over there?

>>6790

Yep, good find.

I think this has to do with another link, I'll try my best to describe it:

• in (0, 1) we know a[t] = tt2.

• we also know how to "move" up and down (0,1) whereby t=p+t (I think thats the equation… please correct me if i'm off-by-one)

• This means that if we try to find all the a[t] that are divisible by 3, we can simply list:

t = 3, 6, 9, 12, etc.

• This means that at (0,9) for example, we'll see the x[t] values are equal to the x[t] values in (0,1) at t = 3, 6, 9, etc.

>>6792

I'm trying to follow this one, but i'm missing something, can you give an example or something PMA?

>>6795

What type of unique thing?

keys? signature?

>>6797

lol, ifagfactor ;) I'm going to change the name.

>>6798

gotcha, thanks guys!

ok, so part 1 of my discord verification is the image.

The one I will send on discord to Ta.io will be over 5000 times larger for c!

>>6804

>O_o coulda just cut that one in half… lol

oops

Ok, so I was investigating d[t] at (0,n) and its relationship to triangle numbers…

so, lets say we're at n = 15, what are the set of d[t]?

which rows are in (0,1) have 15 as a factor?

start with t = 16:

t=16: a = 450 = 21515 x = 30 = 215 d = ( 15 +1)( 15)2

t=31: a = 1800 = 421515 x = 60 = 2215 d = (215 +1)(215)2

t=46: a = 4050 = 921515 x = 90 = 3215 d = (315 +1)(315)2

t=51: a = 7200 = 1621515 x = 120 = 4215 d = (415 +1)(415)2

move to (0,15):

t= 1: a = 30 = 215 x = 30 = 215 d = 2215 *1

t= 2: a = 120 = 4215 x = 60 = 2215 d = 2215 *3

t= 3: a = 270 = 9215 x = 90 = 3215 d = 2215 *6

t= 4: a = 480 = 16215 x = 120 = 4215 d = 2215 *10

What this is all saying is, for odd n, d[t] = n4T(t)

>>6820

Thanks VQC.

>>6819

>>6821

Well said Hobo. I agree with you.

I'm glad we're talking about this, I'd love to continue the conversation further about how to use this for good, and not cause total destruction in the process.

I've been following the NIST post-quantum crypto RFP: https://csrc.nist.gov/Projects/Post-Quantum-Cryptography/Round-1-Submissions

and: https://en.wikipedia.org/wiki/Post-Quantum_Cryptography_Standardization

My fear is that all the world's data will be hackable until we have better crypto, and I'm not sure we have anything that is proven to be secure yet.

>>6824

>As an exercise, can you find BigN-1 in column -f in terms of t? This is unfair as I said I would walkthrough but need to balance a wife who has gone the extra mile and patient anons.

Family first.

even d:

t = d/2 + 1

odd d:

t = (d+1)/2

I think this is right?

>>6825

To clarify, this is the t in (-f, 1) at which a[t] = N-1… I think thats what you meant?

New "coincidence" I found that I think we haven't spoken about:

In (e,1) at a[t] = nb

x[t] = x+2n

d+x[t] = a+2x+2n = b