900+ entries in 0.417s
jhvh1: mircea_popescu: I could not find an output from Google Calc for: log(2**2048)**6/log(2**14)**6
jhvh1: shinohai: 100 * 10^-8 * 1024 = 0.001024
BingoBoingo: <mircea_popescu> in other thank you obamas, i can now buy 1kAmpere (crank) batteries for muh car. this means the damned thing can push out at the very least 14.5 * 1000 * 30 = 435kJoules over half a minute! << AHA, y las baterias por las motocicletas ahora muy pequena
mircea_popescu: in other thank you obamas, i can now buy 1kAmpere (crank) batteries for muh car. this means the damned thing can push out at the very least 14.5 * 1000 * 30 = 435kJoules over half a minute!
jhvh1: mircea_popescu: 1e6 * 3600 * 24 * 30 = 2592000000000
danielpbarron: i copied /usr/portage from my currently working machine to this laptop that's still chrooted from the usb booter, then ran a script that does: ebuild * digest where * is all *.ebuild in that directory
mircea_popescu: * sonic3 (5668bf07@gateway/web/freenode/ip.86.104.191.7) has joined #trilema <
mircea_popescu: (for the record : it is a fact that there exist infinite composites so that their SMALLEST witness is at least ln (n) ^ 1/(3 * ln (ln(ln(n))). yet "cryptography community" keeps doing this small witness bs.)
jhvh1: mircea_popescu: (18775.0230839/15)**(1/6) = 3.282828562886639
mircea_popescu: aaand in other parasite sites, check out best-bitcoin-mining-trading-info-near-you-australia.s3.amazonaws.com/Best-bitcoin-mining-difficulty-over-time-Information-for-*, such as best-bitcoin-mining-trading-info-near-you-australia.s3.amazonaws.com/Best-bitcoin-mining-difficulty-over-time-Information-for-Oakdowns-7019-TAS-2018.html
jhvh1: mircea_popescu: 0.00024 * 17133.3184732 = 4.111996433568001
lobbes: Ah, wait. Shouldn't it be: 17133.3184732 * 168 * 1e4 / 1e9 ?
jhvh1: mircea_popescu: 17133.3184732 * 168 * 1e5 / 1e9 = 287.83975034976004
a111: Logged on 2016-01-04 13:52 mircea_popescu: * Tomiii (~Tommiii@garza.riseup.net) has joined #bitcoin-assets << lolwut.
BingoBoingo: * asciilifeform just ate his bday caek, made by pet from studying ro material re hungarian caeks. it was quite spiffy. << Happy birthday
a111: Logged on 2014-01-19 19:48 mircea_popescu: i came to it studying the warrior forum (*) years ago, when i noticed the unifying factor in all their textual emissions was a desire to "make money while you sleep".
mircea_popescu: you just decide on a pixel count based on your design, and then you split the 24 * 3600 day into that many units
mircea_popescu: you decide on an image to be displayed on search page, specifically. "i want it 1024 x 168 pixels". you separately produce a png, as wide as day count, and as tall as daycount * 168 / 1024 rounded. you fill that png with the proper lines, proportionally (so highest count day gets full line, all other days get proportional line). then you scale it down to 1024 x 168. you publish this scaled down item on the search page, and yo
mircea_popescu: * Loaded log from Thu Jan 19 19:08:32 2017 << i guess once a year .
BingoBoingo: Calculated as 2*{[(monthly rack with 22% VAT)/(40 Salable RU)]*(12 Months)}/(52 weeks)
phf: mircea_popescu: it's actually a broken patch (i.e. it was published broken), i need to move it to deprecated, since *-corrected has been published since
a111: Logged on 2017-11-14 11:05 apeloyee: if M is say, 1.999999 * 2^2047, then ~20 first bits of p and q are known
apeloyee: grrr. "M is say, 1.999999 * 2^2047" << 2^4065, of course
apeloyee: if M is say, 1.999999 * 2^2047, then ~20 first bits of p and q are known
☟︎ phf: somewhat relatedly one handy thing i saw on CADR is named cons regions, i.e. explicit memory regions where you can cons and every allocation function having a *-in-region equivalent, like (cons-in-region x y region). i'm not sure if that's there, but you presumably can do some kind (with-cons-region (region ...) body) thing. naturally those regions can be saved (preserved referential integrity) or cleared, etc.
jhvh1: mircea_popescu: 0.02 * 5928.12836478 = 118.5625672956
jhvh1: mircea_popescu: ((39/40) ** 365) = 9.698056947029741E-5
mircea_popescu: you might prefer to b) send it via train freight from exact origin to exact destination, at cost of 0.02, which is to say 8`000 * 0.02 = 160.
mircea_popescu: in this model, rather than have a) load it on ship in a week, from the single port, and then take n weeks to reach destination, and then unload and distribute by lorry, so yes you pay 0.01 per km on sea, which is 99% of the distance, but then 10 for the servicing, making your total cost 10`000 * 0.01 + 6 * 10 = 160
ben_vulpes: "and for as long as your citizens run free 802.* rebroadcasters, we're going to be utterly uninterdictable"
jhvh1: asciilifeform: 7241 * 11000 = 79651000
jhvh1: mircea_popescu: 4360 * 63.4 + 2260 = 278684
jhvh1: mircea_popescu: 4360 * 80 * 50 = 17440000
jhvh1: asciilifeform: 2260 * 50 = 113000
jhvh1: mircea_popescu: 0.00025 * 5760.03559702 = 1.440008899255
mircea_popescu: ie when 800 + n * 12 > 1400 + n * 11 and so following.
jhvh1: mircea_popescu: 8
*1024 ** 4 / 30 / 24 / 3600 = 3393554.406716049
jhvh1: mircea_popescu: 30 / (220 * 24 * 30 / 1000) = 0.1893939393939394
mircea_popescu: "the majority of fortunes were not built by work". why not ? global warming, pantsuit.*
mircea_popescu: anyway, i tried /invite polarbeard but * polarbeard :No such nick/channel ; anyone know him irl drop a line ?
jhvh1: asciilifeform: 30e3 * 34.2e6 = 1026000000000
a111: Logged on 2017-10-05 16:08 asciilifeform: compute the quotient-guess q, q := (c * x) >> 4096
jhvh1: asciilifeform: 1e9 * 0.001 = 1000000
mircea_popescu: and speaking of freenode bs : "* - A massive thank you to our sponsors and exibitors: Private Internet Access, Canonical, Bytemark, yubico, Open Rights Group, Free Software Foundation, OpenSUSE, Minetest, KDE, bitcoin.com."
mircea_popescu: the point of interest for the "max case" is b. the point of interest to us is a. the "average case" is either a+b/2 or else ni * weight i / sum i.
jhvh1: asciilifeform: 3946.99 * 0.0395 = 155.906105
BingoBoingo: * mircea_popescu would propose writing for qntra, but sadly qntra encountered an arrow to the knee << This is no obstacle to writing for qntra. Merely an obstacle to getting puslished on Qntra. While disaster awaits a resolution one can still write to target qntra and settle for publishing elsewhere.
jhvh1: mircea_popescu: (3.141491330 - pi)/pi * 100 = -0.0032252300334771494
mircea_popescu: yes, but as long as you do rsa, a ^ b mod m = either a ^ b or else, a ^ b - m. that's the complete story, there are no other cases. there's specifically no k * m parameter to be explored there.