>>4242

Welcome back indeed, we missed you

>>3927

This post from Teach seems relevant now, but we're generating smaller triangles from the tree and taking the product of 8 of them, interesting.

My thinking is we use the first d branch as one side, and the first e branch as the other, adding up all the lower branches. Are we going all the way to the bottom of the tree or is there some condition to stop on? I ask because we have a few different variations of the generation code, mainly related to how many leafs are generated for the lower branches and where to end.

If we don't have to go to the bottom this is irrelevant but if every value is included in the calculation we need to make sure we have the correct tree. Attached two examples.

Looking forward to some more progress here

>>4219

>What does this look like?

Hmm…

>>4332

>f mod 8 = 4

Isn't this supposed to be (f - 2) % 8 = 4?

>>4342

>>4343

Thank you, feels like we're really close now, still digesting the geometry bit

>>4348

Checks out here too, always good to have your screenshots to debug code against! Heres a python example for those wanting to play alongfrom gmpy2 import mpz, isqrt, isqrt_rem, t_div_2expdef tri(bs): return t_div_2exp(bs ** 2 + bs, 1)def tri_n_odd(bs, c, d): return isqrt(tri(bs) * 8 + 1 + c) - dc = mpz(1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139)d, e = isqrt_rem(c)x = mpz(1045343918457591589480700584038743164339470261995)n = mpz(14387588531011964456730684619177102985211280936)print(n)print(tri_n_odd((x + n) // 2, c, d))

>>4351

Here is a pure python version in case the gmpy2 dependency is inconvenient. I really recommend it though.

The fixed point decimal module is annoying for what we're doing but it'll give you arbitrary precision square roots when needed. Its also much slower and uglier as the precision has to be specified beforehand, and using the length of c is probably overkill since we're rounding back to integers but whatever.import decimaldef sqrt(n): return int(decimal.Decimal(n).sqrt().quantize(1))def tri(bs): return (bs 2 + bs) // 2def tri_n_odd(bs, c, d): return sqrt(tri(bs) * 8 + 1 + c) - dc = 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139ctx = decimal.getcontext()ctx.rounding = decimal.ROUND_FLOORctx.prec = len(str(c))d = sqrt(c)e = c - (d 2)x = 1045343918457591589480700584038743164339470261995n = 14387588531011964456730684619177102985211280936print(n)print(tri_n_odd((x + n) // 2, c, d))

>>4346

Right? Also, there can never be enough programmers!

>>4355

Welcome back Hobo! Haven't seen you in a while

As someone who learns best by myself instead of taking classes I'm probably not qualified but am gonna give you some unsolicited advice anyway. I'm sure half the people here will disagree with some of it too.

Learning to code is a long game and having an intuitive understanding of logic is almost a prerequisite (I think VA is covered on this one already). More importantly, having a vision of what you want to accomplish and smaller goals on the way there is neccesary, or you will get frustrated and bored on the way. I know I would rip my hair out going through a tutorial for writing a simple database program if I didn't have an end goal for what to use that database for. This is how many programming classes are laid out today and is a very efficient way of learning IMO.

There are tons of basics that are useful to know and will make you a better programmer, but they are not neccesarily something you have to know from the beginning. Coding anything more advanced than 1+1 is a process of failing and trying again. Fail often and learn from your mistakes. Without this mindset you'll get irritated and give up. Most of what me, PMA, CA and Teach has posted here probably have at least a hundred failed attempts with syntax errors, infinite loops and fucked up math in them - you only see the working results.

For my first point, wanting to build a Virtual Quantum Computer is an awesome goal but I don't think you'll find a programming 101 course on it, and asking a professor how to factor huge numbers is not going to get you a good start (GNFS is not something for your first program). In many ways the math here is waaay easier, so a VQC might not be a bad first project if you take it in stages. Recursion is not a beginner subject either, so generating the tree is probably not a good idea to start with either. Given the latest hints we may not actually need it for the RSA part though.

Just making a program that prints e and d from c , without copy pasting our code should get you some motivation to go further, more than printing "Hello World" will.

The other big choice is what programming language to go with, and this comes down to individual preference and practicality rather than a fixed answer. This thread has at least C, C#, Java, JavaScript, Rust and python in it, and we're all comfortable reading eachothers code to a degree.

Feel free to ask if you have questions, but we may want to create a new thread for it to not clutter up this one!

>>4359

Oh I've read it and been working on that on the side. The first reaction is gonna be "you guys are full of shit", even for the math people. We can't even explain this ourselves before solving it, but I'm building some stuff to prepare. Teach has the right idea with his iFactor program (even if the iThing part ruins it)

I think the best way is distributing a self-contained HTML/JS file in notebook format explaining each step, with graphical factorization (exactly like >>4287 but fancier). First some examples for each step with small numbers letting you hit buttons to factorize them. I think we can add real time lines showing the current searching within the triangles for extra coolness.

Then all the unbroken RSA challenges where you can just hit start it'll go down the list cracking all of them in milliseconds (using fucking javascript, lol) and showing a video-game like money earned counter for the ones that have rewards, with a cha-ching sound effect :D

Then for the real doubters, have a text box for pasting a public key and hitting the factor button…

If we get there, we can have a similar thing to the RSA numbers, starting at the largest known prime number and a "find next" button… Iterating is too slow even with our algorithms (40 sec vs ~1 month for checking if number is prime), but its looking like we could just calculate the next one up directly… Will still take months to verify but when they check out that'll blow some minds too!

Then we just drop a single .html file on IPFS and link it everywhere…

>>4362

Have you been actually working on the math all this time in addition to posting memes and awesome art? Holy shit dude. Forget out-of-the-box thinking, you keep dividing the hypercube by zero and coming up with answers, can I have some of your drugs please?

>>4364

Fuck yeah, KEK approves! Awaiting the C# code that prints e and d! You can steal VQC's sqrt code since that is boring and hard anyway. A good programmer knows when not to reinvent the wheel!

>>4367

Good idea - all of that is possible in JS and would fit right in after the demos on small numbers.

IPFS is P2P and you should probably use a proxy when uploading it, but the file will be stored there permanently afterwards. There are public gateways so we could just link https://ipfs.io/ipfs/<hashfor example, so you don't have to install anything to access it. When the file is uploaded it should be accessible through any of them. The file needs to be complete because we can't update it. We could always include a link to somewhere else but updating that site afterwards is risky.

Hosting html on YouTube is not really possible. github.io is an alternative but relies on an american company. Better ideas are welcome.

>>4372

I see. Videos would be great but does mean we have to make them, this is not really my kind of thing. Can always use vocoders for the audio too but someone has to come up with good, short explanations then! I have trouble explaining some of it to myself even

Will complement an interactive text version really well. Include the video at the beginning if we can. Leaving you in charge of this project

>>4373

Of course coding is fun (most of the time), glad to inspire you! Have added my own gratitude to yours and sent gratitude+love^2 to this whole board and Q

>>4376

Cool as shit.. so the fire poi video earlier is you? Awesome

>>4382

Great stuff. Since your programming skills hacked my tripcode already I'm gonna go ahead and post a new one… mm'kay