Good morning team.
The two clock/watch posts by Q held major significance to me.
Only NSA or similar could know that.
Too much to be coincidence.
Today, trivial look-ups.
March 29th, non-trivial look-ups.
God so loved us, that he gave His only begotten Son.
Bladerunner
Completely broken and defeated.
Heard the speech by POTUS.
Saw Q's post.
Saw Top's post.
Read replies.
Saw your post.
Faith restored.
Now I could rip the ears of Jennifer Garner, bless her.
Thank you.
I'll be online after breakfast UK time.
Time to man up.
WWG1WGA.
Highlander II
Trivial look-ups.
These are the set of rules and equations that get you where you need to be in the grid.
You know most of these but it is useful to have these stated clearly as libraries and they are required for the non-trivial lookups.
These primarily focus on navigation bi-directionally across row n=1 and within a cell at [-f,n] and [e,n].
Indexing a position in a cell can be done with a third variable, t. t is related to x but is a less ambiguous choice since x can be odd or even depending on e.
Negative values of t can be thought of as valid, values of t that are derived from imaginary numbers can be thought of as orthogonal to the grid.
If the internet goes off today, it appears that DECLAS is about to begin, hence why today and the 29th make sense.
Cover.
Archive offline.
I'll be using small and very large integers to demonstrate so have your BigInteger library ready to follow!
Two Lookup methods.
Trivial
Non-trivial.
LookupT(BigInteger c) returns t, e, f;
LookupN(t, e, f) returns n; -1 for prime, 0 for square
LookupT is used by LookupN.
LookupT is a summary of where we are plus hints about why non-trivial lookups haven't been public.
There are several ways of categorizing integers. We'll be looking at the minimum two types we need. Those with odd remainders after removing the largest square, and those with even.
We will use columns -f,0,1 and e; rows 1, (n-1), n, X, Y and C
Column 0 contains the square of c.
X and Y are the positions of n between 1 and the square of c. X and Y will not exist for primes (that depends on the value of f and d). The work we did with triangles will show which integers are primes.
It's going to reasonably short today.
I will supply all code.
You already know the trivial parts.
This will simplify all that we have discussed.
The non-trivial method on the 29th that return n, is even shorter.
The discussions after you have that can go on as much as you like.
I suspect the DECLAS might imply the non-trivial method is known but would be classified.
Since I don't know this to be the case, disclosing it doesn't violate any laws.
I'll jump from VPN phone to laptop after family lunch, so I can type more and include pics.
Have a bit more time on this.
At [e,1] you have d[1],d[2],..
The root of c is d.
The root d is between two values in the set of d at [e,1].
Same at [-f,1]
All values in the cells at n=1 are products where you add a small square to e to make a square with c.
Suggest you look at this with a large (known) example like rsa100 to try and generalise.
The information at -f,1 and e,1 gives you something very important for the non-trivial Lookup, remembering we're looking for n-1, and n