now my is stable up to 252 bit. and yours? Ps. of course you have script, becouse it is math, the problem is with precision , and it depends form kind of algo you will use, sometimes must be somethng changing, but you have not ansered, what kind algo? if you don;t know then you have use one of google scipt.
my task:)
Did you write something about algorithm in your own script? Why I have to uncover my mathematical poetry? my task:)
But ok, this is not secret - algorithm is well known lattice reduction, that was already mentioned on this forum. It works perfectly with only 4 known bits of nonces (yes, 252 bit) and any private key length. I don't know why you also required reduced private keys.
Also I don't understand what a problem you mentioned with different nonce sizes. If all of nonces is beetween 2**1 and 2**240 then it is obviously that we know that first 16 bits are zeroes - this is enough for construct the matrices, and other 240 bits do not matter whether there are zeros or not.
This code is very close to my own.