1000+ entries in 0.155s
diana_coman:
http://btcbase.org/log/2019-02-07#1893544 -> adding to this, on (re)
^n -read of docs I doubt there's any benefit in having a controlled type in there; essentially the main thread will *wait* for all tasks spawned by the SJM to finish from what I understand; so then aborting them in a Finalize makes precisely 0 sense and instead I should probably make it a plain array and offer users of the package a non-synchronised procedure to abort them
☝︎ BingoBoingo:
^ Just under 21 hours left to bid in the Pizarro fiat buying auction
mircea_popescu: a. BingoBoingo wouldja mind billing me for a month of
^ and send hanbot teh credentials.
a111: Logged on 2019-01-29 17:34 asciilifeform: comments ( grep -P '
^\s*--' ) turn out to be 1835 ln in libffa and 390 in ffacalc.
mircea_popescu: asciilifeform do you want topless thai princess enough to go through
^ ?
mod6: I think something like `grep -v "
^$"` will give you all the non-empty lines from a file.
BingoBoingo:
^ Breaking, bolder than normal world "policing"
BingoBoingo:
^ Small supporting lul, Vzla opposition folks are reporting ~700 protester arrests over the weekend which is about an order of magnitude under the numbers Macron was was detaining when the Yellow Jacket thing was new
a111: Logged on 2019-01-26 08:58 diana_coman:
http://btcbase.org/log/2019-01-25#1889973 -> didn't rummage as too late yest but woke up this morning with this: when a= n-1 step 2.2 aka y=a
^r mod n becomes y= (n-1)
^r mod n; using for instance binomial expansion you have (n-1)
^r = n
^r + rC1*n
^(r-1)*(-1)+rC2*n
^(r-2)*(-1)
^2+....+rC(r-1)*n*(-1)
^(r-1)+(-1)
^r; since the whole thing was "mod n", of all those terms you are in fact left with only the last one, aka y = (-1)
^r mod n ; r is odd so
diana_coman:
http://btcbase.org/log/2019-01-25#1889973 -> didn't rummage as too late yest but woke up this morning with this: when a= n-1 step 2.2 aka y=a
^r mod n becomes y= (n-1)
^r mod n; using for instance binomial expansion you have (n-1)
^r = n
^r + rC1*n
^(r-1)*(-1)+rC2*n
^(r-2)*(-1)
^2+....+rC(r-1)*n*(-1)
^(r-1)+(-1)
^r; since the whole thing was "mod n", of all those terms you are in fact left with only the last one, aka y = (-1)
^r mod n ; r is odd so
☝︎☟︎ BingoBoingo:
^ For the same mouth different messages out of each side files
mircea_popescu: specifically because density is uniform, if you ~only~ check say 64 bit numbers as witnesses (ie, nothing smaller than 2
^63) there's a set of composites < certain limit that'll pass ; whereas if you only check 1-63 bit numbers (so the same ~number~ of numbers) there's a set of composites that'll pass, but they're LARGER than the same limit.
hanbot:
^ smells better already
mircea_popescu: i suppose you might say "it shouldn't be x2, my expectation would be it's x2
^1/2", but w/e.
BingoBoingo:
^ Yes I raised the alarm. Efforts to convince me to lower it are welcome. If you are outside my L1 you need to offer a stake and odds for your petition to be considered.
BingoBoingo:
^ For the Pantsuit eating their own, get out of the way files
trinque: and since the "fair price" is going to be "what we need"
^ aha
a111: Logged on 2018-12-12 19:41 BingoBoingo:
^ Any awk ninjas want to try this on a few forums?
a111: Logged on 2019-01-11 17:48 asciilifeform: ( re 'how many witnesses', see diana_coman's article, it reviews the necessary maffs, i.e. P(yer prime aint a prime and you die) == (1/4)
^n, where n is # of witness )
a111: Logged on 2019-01-11 17:48 asciilifeform: ( re 'how many witnesses', see diana_coman's article, it reviews the necessary maffs, i.e. P(yer prime aint a prime and you die) == (1/4)
^n, where n is # of witness )
BingoBoingo:
^ Turns out Germany's solution to gutting their Army is taking France's
diana_coman: mircea_popescu, quite; I read it as "tripping over oneself in desperation to signalsignalsignal agreement
^n"
BingoBoingo:
^ From the place that brought the world "monkey baiting"
a111: Logged on 2018-12-12 19:41 BingoBoingo:
^ Any awk ninjas want to try this on a few forums?
mircea_popescu: think about it, if it converged in more than 2
^B turns, then you'd have a B bit number contain B+k bits of information.
BingoBoingo:
^ Attn bidders, Pizarro fiat Auction for January is live.
a111: Logged on 2017-10-08 00:20 asciilifeform:
http://btcbase.org/log/2017-10-07#1722411 << 1 ) ffa is closed form. i.e. it CAN be written as a number of nand gates, with a 'funnel' at the top, to which you present a,b,c, e.g. 4096bit, numbers, and at the bottom in a little cup you get a
^b mod c , and with NO UPWARDS FEEDBACK FLOW of information , i.e. answer comes after same interval of time always, and with strictly downwards signals.