21500+ entries in 0.218s
a111: Logged on 2017-10-07 22:39 phf:
http://btcbase.org/log/2017-10-07#1722379 << this is probably true but only because ffa mutates an array of bigits, where's any language level bignum system produces a whole new one for each operation
a111: Logged on 2017-10-07 21:48 apeloyee:
http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-prime-fit-in-your-primorial and find what number of primorial is congruent to it using chinese remainder theorem
a111: Logged on 2017-10-07 21:14 apeloyee:
http://btcbase.org/log/2017-10-07#1722289 << and the point of doing karatsuba is? you do 2 recursive calls to Mul_Karatsuba_TopOnly and one to Mul_Karatsuba. should've simply calculated upper_part(XLo*YHi), upper_part(YLo*XHi) and XHi*YHi
a111: Logged on 2017-10-07 19:28 asciilifeform:
http://btcbase.org/log/2017-10-07#1722358 << point was exactly to compare like items. i.e. heathendom does NOT get to 'win' by 'oh hey the hamming weight of exponent is only 2, not 4096, so we only do 4 modexps and not 8192'
apeloyee:
http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-prime-fit-in-your-primorial and find what number of primorial is congruent to it using chinese remainder theorem
☝︎☟︎☟︎☟︎☟︎☟︎ a111: Logged on 2017-10-07 19:28 asciilifeform:
http://btcbase.org/log/2017-10-07#1722358 << point was exactly to compare like items. i.e. heathendom does NOT get to 'win' by 'oh hey the hamming weight of exponent is only 2, not 4096, so we only do 4 modexps and not 8192'
mod6:
<+asciilifeform> out of curiosity, how long the py item takes on mod6's box ?
<< was just saving... lemme give it a try here. want me to try it on the i5/8gb box ?
mod6: while b /= 0: r
<-- a mod b, a
<-- b, b
<-- r. return (a).
mod6:
<+asciilifeform> mod6: this is the most brutal possible method that can still be called barrett : didn't even make use yet of the fact that we only want the upper halves of the mul results
<< spent the afternoon looking through your changes posted today vs.
http://btcbase.org/log/2017-10-02#1719721 ☝︎ mircea_popescu: "In case you did, i hope this will be a lesson to you. Stop trading obscure tokens/coins!"
<< if THIS is "the lesson", then one wonders wtf is supposed to be the "ethereum value proposition" ?
BingoBoingo:
<asciilifeform> poorly porous to us, but theoretically even moar so to pantsuit
<< Appeal of jungle is non-interference in white man's affairs. Downside is shifting past marketing speak to discover "1GBP/s unmetered (30Mb/s international)"
☟︎ mircea_popescu:
<mp> pai am si ramas. adica : cind bate vint au problema cablurile, cind is nori incarcati are problema radio si cind is densi are problema satelitye uplink. intre cele trei m-o tot chitait doua zile de am cedat nervos si m-am dus sa ma culc ieri
mircea_popescu: eh, fuck the works. lemme quote from minigame boardroom :
<dc> aia, am crezut ca na, ai ramas si fara net de la vanturi alea
BingoBoingo:
<mircea_popescu> iirc BingoBoingo was pounding the arabs/sw azns.
<< For some definitions of pounding, perhaps other definitions later
mircea_popescu:
http://btcbase.org/log/2017-10-06#1721786 << this, fwiw, isn't even the giveaway it used to be. i personally supervised the release of piles upon piles of posters in us university campuses, for a very modicum costs. people off fiver just print what you give them, and put it up. nothing keeps you from having them print something decent, and with the abundance of "kids who fucked around with adobe illustrator instead of doing t
☝︎ jhvh1: asciilifeform: phf was last seen in #trilema 2 days, 21 hours, 4 minutes, and 30 seconds ago:
<phf> asciilifeform: that i figured out, the whole contraption reminds me of that ru anti-temper device pdf that you posted recently
a111: Logged on 2017-10-06 14:25 mircea_popescu: "Although ISIS have repeatedly attempted to claim credit for the shooting, saying Paddock had recently converted to Islam, both his brother and authorities have dismissed the claims. He had 'no religious affiliation, no political affiliation,' Eric said, adding: 'He just hung out.'"
<< good soviet!
mircea_popescu: "Although ISIS have repeatedly attempted to claim credit for the shooting, saying Paddock had recently converted to Islam, both his brother and authorities have dismissed the claims. He had 'no religious affiliation, no political affiliation,' Eric said, adding: 'He just hung out.'"
<< good soviet!
☟︎ a111: Logged on 2017-10-06 02:53 BingoBoingo: In other 12 hour sagas "The remains of a possible fetus were discovered by a custodian Wednesday in the bathroom of Wirth-Parks Middle School in Cahokia. The coroner arrived at the scene shortly after 8:30 p.m. and carried a small, covered box into the school."
<< "‘Fetal remains’ found in school bathroom actually a used feminine hygiene pad"
BingoBoingo: In other 12 hour sagas "The remains of a possible fetus were discovered by a custodian Wednesday in the bathroom of Wirth-Parks Middle School in Cahokia. The coroner arrived at the scene shortly after 8:30 p.m. and carried a small, covered box into the school."
<< "‘Fetal remains’ found in school bathroom actually a used feminine hygiene pad"
☟︎ BingoBoingo:
<mircea_popescu> ran a fake miner farm scam fore a while in iirc 2013
<< Perhaps something that early but mostly 2014 thing. Complete collapse happened between Xmas and New Years
BingoBoingo:
<mircea_popescu> asciilifeform pretty sure that's BingoBoingo o no wait, was it cazalla's good friend ?
<< He was the cheif jizz mopper cazalla and self cut teeth on
a111: Logged on 2017-10-05 19:50 apeloyee: on what planet gcd(a,b)
<>gcd(b,a).
apeloyee: now let's try generalizing to standard barrett (the error will grow to 2 of course). let L be number of digits in N: 2^(L-1)
<= N
< L. L is calc'd with the CLZ algorithm
deedbot: asciilifeform updated rating of apeloyee from 1 to 2
<< A - N*floor(A*R/4^K)
< 2*N
apeloyee: A
<4^K, so the above strictly >(A*4^K)/N - A.
apeloyee: let rewind. A*R = A*(4^K - B)/N = (A*4^K)/N - A*B/N; as B
<= N, then the previous >= (A*4^K)/N - A. clear?
apeloyee: A - N*floor(A*R/4^K)
< 2*N
<- do you agree with this? (the proof is unnecessarily complicated in that paste)
apeloyee: 4^K = R*N + B, 0
<= B
<= N (line seven). pseudo-remainder.