asciilifeform: i am not convinced of there being involvement of 'things' : strings have not even the reality anchor of phlogiston.
asciilifeform: there is no separability of the political.
asciilifeform: ( the string orchestra not only dun give a flying fuck re parsimony, but quite the opposite , complexity cancer deliberately cultured, breeds grantolade for mediocrities )
asciilifeform: BingoBoingo: on one hand, yes, anally rebuked by pirates, knifed and thrown overboard. on other hand, i can think of worse fates than this, e.g. living 50 yrs 'uneventfully' in 'civilized' usgsuburbia
asciilifeform observes unrelatedly that aaaaalmost every in the lordship nao owns at least 1 FG☟︎
asciilifeform when saw the film, ended up rereading subj b00k and astonished to realize that david lynch made up the detail, herbert didn't have it☟︎
asciilifeform: mircea_popescu: but was the milk it was born from, from the cat-and-rat-system!!1
asciilifeform: trinque: 'SEC Chairman Jay Clayton disclosed late Wednesday that the agency learned in August 2017 that hackers may have exploited the 2016 incident for illegal insider-trading' << reminds of gox, 'hackers' and definitelynotnsa somehow☟︎
asciilifeform: in other lulz, spot welder - despite being made of the purest chinesium -- worx great
asciilifeform: '~All general-purpose modular reduction involves numerator- and denominator-dependent branches... ...includes modular reduction for elliptic curve arithmetic, in which the numerator is secret; and modular reduction for RSA, in which the numerator (plaintext message) or denominator (p, q) can be secret.'
asciilifeform: lobbes: will be unhappened exactly like every other time
asciilifeform: at least not one that doesn't bring the machine to its knees.
asciilifeform: d00d was right in his observation that you ~could~ use a normalizing/denormalizing ( though proof is still a first class bitch ) algo, IF you had a secret 1..ffawidth shift. but you don't.
asciilifeform: !~later tell apeloyee i studied your algo, it (aside from truly massive cost, that would annihilate savings from newton, or barrett, or just about any other trick) ~still leaks~, because shifting by >wordsize is a fundamentally different op from shifting <wordsize; and the only way for this to not be true is for all shifts to happen as a series of wordsize shifts; and a shift by ffawidth-1 (max shiftness) would then consist of ffawor☟︎
asciilifeform: pinoys finally replaced with actual mechanical shannonizer ?
asciilifeform: 'Without Core sabotaging BTC by artificially imposing the block size limit, bitcoin would be much more widely used today. Heck, countries like Venezuela might even have everyday citizens really using it to buy bread, milk, toilet paper. Many African countries could use it too.' << lol!!
asciilifeform: mine will also be log(bitness) if you shift(N, 1) , ... 2, ... 4 and mux appropriately, lol
asciilifeform: ( which likewise shifts for the entire bitness, every time )
asciilifeform: i can say immediately that if you 'secret shift' every time you want to modulus, you will take at least same number of steps as knuthian division.
asciilifeform: what part of 'can't branch on bits' was hard to understand ?
asciilifeform: and holy fuck you are COUNTING ZEROES
asciilifeform: apeloyee: i'd be curious to hear how intel will 'optimize' xor.☟︎
asciilifeform: fortunately we don't actually need any such thing in ffa. none of the algos require shifting by a seekrit bitness.
asciilifeform: e.g., N is a number to shift, Q is shift amt, R is result, S = l_shift(N, 1); mux(S, R, R, iszero(Q - 1)); S = l_shift(N, 1); mux(S, R, R, iszero(Q - 2)); ...... mux(S, R, R, iszero(Q - (width-1)))☟︎☟︎
asciilifeform: re shifter, on second thought you COULD shift bitness-1 (e.g. 4095 ) times and then mux EVERY TIME YOU SHIFT but omfg.
asciilifeform: if it can't be written down without any conditional (e.g. 'if' ) statements, and also -- for a given bitness -- unrolled into writing without ANY loops -- it is not permissible routine for ffa.
asciilifeform: ( normalization LOOKS AT SECRET BITS and therefore is forbidden anywhere in ffa for any reason )
asciilifeform: apeloyee: also if you know how to newton-raphson converge without ANY normalization ANYWHERE, plz to post.