a111: Logged on 2017-09-19 19:20 ben_vulpes: just...no new blocks.

a111: Logged on 2017-09-19 20:25 asciilifeform: ( translation from usg limba de lemn : 'there will now be concrete penalties for exposing dnc diddling of elections' )

a111: Logged on 2017-09-19 21:02 phf: same thread as a guy who freaked the fuck out, because i told him to ssh into a box for the interview

a111: Logged on 2017-09-19 21:04 phf: i was trying to be ~polite~. if you put "10 years of unix" on your resume, i sort of assume "tell me your favorite editor and then ssh into the box for interview" is a bushido level of politeness

a111: Logged on 2017-09-19 21:12 asciilifeform: btw 'bitcoin-heirloom' by mikehearn, gavin et al, when.

a111: Logged on 2017-09-19 21:21 asciilifeform: phf: it's the root of 90% of the bloat and outright retardation in the currently extant utils

a111: Logged on 2017-09-19 21:30 phf: i don't know why you explain to me things that ~i argued in the past~. fwiw, i argued "utf-8 is a whole spittoon" back when the question of encoding first came up, to somewhat fierce opposition

a111: Logged on 2017-09-19 21:39 phf: i've actually tried putting ropes in a bunch of projects and they never have good performance characteristics. in fact for text editors no one has invented anything better than "one string per one line", and if you want to be fancy you split it at point (what emacs does)

a111: Logged on 2017-09-19 21:51 phf: additional point is that traditionally when someone said "multi-gb" what was really meant is "file bigger than can fit in memory", and suddenly(!11) your whole underlying editor algorithm changes drastically, because you have be doing partial updates, and temp files, and all kinds of cut-and-paste trickery. that's why emacs has a special cased "big file" support. with ropes if you want to achieve multi-gb that way you basically have to

a111: Logged on 2017-09-19 22:15 phf: it would be interesting to try and design architecture where you have an insert operation on a memory region (cons and lisp machines is kind of it, but that's done by sidestepping the issue; i'm talking a traditional von neumann machine)

a111: Logged on 2017-09-20 01:32 mircea_popescu: http://btcbase.org/log/2017-09-19#1715929 << and yet nano can handle tb. it'll take a while to bring it up, but it will. insertions np, seek-next back and forth np, whole line deletions etc.

a111: Logged on 2017-09-20 01:35 mircea_popescu: http://btcbase.org/log/2017-09-19#1715948 << i suspect that was the original idea of pointers. "you want to insert X between A and B in AB memory ? NO PROBLEM! make A point to X instead of B and X to B itself AND IT IS DONE! MAGICALLY!"

a111: Logged on 2017-09-20 01:19 asciilifeform avoids baking 8bitism into his creations, when possible -- and sane langs make it possible

a111: Logged on 2017-09-20 02:47 mircea_popescu: soo, given the "cultured milk" yoghurt bs these days, i wonder what % of us population's entire exposure to that concept is in that context, and as a result has come to believe "cultured" means you know, you've had some germs injected or something.

a111: Logged on 2017-09-20 19:19 ben_vulpes: and as the keccacteams mention, little incentive for cryptoacademia to formalize how ARXceteras might fall over. hard work with little guarantee of payout apparently terrible strategy in a world of publishorperish + everyone pretends to ignore that none of the academics ever bothered to do the hard work of an actual ffa, preferring instead cheap outs like leaky tables

a111: Logged on 2017-02-19 03:54 asciilifeform: (iirc we had a thread where i described how corporate ameritards, if given a problem like phuctor, would happily soak up a few $mil and megawatt of iron)

a111: Logged on 2017-09-20 19:29 mircea_popescu: 763 mp+ 229 => 3 + 9 = 2 + 1 carry. 6 + 2 = 8 (+1 carry = 9) + 1 carry, 7 + 2 = 9 + 1 carry = 0 so finally = 92

a111: Logged on 2017-09-20 19:36 mircea_popescu: anyway, the above example of "alt-addition" is mostly based on the happenstance that in base 10, the set of digits that are also prime is {1,2, 3, 5, 7} and the set of digits that are not prime is {0, 4, 6, 8, 9} ie it just so happens to be a perfectly balanced split.

a111: Logged on 2017-09-20 21:54 asciilifeform: e.g., N is a number to shift, Q is shift amt, R is result, S = l_shift(N, 1); mux(S, R, R, iszero(Q - 1)); S = l_shift(N, 1); mux(S, R, R, iszero(Q - 2)); ...... mux(S, R, R, iszero(Q - (width-1)))

a111: Logged on 2017-09-20 22:09 asciilifeform: this worx. but seems to reduce to a more complicated and non-unrolled version of http://btcbase.org/log/2017-09-20#1716343

a111: Logged on 2017-09-20 22:07 asciilifeform: apeloyee: i'd be curious to hear how intel will 'optimize' xor.

a111: Logged on 2017-09-20 22:35 apeloyee: asciilifeform: which while loop? in CLZ or secretshift?

a111: Logged on 2017-09-20 22:49 apeloyee: I don't understand how to do classical barrett without CLZ on modulus

a111: Logged on 2017-09-20 23:05 apeloyee: http://btcbase.org/log/2017-09-20#1716348 << from my Intel PR dept. emulator: "New Intel (R) NSAInside Energy saver(TM) processor technology optimizes your branchless code to avoid redundant operations delivering unparalled power savings..."

a111: Logged on 2017-09-20 23:12 apeloyee: longmod procedure in linked pdf says "2^b < m <2^(b+1)" on page 9