asciilifeform: upstack re pow item : i'ma leave an observation for mircea_popescu ( and others, but he's prolly the one to crack this nut properly ) . consider how in classical bitcoin , pow is used for 2 entirely different and quite orthogonal items : initialcoindistribution, and rewindprotection (i.e. preventing history-rewriting) . it's a bulldog-rhinoceros. so q is, suppose that coin distribution somehow took place at t==0. do you still need po
asciilifeform: ( it is specifically a pill against 'can recognize work done by itself as opposed to work done by others' aspect )☟︎
asciilifeform: upstack in re 'mining is a bug' , asciilifeform has a theoretical pill, potentially interesting , but will chew on it for some weeks -- there's gotta be a catch
asciilifeform: btw that french aks is geological. n==11701 has been running for 10+ minutes, and is on ~9600; author's code indicates that answer appears at iteration 1000000007. that'd be 723 days on this box.☟︎
asciilifeform: and we don't know how the shit-dust comes back together to form what gpg thought was primes
asciilifeform: only to a numbers that are factors of 2 or moar moduli. and they dun come with any certificate of primality, except for the smallest 'dust' ones
asciilifeform: so from that pov i have no access to the original p,q that gpg may have generated, for any of the keys
asciilifeform: phuctor finds a divisor. if it is toobig for sieving, i'm left with m-r, when asking whether it is a ~prime~ divisor.
asciilifeform: the only 1 with factors sized somewhere near half the bitness of the modulus, other than the khadeer key ( which had P == nextprime(Q) , which dun fit the bill )
asciilifeform: mircea_popescu: the only 1 that might fit the shape of this item is the german 'research key' one
asciilifeform: esthlos: point is , there exists a guaranteed-correct algo. using it, supposing it were practical, is The One Right Thing
asciilifeform: even something with, e.g., 6 month, run time, can be useful. ( esp. if parallelizable )
asciilifeform: btw if esthlos ( or anyone else, anywhere ) knows how to aks on 2048b primes in nongeological time, i'll happily port their algo to ffa, even if original is in cobol
asciilifeform recommends that n00bz write own, from scratch, without looking even at mine
asciilifeform: ben_vulpes had something resembling a CL one
asciilifeform: ( where asciilifeform observed that, for serious battlefield key, a month of pre-use m-r, plus a box doing it continuously ~4evah , is not excessive )