Nope, being confined to a crappy netbook doesn't help either. Seriously considering buying a new laptop tomorrow just to use it for xmas…
Guess I have high standards. Only so much you can do with two 1.65GHz cores on any OS, but I imagine it would be unusable with Windows on it
The problem with running up the ladder is its still too slow for RSA numbers even if we skip over a lot of steps.
My thinking is the big_n hint which should be "simple to calculate" could be a maximum bound, hopefully not too much larger than n, and we could go backwards from there instead? Anyone figured out what big_n is supposed to be?
I tested a few variants of this earlier on the RSA100 example (since we have the whole solution for it and can also create row one) and found the increases really useless after getting up to around a values of ~20 digits or so. This was with jumping to next factors only, not every t value. But I didn't verify my code properly so I may have fucked up
I envy your dedication. I have some half-finished code to just brute force generate every possible formula ever into an abstract syntax tree and compile that to code, and some basic ideas for verification against the grid. Feels a bit like cheating TBH, but hey. Just print a list of formulas with 99% coverage for each symbol after.
Also considered throwing genetic programming at it, but then even if we get a solution, deciphering that program would be even harder than what we're already doing.
I did check some of your generation code against the VQC code for some large grids with no problems. Haven't been able to work as much for the last few days just cause shitty netbook.
Mostly I just didn't verify my own implementations as much as I should cause now I doubt some of the tests I ran. Writing checks into the code is a good idea
The difficult relationships is why I'm at the stage of wanting to throw insane computing power at it and have it just tell me the good results :)
Side note, if you just bruteforced every possible formula, how would you check that against the grid, aside from matching every value in every record and counting results? I feel it needs some jump logic too based on the latest progress here.
Obviously we're sticking around till TheEnd :)
This may be stupid, but since you're obviously much better at geometry, have you tried turning the squares into triangles and then doing things to the resulting triangles?
Like, I don't know, this is a bit over my head, calculate the h^2 square of a triangle?
https:// en.wikipedia.org/wiki/Geometric_mean_theorem
Hopefully this is inspiration and not complete lunacy
I did some basics as well but kinda ran into a dead end using formulas I didn't understand properly and went back to other stuff. But the altitude of a right-angle triangle may be a useful variable.
And as posted above somewhere, triangular numbers are also relevant somehow (sorry I suck at this part)
Please be warned that this might be a big rabbit hole as I haven't managed to find any useful correlations to the grid myself. I am not smart enough to prove it is a dead end yet
No worries, posted worse mistakes already :)
But I have to second PMA's suggestion for notations, would be way easier if we agreed on something. My f_t thing just felt convenient for replying to you.
Maybe something for moving between records is needed? First idea (please improve it)
orig.e
orig.n
formula (f, whatever)
new.e
new.n
Not saying dot notation is the best and will be happy to use whatever as long as its consistent :)
Though it does suit us programmers
The formatting in my post is kinda verbose though, we could do p for prev and n for next (confusing?)
formulap.e = 0 p.n = 0 n.e = 0 n.n = 0
But prev and next is still bad if we want to do more than one jump. Maybe
formulae[0] = 0 n[0] = 0e[1] = 0 n[1] = 0
Just suggestions for now
Or we could keep the original notation and do something like this (yes I am to lazy to make real examples){0:0:0:0:0:0}formula{0:0:0:0:0:0}{0:0:0:0:0:0}{0:0:0:0:0:0}formula{0:0:0:0:0:0}{0:0:0:0:0:0}
But we may want 7 dimensions not 6, so if we're going for this one we need to agree on a position for t
Figured not voting would count as don't care/let him stay but guess not. Quiet here without him
These are weird
For odd n, they appear to be the same as in row one (next.a = prev.b){0:3:12:6:6:24=144}{0:3:36:12:24:54=1296}{0:3:72:18:54:96=5184}
For even n, this makes no sense yet. Sometimes there are two interleaved patterns{0:6:9:6:3:27=81} - pattern 1{0:6:24:12:12:48=576} - pattern2{0:6:45:18:27:75=2025} - pattern1{0:6:72:24:48:108=5184} - pattern2{0:12:18:12:6:54=324} - p1{0:12:48:24:24:96=2304} - p2{0:12:90:36:54:150=8100} - p1{0:12:144:48:96:216=20736} - p2
Sometimes more{0:8:5:4:1:25=25}{0:8:12:8:4:36=144} - p1{0:8:21:12:9:49=441} - p2{0:8:32:16:16:64=1024} - p3{0:8:45:20:25:81=2025} - p4{0:8:60:24:36:100=3600} - p1{0:8:77:28:49:121=5929} - p2{0:8:96:32:64:144=9216} - p3{0:8:117:36:81:169=13689} - p4
Thank you, this is great! The crypto stuff may not be 100% on point but its really good - we need more of this
And Sneakers just replaced Go For It (1983) as my all time favorite movie.. how did I miss this gem?
If pic related doesn't convince you to watch it, there are some amazing quotes about the NSA, FBI, clowns, fake NASA moon landings, cattle mutilations and the Kennedy assasination as well :)
That this was made in 92 blows my mind