49200+ entries in 0.416s

trinque: ascii
_butugychag: the guy's going to drop fucking NSAcoin
deedbot: ascii
_butugychag voiced for 30 minutes.
ascii_butugychag: mircea
_popescu: my point was that in nazi land i get ranked as simply a very lazy nazi who spends time on ???? rather than properly drilling with the other ss men
mircea_popescu: ascii
_butugychag in that case, let's put it in storage i guess.
Apocalyptic: "14:18 <+ascii
_deadfiber> i do suspect that the enemy knows some factoid re prime distribution that makes factoring randints easier
mircea_popescu: ascii
_butugychag which is proof positive nsa did in fact plant them.
ascii_butugychag: mircea
_popescu: the 'consensus shapers' are all working the angle of 'these terrorists planted the keyz'
phf: i will venture "wrong gcc version/flags" on account of that
_8 there
mircea_popescu: ;;google undefined reference to `
__sync
_add
_and
_fetch
_8'
mircea_popescu: ascii
_butugychag a coupla hours ago i made a cursory attempt to install a factorizer lib (linked in logs). i threw up minutes later because obviously it doens't work. put out a general call, slavegirl picked up the task, installed python 4.4. wrangled for a while with broken cmake settings (pro tip : cmake is known to not correctly identifgy your python, workable hack in this case is to disable the test and manually fix the f
mircea_popescu: in other lulz : undefined reference to `
__sync
_add
_and
_fetch
_8'.
deedbot: ascii
_butugychag voiced for 30 minutes.
diana_coman: ben
_vulpes, yes, it timed out in the end, no idea why
ben_vulpes: diana
_coman: timeout? works fine from here
Apocalyptic: mircea
_popescu: download ecm from inria, compile it, run ECM with the residue I supply
Apocalyptic: mircea
_popescu: that would be a great idea indeed, in the meantime if anyone feels like helping me factor my modulus residue let me know
Apocalyptic: "14:16 <+mircea
_popescu> i recall him trying one" // and succeeded, see ascii's rating, afaik he included the log line where I posted all the factors
Apocalyptic: 12:18 <+mircea
_popescu> Apocalyptic ^ i propose as best candidate for m-r testing. // I'm already working on a more approachable one, also I don't know what's with you and m-r but I don't think m-r is a good factorization algo, I was and am running p-1 , p+1 and ECM
phf: mircea
_popescu: just irked, there's a rare "human record" kind of data that ben
_vulpes deals with that exceeds 8gb. why don't you taunt us with your hadron collider data dumps some more?
deedbot: fromphuctor
__ voiced for 30 minutes.
deedbot: fromphuctor
_ voiced for 30 minutes.
a111: Logged on 2016-05-02 19:14 mircea
_popescu: asciilifeform but he has a point ; once we get conversion going running a ssh-keyscan werker is good idea.
ascii_deadfiber: mircea
_popescu: there is no easy answer to ~how to represent~ them
mircea_popescu: ascii
_deadfiber and while on this topic : it beggars belief that bignum-as-linked-list-of-any-size-up-to-avail-ram is not a fucking standard in gcc in 2016.
a111: Logged on 2016-05-03 10:28 mircea
_popescu: in vaguely related lulz,
http://www.javascripter.net/math/primes/millerrabinbug-bigint54.htm as well as "However, if you try to pass an odd number n greater than 2^53 the test will not work because the argument would actually turn out to be some other number approximately equal to the desired odd number: JavaScript/IEEE754 cannot exactly represent odd numbers that large!"
a111: Logged on 2016-05-03 08:30 mircea
_popescu: ". like it's fucking 1700 all over again or some shit, and they're refugees from the Alchemics & Perpetuum Mobile society.
a111: Logged on 2016-05-03 08:30 mircea
_popescu:
http://btcbase.org/log/2016-05-03#1461614 << ianacs, but : fwis the way all these "modern" computing stacks work, is they are made by people with absolutely no system design training, competence or understanding. as a result, they end up hand-crafting the tail. the ready equivalent would be a "new, modern" game of chess, where as the game progresses more and more moves have to be verified against a rulebook ; and then against
BingoBoingo: <ascii
_deadfiber> he's the 'replacement story' tho << No, hoaxtoshi and nao petrocheese stockpiles are
a111: Logged on 2016-05-03 11:58 ascii
_deadfiber: he's the 'replacement story' tho
deedbot: mircea
_popescu rated hcb 1 << Euloran
deedbot: ascii
_deadfiber voiced for 30 minutes.
a111: Logged on 2016-05-03 02:26 ascii
_deadfiber: you can't even ~get~ real net in midwest.
a111: Logged on 2016-05-03 02:20 ascii
_deadfiber: snow, in motherfucking may.
a111: Logged on 2016-05-03 00:52 ben
_vulpes: phf: i would like to hear about what kinds of misery you've found in datomic. not to doubt! never to doubt the misery of technology. but out of curiosity, and limits-finding by proxy.
deedbot: fromphuctor
__ voiced for 30 minutes.
deedbot: fromphuctor
__ voiced for 30 minutes.
BingoBoingo: And ascii
_deadfiber thinks the middle west is horribru
deedbot: ascii
_deadfiber voiced for 30 minutes.
ben_vulpes: whatever it is that returns the JSON that sends mircea
_popescu scrambling and screaming for the "programmer's view"
deedbot: fromphuctor
__ voiced for 30 minutes.
deedbot: fromphuctor
__ voiced for 30 minutes.
deedbot: fromphuctor
___ voiced for 30 minutes.
mircea_popescu: fromphuctor
__ yes but phuctor currently eats rfc 4880 format, owing to its history as a pgp key checker.
deedbot: fromphuctor
__ voiced for 30 minutes.
deedbot: fromphuctor
__ voiced for 30 minutes.
deedbot: gabriel
_laddel voiced for 30 minutes.
Apocalyptic: mircea
_popescu: why k/4 ? my argument was if the whole modulus is random, then we can expect a k/2-bit prime factor, if modulus is random p times random q, then we can't unless p or q is actually prime (assuming p and q same size), which is quite unlikely if truly random
deedbot: tophunctor
____ voiced for 30 minutes.