134600+ entries in 0.079s
mircea_popescu: there's nothing fundamentally wrong with a non-mining coin, ie, where all coins are created at
t0.
a111: Logged on 2017-12-19 02:33 asciilifeform: and, i'll add, in light of
the luby proof-of-storage item.
a111: Logged on 2017-12-19 02:08 phf: asciilifeform, mircea_popescu do we want
to keep
the exclude functionality? i sometimes use it in
test runs, but
this'll let me get rid of regex (for now anyway)
trinque: obviously I'm looking into it, but I would like
to hear what other people are seeing on
their
trb nodes.
☟︎ trinque: mats pointed out
to me
that all
trb nodes he can see appeared
to be consistently 50 blocks or more behind.
trinque noticing extremely fucky behavior around sending
transactions with
trb over
the last few days at least.
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: not
to mention a fucking palette parser
phf: Pass
the output
through `pr'
to paginate it.
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: it's not even
the entirety of autoconf, just
things
that are left un-included after fixing all
the "missing file" errors from diff.c
phf: first pass line reduction of diffutils, from 300407
to 50312
☟︎☟︎ phf: apropos out yesterday's mini
thread about whisky.
the only good kind of whisky comes in
the jar
phf has been listening
to
The Dubliners, has a skewed perspective on work at
the moment
phf: but i don't go into
the details
there either
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
phf: right, realized
too late :p
phf: asciilifeform, mircea_popescu do we want
to keep
the exclude functionality? i sometimes use it in
test runs, but
this'll let me get rid of regex (for now anyway)
☟︎ 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 )
mircea_popescu: i have no idea what
the item would even cost
today. billions, prolly.
mircea_popescu: in other lulz : 32 hectares of land across
the strip from
the flamingo cost under 1mn in 1962.
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: primeness doesn't enter into
this, we're just leveraging
that apparently modexp is megaexpensive.
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: but
the base factor can't be
this fucking humongous ffs, it's just (x+a)^n vs x^n+a.
mircea_popescu: the order IS log^6, which was
the great progress, originally it was log^12
mircea_popescu: ie, suppose
the factors f1... f8 have bitnesses of 1,1,2,2,3,3,2042,2042. so
then we
try f1f3f5f7 and f2f4f6f8. and we also
try f2f3f5f7 f1f4f6f8. and so on.
mircea_popescu: it's a finite set of factors,
they work
together into fixed bitnesses only so many ways.
mircea_popescu: the
thus reconstructed p and q should be
tested for whether
they indeed have no
true witness of compositeness as low as gpg
tests.
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: was it ever checked whether it would appear prime
to koch-gpg ?