2500+ entries in 0.298s
a111: Logged on 2017-09-12 20:54 asciilifeform: and it happens B
^2 times
mircea_popescu: ie, all the trivial polynomials of the mod, see ? x, x
^2 + x, x
^ 3 + x etc etc
trinque:
^ did a bit of maintenance; node back online
BingoBoingo:
^ Brought to you by the latest innovations in Lulzcasting
trinque:
^ cross channel quoting, nice!
a111: Logged on 2016-06-14 01:33 mircea_popescu:
^ if anyone has suggestions...
shinohai:
^ heh that was when I was still doing my 6 month novitiate log reading
trinque:
^ mircea_popescu wrote this. I and most (all?) others here worth a damn signed in blood.
trinque:
^ obviously this is mircea_popescu's blog, not mine.
shinohai:
^ generated by python, no less
a111: Logged on 2017-08-31 16:17 sageprobes: Been intermittently following Loper for ages, I'm an Urbit employee
^-
^ sageprobes: Been intermittently following Loper for ages, I'm an Urbit employee
^-
^ ☟︎ a111: Logged on 2017-08-30 13:34 spyked:
^ actually, anecdote. friend of a friend ordered cheap NICs for some business. returned them immediately when he saw they were sending weird data to selected IP addresses. the whole lot.
spyked:
^ actually, anecdote. friend of a friend ordered cheap NICs for some business. returned them immediately when he saw they were sending weird data to selected IP addresses. the whole lot.
☟︎ phf: i was half expecting to find an ivory there
^ BingoBoingo:
^ From the between Berlin and Moscow department of departments
spyked: valentinbuza, to exemplify asciilifeform's point
^ I shall quote from the docs: "A Noise protocol begins with two parties exchanging handshake messages. During this handshake phase the parties exchange DH public keys and perform a sequence of DH operations" <-- this requires me to import a couple of concepts: handshake messages, DH public keys, there may be others along the line. now, given that my crypto brain-memory module is not
spyked: so from
^ the "ultra"er models don't work with the open source toolchain? I was looking at one of the breakout boards earlier
mike_c:
^ excludes hands with no summary and hands with seat 256
mircea_popescu: because at age 6 the difference between you and average had unfolded to a term of x, whereas in a further four years it had unfolded to a further y, x
^ n as it may be.
Birdman: oh i assumed that was the case beacause in the command line it points to that second quote with a
^ mike_c: !~later tell Birdman
^ mike_c: !!later tell Birdman
^ mod6: i've got 2 systems here that have successfuly built that I'm looking at. both look like this
^ mircea_popescu: but that is practical to the power
^1, whereas thicker keys expensive to
^ of n.
mircea_popescu: asciilifeform yes, but good pipe is finitely good
^ 1 whereas tick pipe is expensive to the
^ n.
mircea_popescu: so, you publish a number S, and a pubkey P. the verification consists of doing S
^ P.e and checking that it is equal to the hash of the proposed message mod P.N
mod6: make sense. i personally kinda like the idea that a user can generate a key, that must be 2
^n, that is all.
mod6: hmm. so let's say, for instance, that you figure out how to make the 2
^n version the same as the 64 width classic version -- performance-wise.
mircea_popescu: the ONE way to constant-mpfhf is to calculate ALL the tree of possibilities, 2
^message length items EVERY TIME