45800+ entries in 0.314s
mircea_popescu: there's nothing fundamentally wrong with
a non-mining coin, ie, where all coins are created at t0.
phf: well, if you baked in color support, your code periodically enables
a color mode, but doesn't immediately disable it. instead colors spit out as the execution unfolds. but if you catch an interrupt, you end up with
a borked terminal. hence fucking complicated ass signal machinery to ensure that color gets restored on hup or suspend
phf: there's
a concrete answer to that question!
phf: trick question, why do you need
a signal handler in
a differ?
☟︎ phf: not to mention
a fucking palette parser
phf: well, autoconf is not just scripts. it's also compatibility shims, which is
a bit tricky in case of
a differ, since, unlike mpi, it has
a lot of file system interaction code, that might or might not be portable. anyway, we'll see
phf has been listening to The Dubliners, has
a skewed perspective on work at the moment
a111: Logged on 2016-06-20 04:23 phf: which is handy if you're using something else to produce the patch, or if you need to use
a non-trivial diff command. for example i sometimes need to exclude files from diffing, so
a command might look like diff -x foo -x bar -x qux -ruN
a b | grep -v '^Binary files ' | vdiff > foo.vpatch
phf: there's
a couple of places where regex is used. exclude filters files by name, (so --exclude=.*c will skip those files by regex), exclude lines filters lines (obviously is not compatible with v), and there's also
a function grabber, it's
a little piece of code that ensures that, say, c function headers or certain pattern matching lines are in the hunk context
a111: Logged on 2017-12-18 23:58 asciilifeform: ( it is specifically
a pill against 'can recognize work done by itself as opposed to work done by others' aspect )
shinohai: But I always like my apple kyklos cake
a bit crumbly
a111: Logged on 2017-12-02 16:22 mircea_popescu: anwyay, revisiting an ancient conversation re
http://btcbase.org/log-search?q=mining+is+a+bug : i have to thoroughly concede this point to asciilifeform . the model is as follows : if
a)
a PoW system exists in which b)
a participating entity can recognize work done by itself as opposed to work done by others then it NECESSARILY follow that entity can, and therefore it ALSO follows that it eventually will c) impose further con
mircea_popescu: not sure that is
a bad thing. but yes, evidently large topic for discussion.
mircea_popescu: but the contention here is that picking something like modexp is
a better choice than just piling on hashes.
mircea_popescu: let's take
a = every other bit of n. to mine this block, you must produce an x so that x is twice the bitsize of n, and (x+
a)^n is mod congruent to x^n +
a (mod n)
mircea_popescu: incidentally...if this is so fucking slow... guess who just found
a new pow.
mircea_popescu: (which, i confess, striked/strikes me as
a seductively good idea)
mircea_popescu: but the base factor can't be this fucking humongous ffs, it's just (x+
a)^n vs x^n+
a.
mircea_popescu: it's
a finite set of factors, they work together into fixed bitnesses only so many ways.
mircea_popescu: each of these factors will have
a bitness. admitting none of them has
a bitness = 2048, they can be arranged into
a p and
a q so that each of these has
a bitness of 2048
mircea_popescu: the ~other~ part of it is : suppose (i don't have example ready, but constructively) there's
a N that popped into factors f1... fm.
mircea_popescu: bernstein smooth parts of integers empowered sieve popped
a factor ?
mircea_popescu: and i have
a good mind to mandate eucrypt impl of m-r actually uses 2^8 ie 256 as minimum.
mircea_popescu: ie gpg is wasting its time with "oh, let's see if 2 is
a witness".
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.)
mircea_popescu: iirc there was
a "study" showing how "it is enough to test these" for whatever size.
mircea_popescu:
a composite that passes
a low round m-r can be composite of >2 factors np.
mircea_popescu: this'd be
a special alternate because we're very unhappy with the fact that
a) "everonye" (=usg) uses m-r and b) evidently lies about the strength assumptions.
esthlos: noob question: why not use
a fast nondeterministic algo and sieve on the results?
mircea_popescu: that said,
a gmp version pushed out as
a patch on mpi might not be entirely without merit.
mircea_popescu: esthlos i'd love for you to be able to jump straight into this ; however there's some groundwork to be laid. look into the V system, because ideally you'd be presenting the finished item as
a patch on diana's eucrypt lib. and asciilifeform is working on and publishing
a final FFA which is what we intend to use here.
mircea_popescu: rather than being all negative!!!, got
a review copy of ffa somewhere to pass to esthlos ?
esthlos: mircea_popescu: is there
a preference on how I compute totient?
mircea_popescu: given n > 2 and
a coprime to n, n is prime only if (x+
a)^n mod-congruent x^n+
a (mod n)
mircea_popescu: you know, three indian kids got
a godel prize
a decade ago for the first ever primality test that's deterministic, polynomial and unconditional
diana_coman: mircea_popescu, I think this might be worth made into
a knob in the code explicitly
mircea_popescu: diana_coman should prolly add
a comment in there pointing out to people who are making keys for serious use that 1e-10 is really not nearly good enough.
mircea_popescu: seems
a gratuitous (but not readily computable) degradation of the 4^-k outer bound.
mircea_popescu: anyone with
a good reason why magic number should stay ?
mircea_popescu: in other news : the mpi m-r implementation has
a fixed witness at 2.
BingoBoingo: <shinohai> Tenth of
a bitcent per hour fine with me per hour << Perhaps the baroness can?
shinohai: Tenth of
a bitcent per hour fine with me per hour
mircea_popescu: and in other lulz, i myself wasn't making
a current bitcent an hour until sometime after 2010. ie, quite recently.
ben_vulpes: holy fuckadoodle, imagine getting paid
a bitcent an hour to do your six months
trinque: texanism with either
a little girl or queer connotation
ben_vulpes: dude this is epic, girl would rather talk about calendar offsets than earn
a bitcent an hour reading the log
☟︎ mircea_popescu: the result is
a matter of necessity in those circumstances.
mircea_popescu: nothing interesting can happen on mfc because mfc is composed of
a) the people there who b) operate under the delusion they may make choices.
mircea_popescu: who, other than being
a major fascist supporter, was also
a guy reputedly so smart, some woman wrote to him to propose having babies on the theory she's so pretty.
mircea_popescu: everyone's
a nerd deep down. way the fuck easier than being
a miner deep down.