Can you explain yourself better? What is 'Ygrid' ?
Ygrid is the second coordinate of the GPU thread array.
It affects performance. This is very useful for linear algebra because you can use thread coordinates to make fast matrix calculus.
In our case, this is just used to tune performance.
Thanks.
About using an experience of previous work.
----
So as you can see an experience didn`t help to solve next pazzle faster.
Most likely because the range is increased by 32 times in the next puzzle, and all DPs are concentrated at the very beginning of the range. Perhaps experience can help in solving the next range, but not after 5 bits.
And here is result of 3 test randomly generated keys in range 64bit and with experience from the puzzle 79:
...
In all three cases, experience helped me find the key faster.
The result is that experience helps you find the key in the current range or in the previous one, but it is absolutely useless to search in the following range that is multiple large to the current one.
In other words, in order to solve the puzzle faster you need to move from end to beginning .. first 125, then 120, then 115 and then 110))
There is a way to reuse the same DP's set in a different range.
If you have DPs in range [1,...,2^109] and you need DPs in [1,...,2^114], it is enough to
transform [1, ..., 2^114] into [1/32, 2*1/32, 3*1/32, ...., 2^114 *1 / 32 = 2^109] (a 'contraction')
where 1/32 means 32^-1 mod N. There are always 2^114 elements, and the public key P becomes P'= 1/32 * P and lies in the same interval.
You can see [1/32, 2*1/32, 3*1/32, ...., 2^114 *1 / 32 = 2^109] as the set of the private keys respect of G,
or the same points set can be represented as [1,...,2^114]', the set of the private keys respect of G' = 1/32 * G
In this way the DPs are spread uniformly in the interval [1, ..., 2^114]'. The private key of each DP respect of G' is the previous private key * 32.
You have to modify the jumps too, instead of +r*G you have to perform +r*G', where G' = (1/32) * G.
Then you will find the private key k' of P' respect of G', that is the same private key k of P respect of G.
Basically so far we have used only the 'translation' of the interval, but we can use a 'expansion/contraction' too.
You have a 100 GPU ? Hahahahahaha
