chk'd!i! ..and inching closer!
lulz, multipersona anons.
Hilarious TG!
Agreed, was going to do a search earlier on topic of "algorithm for squaring massive numbers", but was in the general.
gut tells me 12 is a key to this. Why I posted that 12X spiral (w/ primes only on 4 rays, so eliminates 3/4 of options) and then the Squares with 3 entrances on each side (temple layouts). But that's just me letting intuition flow (which i trust)
gotta read that again, interesting.
Nice!!
wasn't me.
That's awesome MA!
^^ This was me. Probably doxxed myself using word 'folks' anyway.
Was trying not to overdo the name and tripfagging unless had something mathy to offer. Have had some other immediate priorities so haven't been able to focus and digest everything to level needed to actually be contributing.
Finally got resume updated and should be writing more cover letters tonight instead of hanging with you fags!
VQC, please take note, that this collective effort is a real testament to individuals showing faith: strong or unshakeable belief in something, esp without proof or evidence.
Ok, went ahead and came up with a query for a quick search, here's the second result in the list, has several algorithms including pseudo code, pdf here:
https:/ /www.hindawi.com/journals/jam/2014/107109/
Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications
2014, Shahram Jahani, Azman Samsudin, and Kumbakonam Govindarajan Subramanian
School of Computer Sciences, Universiti Sains
Abstract
Public-key cryptosystems are broadly employed to provide security for digital information. Improving the efficiency of public-key cryptosystem through speeding up calculation and using fewer resources are among the main goals of cryptography research. In this paper, we introduce new symbols extracted from binary representation of integers called Big-ones. We present a modified version of the classical multiplication and squaring algorithms based on the Big-ones to improve the efficiency of big integer multiplication and squaring in number theory based cryptosystems. Compared to the adopted classical and Karatsuba multiplication algorithms for squaring, the proposed squaring algorithm is 2 to 3.7 and 7.9 to 2.5 times faster for squaring 32-bit and 8-Kbit numbers, respectively. The proposed multiplication algorithm is also 2.3 to 3.9 and 7 to 2.4 times faster for multiplying 32-bit and 8-Kbit numbers, respectively. The number theory based cryptosystems, which are operating in the range of 1-Kbit to 4-Kbit integers, are directly benefited from the proposed method since multiplication and squaring are the main operations in most of these systems.
Did some searches on Fermat primes and other stuff early on as well. You all were starting to generate some patterns earlier to what I found, would have to look back.