176100+ entries in 0.057s
mircea_popescu: this thing, incidentally, is where we would immensely benefit from actually having silicon.
mircea_popescu: ascii_field quote as to "opened my eyes", i know where the concrete hole is from
mircea_popescu: there's a lot of work can be done to minimize wastage in this, but the fundamental problem is solved.
mircea_popescu: anyway, re the <jurov> lol part : there's a very obvious optimization where you go a) i want to fit this struct ; b) is there space ? if yes fit it if no c) kill the lowest per-byte value struct in there go back to a
mircea_popescu: or w/e memory space one wants to allocatge to the "mempool"
mircea_popescu: but a firm guarantee can be offered that for as long as you allocate structs smaller than n, you wioll be able to fit them.
mircea_popescu: how to do either of these is a problem of optimization outside the scope of this discussion.
mircea_popescu: whenever you want to add something, you put it in the available hole. if you don't have a hole you kill something until you do.
mircea_popescu: you separately keep an index of what structures you have in there (offset, length).
mircea_popescu: n bytes are allocated to "ring buffer", from offset k to offset k+n. the convention of reading this is that structures started at k+n-m that are m+p bytes long continue from k+n to k and all the way to k+p
mircea_popescu: actually, i suppose i should go into detail as we have no good reason to suspect we actually agree on anything but the words. so :
mircea_popescu: jurov you don't reorder them physically. you just keep the ring's index up to date.
mircea_popescu: ascii_field you misunderstand the "play with pebbles". it's doing stuff like playing angry birds on iphone.
☟︎ mircea_popescu: socialism is this great system to take hot chicks and smart boys and make them all play with pebbles until the day they die.
mircea_popescu: from my admittedly limited experience with socialist states... they all eat the same shit.
mircea_popescu: to quote the richest standup comedian of all time, "wouldn't it stand to reason that the air in your room comes from the very city that room is in ?"
mircea_popescu: "oh, she's only a slut i nthe hood, she washes up nice when going downtown"
mircea_popescu: i mean haskell, i get it. pseudomathematicisms that are too gnarly to grasp and so pass muster.
mircea_popescu: "If the space of possible messages is larger than the size of , then Cramer–Shoup may be used in a hybrid cryptosystem to improve efficiency on long messages. Note that it is not possible to split the message into several pieces and encrypt each piece independently, because the chosen-ciphertext security property is not preserved in this way."
mircea_popescu: "Cryptol is a domain-specific language for specifying cryptographic algorithms. A Cryptol implementation of an algorithm resembles its mathematical specification"
mircea_popescu: anyway, none of this is even practical without mass cardanos, because iirc c-s consumes even more entropy than rsa.
mircea_popescu: seems like the dream application for lisp, but what do i know.
mircea_popescu: also has the bonus advantage that there's exactly no risk of "clever" processor intructions being used.
mircea_popescu: maybe. the matter has to be properly analyzed for all other schemes
mircea_popescu: node m connects to A, sends garbage. if A manages to decrypt it, M will see it.
mircea_popescu: suppose you build a node. your node "doesn't answer", but it DOES publish the relayed txn somewhere.
mircea_popescu: ascii_field your gossipd node is stuck doing a version of this.
mircea_popescu: a few years after its introduction to "forever fix" the nonsensical problem of "turning a stateless protocol into a stateful connection"
mircea_popescu: eventually managing to obtain the key through the interplay of your selection and weakness of the cryptosystem)
mircea_popescu: (acca/cca2 = adaptive chosen cyphertext. it's an attack where you sort the cyphertexts in a tree, then send them to be decrypted
mircea_popescu: it however was not only the first but to date the only afaik scheme that's secure against acca. provedly so.
mircea_popescu: let us indulge then. cramer-shoup is an asym key system, just like rsa or ecc.
mircea_popescu: "Although the potential development of quantum computers threatens the security of many common forms of cryptography such as RSA, "
mircea_popescu: (leaving to reader's discretion which of the two this exemplifies)
mircea_popescu: but so far we don't even know if we actually want rsa (this for lack of gossipd) nor have we studied shoup etc.
mircea_popescu: imagine, having to either a) ignore the matter or b) make a point that the evil people are not-using its beloved shitscheme!
mircea_popescu: this will actually almost certainly be in there. gotta hurt the enemy not just in the matter at hand but across the field.
mircea_popescu: for some reason i read that as ram parity check something-or-the-other.