log☇︎
2600+ entries in 0.362s
asciilifeform: !~later tell mod6 http://wotpaste.cascadianhacker.com/pastes/6WPk2/?raw=true << 2^n karatsubas, with same readability as 'classical'
mod6: just wondering if it could be a mechanical push, yet slightly more readable. maybe making 2^n version more grokable?
mod6: asciilifeform: so if you add back in the FZs that were removed in the 2^n version (re-adding in the 50% reduction of temp space that yields no opt.), do we get the ~runtime of the original?
asciilifeform: ^ for readers who wondered why karatsuba is the 1 routine in ffa ~not~ inlined... think.
mod6: that's it ^
shinohai: ^
BingoBoingo: ^ Moar Inca Pls
asciilifeform: well i thought of making a 3^n. but there's no reason not to say 'be a whole power of the machine BASE ' !
mircea_popescu: nobody is ever making non 2^n anyways!
asciilifeform: forcing 2^x = W, x in Z , also simplifies comba
mircea_popescu: and if your key isn't 2^n, further computers will wreak havoc on deployed code by requiring non-dividing Ns.
BingoBoingo: ^ Markets love ffa
mircea_popescu: diana_coman, hanbot, trinque, bingoboingo, mod6, danielpbarron, mike_c, asciilifeform, davout, ben_vulpes, phf, lobbes, mike_c, jurov, peterl, pete_dushenski ^
asciilifeform: ^ ar propaganda cartoon re 'malvinas', with 'fixed' sub
BingoBoingo: ^ Oh noes, he's gone again!
a111: Logged on 2017-07-16 20:11 asciilifeform: for anyone not tuned in : ^ computes factorial of 65536.
mod6: It's an ongoing project. The tickets are above, kinda outlines the idea ^
BingoBoingo: ^ Your periodic admonition to get NAND while possible
asciilifeform: claims ' Compute V <-- A^{-1} (mod M), in data-independent time.' in comments tho
asciilifeform: importantly, same roll MUST work for all possible m^d mod n params.
a111: Logged on 2017-08-10 18:16 shinohai: ^ That pthread issue I solved on Debian by going to /usr/share/cmake and changing a line in CheckIncludeFiles.cmake
edivad: this is under src ^
shinohai: ^ That pthread issue I solved on Debian by going to /usr/share/cmake and changing a line in CheckIncludeFiles.cmake ☟︎
shinohai: ^ looks good mod6
mircea_popescu: (and in any case, this is also a major improvement over gpg, which realloy only uses 2^16, and worked ok in the field for many years)
mircea_popescu: are you trying to say that since there's only 2^32 possible values for the crc, it then follows that 1 in 4bn will match ?
PeterL: also, my question re crc32 yesterday, I meant to say: given a (random) string of 250 chars, what is the proability that (random four byte string) will pass the crc32 test? which I think is just 1/256^4
asciilifeform: ^ p works same
mircea_popescu: for comparison, a 100 gram tennisball capable of giving a pretty girl a nasty bruise would be going sa 100 km/h and thereby hit for .1 * (100/3.6)^2/2 ~= 40 J over its 0.001 cubic metre space, ie about 40 times more than the jet's "acoustic attack". a 8-gram 9mm round perfectly capable of making a whole new hole hits for 0.008 * 300 ^ 2 / 2 = 360 J over its 20 * 2*4.5*pi = 5.65 * 10^-7 volume, ie about 650`000 times the jet's
mircea_popescu: for the record : a decibel is the log10 of the ratio between a measured sound energy density and 10^-12 J/m^3. consequently the energy of sound at 150 decibels (such as the sonic blast of a jet taking off at 25m, capable of rupturing eardrums) corresponds to an energy density of 10 ^ (150/10) * 10 ^ -12 = 1000 J/m^3.
asciilifeform: and division is O(N^2).
mircea_popescu: asciilifeform ^
mircea_popescu: heh. the graph of a ^ x mod b looks eheheheheeexactly like the riemann functions / unit covering shenanigans.
asciilifeform: ^ if asciilifeform is wrong here, folx, plz to write in !!
asciilifeform: mircea_popescu, phf , mod6 , et al ^^
mircea_popescu: (the rsa forgery comment was re sig ^ e mod n || sig mod n always verifies as validly signed.)
PeterL: asciilifeform: ^ what would be the downside of using crc for this?
PeterL: so if ^
PeterL: I thought it was only bad if m^e was less than n?
PeterL: c^d mod n = m, therefore m must be smaller than n?
a111: Logged on 2017-08-09 14:14 mircea_popescu: so you are telling me that m ^ e ^ d mod n always has an integer solution for randomly chosen parameters.
asciilifeform: http://btcbase.org/log/2017-08-09#1695799 << of course it does. rsa decrypt is c^d(mod n) , where c is ciphertext , n is public modulus, d is private exponent. ☝︎
PeterL: for your padding scheme above ^
PeterL: in " n / e^2 bits of entropy ", what are n and e, the key modulus and exponent?
mircea_popescu: and since we're apparently doing rsa likbez : if r used in padding above contributes less than n / e^2 bits of entropy to the final, padded message, coppersmith has a few words to tell you.
PeterL: if you have an encrypted text c, then c ^ d mod n will give an integer, without previously knowing m, how will you check for congruence?
mircea_popescu: this is the basis of rsa : m ^ e ^ d = m mod n
PeterL: oh, wait, no, I didn't see the extra ^ e in there
mircea_popescu: so you are telling me that m ^ e ^ d mod n always has an integer solution for randomly chosen parameters. ☟︎
asciilifeform: the O(N^2) algos cost moar then.
asciilifeform: ^ this matches observations of asciilifeform's naked eye, thus far.
asciilifeform: mircea_popescu: ^ famous incident
mircea_popescu: ^ sorry for teh delay. there's going to be a smg report next month, skipping the current.
a111: Logged on 2017-08-06 20:46 mod6: 'One broker said a mortgage-free homeowner with a house valued at £10m had taken out a fixed-rate loan of just under £2m to buy bitcoin, ...' ^
asciilifeform: ^somewhere in there
mod6: 'One broker said a mortgage-free homeowner with a house valued at £10m had taken out a fixed-rate loan of just under £2m to buy bitcoin, ...' ^ ☟︎
asciilifeform: ^ whole debug log since t=0
phf: binds bunch of keys to "users come to expect", including tab completion to ^I
BingoBoingo: ^ Gubanatorial score is 34 GOP, 15 Pantsuit, one Weird
asciilifeform: ^ re 'arresthire' d00d
mircea_popescu: ^
mircea_popescu: ^ very much recommended for audit, this, btw. oldest system known to man, ticker tape, for telegraph and stock exchange. still unbeaten.
shinohai: ^
trinque: ^ obviously comments welcome.
mod6: yah ^ also having issues
a111: Logged on 2017-08-03 03:39 asciilifeform: phf ^ is he one of yours ?
asciilifeform: phf ^ is he one of yours ? ☟︎
asciilifeform: ^
asciilifeform: ^ achtung pete_dushenski et al
f1maze: at least I dont join/part as much as the deep book^
phf: ^
asciilifeform: but in point of fact, no joak, you dun need ANY moar of an os than ^ above, to do usefulwork.
f1maze: needs peer review I'd imagine^^
BingoBoingo: ^ MEGA thoroughput increase
asciilifeform: ^ minimal x86 'os' in c.
mircea_popescu: ^ perhaps of interest to his worship danielpbarron
BingoBoingo: <asciilifeform> ^ what even means to have an 'exchange rate' for a shitcoin where nobody can mine a block ? how do you MOVE it << Comments section is for the lulling about their insufficiency
asciilifeform: ^ what even means to have an 'exchange rate' for a shitcoin where nobody can mine a block ? how do you MOVE it
asciilifeform: ^ subj
mod6: ^
shinohai: ^
mod6: ^
shinohai: Haha Sherrif Joe is contemptible ^.^
phf: ^
mircea_popescu: ^ history of "gender relations" to date.
shinohai: !~later tell finitemaz See the above in response to your PM ^
ag3nt_zer0: ben_vulpes ^
asciilifeform: ^ would have made sense to, e.g., mark twain.
mod6: i reversed the bytes of the script ^
mod6: bah, ignore this ^
BingoBoingo: ^ Dos historias, un titulo
asciilifeform: ^ has some favourites of asciilifeform's.
asciilifeform: ^ ethertards cleaned again
asciilifeform: mircea_popescu ^
a111: Logged on 2017-07-22 23:50 mircea_popescu: trinque ^ ?
asciilifeform: ^ foundational moment of modern toxicology
mircea_popescu: trinque ^ ? ☟︎
asciilifeform: ^ searchable, too.
asciilifeform: ^ some huawei rubbish or other
mircea_popescu: ^ in celebration of the "recent events" that... weren't.