asciilifeform: i ought not to do these before breakfast.
asciilifeform: while it boils : btw log readers can ignore the earlier arithm, it is entirely off ( asciilifeform computed r * 2^s = n instead of r * 2^s = n - 1 ... )
asciilifeform: to redo the earlier munged example: bin(12) == 1100. s = 2. r = 3. (n - 1)^r mod n == (12 - 1)^3 mod 12 == 11^3 mod 12 == 11, i.e. n - 1. witness.
asciilifeform: diana_coman: r = 3 indeed. (n - 1)^r mod n == 11^3 mod 12 == 11 == n - 1.
asciilifeform still waking up, will have tea and ~then~ come back to item
asciilifeform: diana_coman: it's a witness for some numbers. like erry other witness-for-some-numbers.
asciilifeform: diana_coman: correct. in implementations where a is forced to <= n - 2, n - 1 is excluded
asciilifeform: it makes sense to exclude a=0 and a=1, they give no useful information. but a = n - 1 gives.
asciilifeform: i.e. case where a^r mod n = 1 or n - 1 .
asciilifeform: diana_coman: 'nothing to do' is because it's a legit witness! algo returns 'prime'. ( and in non-constanttime incarnations, this is the ideal, shortcut case in fact )
asciilifeform: from asciilifeform's surface inspection, place wasn't exactly swarming with either. then again mebbe they all were in the fu ajedrez
asciilifeform: so algo is then obv.: 1) obtain pies 2) treat the kraut 3) win the 1200 ...
asciilifeform: BingoBoingo: i dun think i could resist the temptation . and whoknows, maybe yer schubert eats 1 too many magick pies that day , and loses
asciilifeform: seems like ~50% of the various lit blindly copies the n - 2 thing , also
asciilifeform: ( and in fact all that's req'd of witness is that it be coprime with n )
asciilifeform: mostly unrelatedly -- while diana_coman is awake -- diana_coman can you think of why vanstone et al give n - 2 upper bound for m-r witness ? cuz by theorem, it's good through n - 1
asciilifeform: ( naggum also had a thing re 'for fucks sake clean up the kitchen' )
asciilifeform: folx wanking over hypothetical 'moar trustless' protocols etc. while happily snarfing up openssl , cpp, etc., are a peculiarly anglotardian sort of head-stander
asciilifeform: diana_coman: by same token, a perpetuum mobile is also 'better' engine, dun need to fuel it. the 1 problem is that where do you get one.
asciilifeform: beetcoin: consider, the 'bitcoin komyooniti' had full decade nao to remove the 'wtf do these cpp turds even DO in all possible boundary conditions' from the list of unknowns. and did they ?
asciilifeform: how's this work ? built own comp, wrote own client... ?
asciilifeform: i cannot resist to bite -- beetcoin , wtf is 'trustlessness' ?
asciilifeform: characteristically, even ~these~ used to be moar interesting, imho -- back when the breakage was at least sometimes subtle
asciilifeform: this here aint even 'feminine', closer to... prikokine
asciilifeform: 'i have maffs phd, where do i go to maffs for moneys' 'hey we have this here opening... all you gotta do is shill for quantum-resistant philosopher's stones with boneh' 'where do i sign' etc
asciilifeform: mircea_popescu: lotsa examples of these zombies, e.g.,
asciilifeform: i thought the notion being pushed is hilarious tho. 'who cares if yer litmus doesn't work on 561, it aint like you ever need to verify whether 561 is prime' etc
