asciilifeform: ( re madagascar : apparently on top of other joys, now has confirmed black plague. )

asciilifeform: ahahahaha

asciilifeform: when orcs make the straw plane, they don't make wunderbar mega-improved glider, no; but straw boeing.

asciilifeform: sounds rather african

asciilifeform: is mostly it.

asciilifeform: populated by... tamils ? ( on account of monkeys never finding it )

asciilifeform: i can draw it on the map if you rub it out. and iirc 'independent' (took turns whoring for britain and france) in 19th c to present day...

asciilifeform: mircea_popescu: most heads belong pulling plow .

asciilifeform: same, yes, fundamental fallacy as 'bayesianism' -- notion being that the work of understanding something, can be farmed out to machine

asciilifeform: 'a usg will always be found for the stupid' or how it went.

asciilifeform: it however is a gangrene that will grow ANYWHERE where fits-in-head is not an iron principle.

asciilifeform: haskellatical proof

asciilifeform: it's an entire 'industry'

asciilifeform: usgproven

asciilifeform: encryption protocol'

asciilifeform: '...4-way handshake was mathematically proven as secure... the properties that were proven in formal analysis of the 4-way handshake remain true. However, the problem is that the proofs do not model key installation. Put differently, the formal models did not define when a negotiated key should be installed. In practice, this means the same key can be installed multiple times, thereby resetting nonces and replay counters used by the

asciilifeform: that shouldn't work tho, the original was simply nosuchlabs.com/rss

asciilifeform: lollamatic!

asciilifeform: usgination.

asciilifeform: losure deadline was around the end of August. As a compromise, I allowed them to silently patch the vulnerability. In hindsight this was a bad decision, since others might rediscover the vulnerability by inspecting their silent patch. To avoid this problem in the future, OpenBSD will now receive vulnerability notifications closer to the end of an embargo.'

asciilifeform: in other lulz, 'OpenBSD was notified of the vulnerability on 15 July 2017, before CERT/CC was involved in the coordination. Quite quickly, Theo de Raadt replied and critiqued the tentative disclosure deadline: “In the open source world, if a person writes a diff and has to sit on it for a month, that is very discouraging”. Note that I wrote and included a suggested diff for OpenBSD already, and that at the time the tentative disc

asciilifeform: 'encryption expert'

asciilifeform: rom each radio to the next, and from there on -- worm outward, etc

asciilifeform: 'In the most likely attack scenario, the hacker would have to directly connect to the Wi-Fi access point, and so would need to be within physical proximity to the router. "This attack doesn't scale," noted Alan Woodward, encryption expert from the University of Surrey. "It's a very targeted attack. Not like we're all going to be hit as attackers can only be in so many Wi-Fi zones at once."' << choice nonsense -- as if you can't hop f

asciilifeform bbl

asciilifeform: ( you still need a 5v supply, if you do this )

asciilifeform: this also worx and notice that fg was offered with this option

asciilifeform: if you dun wanna use usb, can use rs232-ttl converter , and plug into actual serialport

asciilifeform: ( i consider kernel like that, unusable for ~any practical purpose in the lab )

asciilifeform: and yes if your kernel was built without modules for all the major usb-tty boxes, it is rubbish

asciilifeform: trinque: strictly speaking that's only if you use the included ttl plug; there are other chipsets

asciilifeform: i.e. after plugging one in ?

asciilifeform: ben_vulpes: whaddayamean 'without ttyUSB..'

asciilifeform bbl : meat

asciilifeform: np

asciilifeform: mircea_popescu: http://trilema.com/2014/the-problem-of-enforcement/

asciilifeform: 1s

asciilifeform: yes

asciilifeform: http://btcbase.org/log/2017-10-14#1725340 << i will admit to being curious re what it is mircea_popescu thinks he can use those folx for. they have the apparent intellectual ability of a turnip. ☝︎☟︎

asciilifeform: ( why not even bigger window, e.g 8 bits ? )

asciilifeform: i'ma certainly try the fixedtimewindow thing at some point

asciilifeform: http://btcbase.org/log/2017-10-14#1725331 << indeed ☝︎

asciilifeform: http://btcbase.org/log/2017-10-14#1725327 << i don't see how it needs carry-save ☝︎

asciilifeform: http://btcbase.org/log/2017-10-14#1725324 << lol it is very very easy, when i see a paragraph that seems to be about ecc crypto, my eyeball jumps over it ☝︎

asciilifeform brb

asciilifeform: and the correctness of any variant (e.g. asmed) versions, will be judged against the canonical.

asciilifeform: it means the thing has to be gotten to acceptable performance sans asm.

asciilifeform: understand what canonical means in this case ?

asciilifeform: *tying

asciilifeform: nor any endianisms or anything else typing it to particular iron.

asciilifeform: canonical ffa will never contain asm.

asciilifeform: i'ma eventually rewrite whole thing in asm, for special uses. but that will be separate proggy.

asciilifeform: but i'd like an end product with NO arch dependence.

asciilifeform: ( massive time is wasted deriving the carries )

asciilifeform: apeloyee: if doing asm, not only multiply but add and shift

asciilifeform: unrolled comba is here: http://btcbase.org/log/2017-08-10#1696236 ( http://archive.is/iMI4W ) ☝︎

asciilifeform: and there is literally no other description afaik anywhere on the net

asciilifeform: apeloyee: iirc it was in middle of https://cr.yp.to/ecdh/curve41417-20140706.pdf ( which is largely about other, useless crud ) ☟︎

asciilifeform: i still think that it makes sense to do this only after every other bolt is as tight as physically possible -- bernsteinian karatsuba, unrolled comba, etc

asciilifeform: apeloyee: and index with a 4way mux ? that'd work

asciilifeform: no conditionaljumps on secret MEANS no conditionaljumps on secret. no exceptions.

asciilifeform: lolfuckno

asciilifeform: and for that matter of 0.

asciilifeform: it still isn't clear to me how this algo can modexp to the power of 1.

asciilifeform: *sum

asciilifeform: 1 is not a sums of 2s and 3s...

asciilifeform: btw apeloyee what does this do when exponent is 1 ?

asciilifeform: nowhere, but not clear to me that it wins anything, and would have to be indexed this way in order to win

asciilifeform: no pasaran.

asciilifeform: what part of this is hard to understand.

asciilifeform: apeloyee: NO INDEXING BY SECRET OF ANY SIZE

asciilifeform: apeloyee: nogood

asciilifeform: (physically)

asciilifeform: you have a couple mil 'fm radios' less than a milliwavelength apart

asciilifeform: mno

asciilifeform: prolly the only finalsolution to power variance is http://btcbase.org/log/2017-05-16#1656782 . ☝︎

asciilifeform: http://btcbase.org/log/2017-10-14#1725219 << in your house -- yes. in , say, a racked machine in a dc -- not so easy ☝︎

asciilifeform: apeloyee: actually no, i dun get ?

asciilifeform: and i have no intention of doing such a thing

asciilifeform: http://btcbase.org/log/2017-10-14#1725202 << i will say now, that i will not be using windowed exponentiation, because it wins nothing unless you permit indexing memory by a secret ☝︎

asciilifeform: now this is nonsense.

asciilifeform: i'll have a square metre grid of whatever size i can buy, if i want.

asciilifeform: FOR ALL OF IT

asciilifeform: http://btcbase.org/log/2017-10-08#1722435 << see also ☝︎

asciilifeform: fpga has a bit muxer and none of the loops will be loops, lol

asciilifeform: optimization that adds loc is for inner loop items STRICTLY

asciilifeform: http://btcbase.org/log/2017-10-14#1725201 << i deliberately did not do this, because it adds loc and saves 0 time ☝︎

asciilifeform: i'm concerned with 1) timing leak 2) fits-in head --- strictly.

asciilifeform: http://btcbase.org/log/2017-10-14#1725200 << i strongly suspect that this is a waste of time on pc, where even add and xor almost certainly consume variant current depending on operands ☝︎

asciilifeform: http://btcbase.org/log/2017-10-14#1725197 << this is so. idea of quoted thread was, i'd like to get ffa to where it uses strictly 2 machine types, 'Word' (whatever that is on whatever machine) and, say, 'Index', which is guaranteed to be mod 2**16 or larger. and get rid of all conversions. ☝︎

asciilifeform: http://btcbase.org/log/2017-10-14#1725195 << we don't use signed type for anything ☝︎

asciilifeform: lispworld tradition.

asciilifeform: http://btcbase.org/log/2017-10-13#1725153 << predicate ☝︎

asciilifeform: riotously lulzy piece

asciilifeform: iirc there was a 'cpp ifaq'

asciilifeform: this is not bad time to ask the tuned-in folx, what parts of ffa they would like to see explained in moardetail.

asciilifeform: lolk

asciilifeform: ( otherwise same problem as writing 'faq' without anyone actually having asked any q )

asciilifeform: asciilifeform's notion was that he'd write it against a backdrop of 'why didja do x' in l0gz

asciilifeform: mod6: imho detailed what-why-how belongs outside