log☇︎
19100+ entries in 0.171s
asciilifeform: non-1-to-1 pubkey is as useful as pistol that fires from both ends.
asciilifeform: it's like asking for a 17 that can also be referred to as 3.
asciilifeform: ( while also operable on by machine, to demonstrate that the arithmetic in fact comes out as stated )
asciilifeform: and this also means as few 'magic numbers' as it is physically possible to get away with. ☟︎
asciilifeform: asciilifeform's intent with 'p' is to push in the direction of maximum barking anarchy re pubkeys. as it is we have too many 'standards' as it is, ~all of them ill-conceived and smelling of sulfur.
asciilifeform: no moar 'we heathens have faster rsa because mother dropped us as babies and our rsatron does different work on different hamming weights'
asciilifeform: and no moar pissant smallint exponents, either. let it weigh as much as the modulus.
mod6: I think it's fine, we can ratify / ammend it as needed I suppose.
asciilifeform: this is true. but my original point was that it is impossible to verify the correctness of a list of primes other than by same procedure as generates one.
mircea_popescu: once you found the misspelling you found it and ere you found it the text was just as correctly spelled as it will be after you find it : "as far as i know, correctly spelled"
mircea_popescu: divergence. and if there is divergence, there is significant educational benefit in it, as seen in http://btcbase.org/log/2017-08-15#1698143 ☝︎
asciilifeform: in so far as publicity stunts go, this isn't even preposterously expensive -- anyone can rent a MHz or so of channel
shinohai: Often misdiagnosed as Crohn's disease iirc
asciilifeform: !~later tell mod6 http://wotpaste.cascadianhacker.com/pastes/6WPk2/?raw=true << 2^n karatsubas, with same readability as 'classical'
lobbes: aka, I get the same output as both of PeterL's runs
mircea_popescu: as per that ancient "doctor, is it bad if i hear voices ?" "only if you start answering."
asciilifeform: but we're doing fixed length everythings, so , e.g., x0*y0 MUST occupy same physical space as x1*y1 etc
asciilifeform: it can be used as a procedure argument anywhere you could use an array.
asciilifeform: mod6: an array slice ( concept which also exists in common lisp ) can be thought of as a sane man's pointer. i.e. it maps into the original, and writes go through; but it is guaranteed not to spill, out of the original or out of its own more constrained bound
mod6: as opposed to:
BingoBoingo: <mircea_popescu> is the "i just wanted to" right opposed at the "i just wanted to left" removal as being too radical ? after all, they DO "just want to" undisturbed ? or what ? << It seems like there is a mass of confusion in them.
asciilifeform: ( in so far as i can tell, it indeed respects the standard, and preserves control flow as written )
asciilifeform: but as it happens, my hypothesis re 'this will speed up mult' is wholly false; and the one where 'it will simplify program from reader pov' also, somewhat paradoxically, false.
mod6: as it stands, at the moment, sounds like a mechanical push. with the ability to set the length to some power of two. i'd say it's a bit harder to follow, code-wise, with the recursive calls perhaps.
mircea_popescu: is the "i just wanted to" right opposed at the "i just wanted to left" removal as being too radical ? after all, they DO "just want to" undisturbed ? or what ?
mircea_popescu: and of course as women are the social scar tissue, this is going to end up with yet another "oh, it's THEIR fault!!!", like every historical case to date. ☟︎
asciilifeform: it's ~same work as launching yer own
mircea_popescu: tru fact : you can take down satellites TODAY. as an individual effort.
a111: Logged on 2017-08-14 17:08 mircea_popescu: it's funny how all the things are the same thing and everything wraps into ideological identity. empire needs... a lot of really dumb ones, as a COLLECTIVE. we... make every one stand on its own INDIVIDUALLY.
asciilifeform: and noshit.jpg you check for nuffin, you eat the mother church's blox as the come, presumably
asciilifeform: as for the other thing, right now we have a 'classical' karatsuba that permits odd splits
mircea_popescu: asciilifeform it means there's no space for choosing, as there's an obvious right thing.
PeterL: (I was using 4160 bits as the limit)
asciilifeform: 'ffa represents a W-bit integer as a contiguous array of N machine words of bitness B, W = N*B.'
asciilifeform: ( at which point you oughta use THAT as the cap, not it )
mircea_popescu: it's funny how all the things are the same thing and everything wraps into ideological identity. empire needs... a lot of really dumb ones, as a COLLECTIVE. we... make every one stand on its own INDIVIDUALLY. ☟︎
mircea_popescu: http://btcbase.org/log/2017-08-14#1697559 << the MOST hilarious thing in there is that the fucktard thinking himself an airplane pilot asks "me copia base". you understandf this ? subhuman orc language DOES NOT HAVE WORD. thinks it's ok, just as good as anything. ☝︎
asciilifeform: as usual asciilifeform has deeply nfi why NONE of the published rsatrons, to date, do this.
asciilifeform: mike_c: not as such. no vrelease yet - pastes in logs
asciilifeform: i've been pushing folx to return to a 'dijkstaraist' concept of program, as something primarily to be ~read~, and only secondarily as something to execute on comp
mike_c: ah, as theory, yes.
mircea_popescu: mod6 pretty sure he recalls that as theory.
mircea_popescu: and now the idea is... since this could ALSO be used as a padder (in the rsa sense), a reverser is needed (takes r and s and spits out m)
phf: so this possibly invalidates my original thesis of "wreckers in sbcl!11" i just haven't spent as much time there as i have under other implementations
mircea_popescu: we laugh a lot, right, and half the time a gekko joins in, as if he got the joke. "ka-ka-ka-kaka"
mircea_popescu: he didn't get nearly as close.
mircea_popescu: helicopter notoriously vulnerable to small arsm fire. as per log discussion
deedbot: http://qntra.net/2017/08/tensions-rise-this-week-as-fake-news-media-badgers-god-emperors/ << Qntra - Tensions Rise This Week As Fake News Media Badgers God Emperors
asciilifeform: lol greek as lisp
mircea_popescu: anyway. his ro "diortosire" is a very well illuminated source, as to the original material, and if one speaks ro one benefits from reading it even if one can also read the septuagint in original.
mircea_popescu: ben_vulpes the substantial weakness segwit adds to bitcoin chain security is that witout it, one needs the power to unwind the chain AND the keys of old txn to steal bitcoin. whereas with it, one only needs the hash power, as anyone can spend the segwit shit. ☟︎☟︎
mircea_popescu: as part in the "bitcoin needs rewrite" thread.
mircea_popescu: ben_vulpes and block depth. if you make segwit tx a to me at height 1 and i put it into a normal tx at block 2, i can spend it from block 3 as my bitcoin, the segwitnmess is gone out of it. to steal it from me, one has to rewind all the way to block 1 again. which is possible, but expensive as the chain builds. ☟︎
ben_vulpes: trinque: i wouldn't go so far as to say they pulled it off
ben_vulpes: while i'm on the topic, can confirm that 'modern' asdf is all sorts of royal pita as well, although that thread has been well hashed in the logs
mircea_popescu: yeah, and detector works as low as 10 ev sorta level.
mircea_popescu: basically, a high energy xray will lose 2/3 of its energy every dozen or so meters. whatever's left illuminates the gold (there's no crossing gold, too large barn), and then gets sent back, as gold-xray-pink
a111: Logged on 2017-08-10 21:46 edivad: in the case of segwit, this means that trb won't care about segwit blocks and as long as they will complies with the "hard rules" (I really don't know how to explain myself better) they will be accepted?
shinohai: Also, from here onwards you should refer to Segwit as `Segshit`
trinque: as currently derped, yep, "segwit" shouldn't mean a damn thing to bitcoin proper.
edivad: in the case of segwit, this means that trb won't care about segwit blocks and as long as they will complies with the "hard rules" (I really don't know how to explain myself better) they will be accepted? ☟︎
mircea_popescu: the bitch with any such approach, as i realised last night. there is NO WAY to protect yourself from downstream cache. no way.
edivad: it's pretty much already modded as you have told
mircea_popescu: http://btcbase.org/log/2017-08-10#1696685 << it's cheap in the sense making your shoes by hand is cheap. it can be fun, but that's as far as it goes. leaving aside problems of how much a pair of aluminum, ruby or w/e dice cost (ie, GOOD dice), a throw provides you with a few bit's worth, FG spits out kB's worth per second. on a per-entropy-bit cost, figuring in capital goods, salary for the thrower, etcetera, FG is about 5 de ☝︎
asciilifeform: keep in mind that forgetting your 'alphabet' is just as good as forgetting the key
mod6: my V doesn't use diff anyway, only patch, gpg, sha512sum, and wget -- and otherwise just standard shell tools such as echo, mkdir, rm, cat, etc.
PeterL: oh, and I was trying to make the functions more general, avoid putting in magic numbers as much as possible
a111: Logged on 2016-08-18 12:32 mircea_popescu: asciilifeform since we're on this btw, the way i want tmsr-rsa key generation to work is as follows : a contains a number of entropy bytes specified by user in tmsr-rsa.conf read whenever tmsr-rsa.conf specifies (such as urandom); b contains a base-tmsr string specified by user. c = base-tmsr(a).b ; p = nextprime(cut(sha512(c),257)) ; process is repeated for q = nextprime (cut(sha512(c'),258));
mircea_popescu: all keys same size. ideally as per http://btcbase.org/log/2016-08-18#1524210 discussion at that ☝︎
asciilifeform: hint: consider payload P and crc C as indep. vars
mircea_popescu: literally, "came out of rsa as garbage".
mircea_popescu: crc checks that the string is the same now as it was when crc was originalyl computed
mircea_popescu: PeterL is there any security contemplated for the data, such as i dunno, encrypt the lists of peers / keys / history etc ? or simply a case of "fuck you secure your machine" ?
mircea_popescu: yes, but it ruins the security of the scheme, as i don't expect you will be sending pings to ips associated with bogus keys ?
PeterL: well, it is not unpadded, it uses the random byte string as the pad
PeterL: I just put in the crc32 as a checksum
asciilifeform: as ersatz pirate repellent
mircea_popescu: such as : epochal switch on cuba! it... didn't survive his term.
mircea_popescu: asciilifeform yes ? though it was israeli iirc, and worked irl abou as well as the recently reported stink bombs.
mircea_popescu: not to mention, of course, that everyone in the area can also hear it, there's nothing mysterious about it. yes there are ways to carry sound over inaudible ultrasound as a modulation, but guess what ? that takes even more energy! a lot more, in fact.
mircea_popescu: of course, the acoustic energy saturation dampens with distance (by the cube) and with obstacles. the jet needs something to the tune of 100 MW to take off, and all this buys you at close range and in open air is bleeding from the ears, not magical symptoms such as bruises, concussions or other mysteries.
mircea_popescu: for the record : a decibel is the log10 of the ratio between a measured sound energy density and 10^-12 J/m^3. consequently the energy of sound at 150 decibels (such as the sonic blast of a jet taking off at 25m, capable of rupturing eardrums) corresponds to an energy density of 10 ^ (150/10) * 10 ^ -12 = 1000 J/m^3.
a111: Logged on 2017-07-24 17:53 mircea_popescu: "Oakley is among a growing number of educators who view intermediate algebra as an obstacle to students obtaining their credentials — particularly in fields that require no higher level math skills." << teh confusion of ideas ffs.
asciilifeform: ( so sometimes 'not used', but the discarding takes provably same time as nondiscarding )
asciilifeform: nogood tho. because cannot be expressed as FINITE, KNOWN (for particular ffawidth) sequence of good ol'fashioned word-arithmetic ops.
asciilifeform: any practical modexp algo has to 'mod as it goes along'
asciilifeform: (' a little bit ' of seekrit-branch is same as 'little big pregnant' )
mircea_popescu: no but you write it as a full matrix, you get the undo for free
mircea_popescu: but you serialize and do a whole word's worth of bit diddle as a xor
asciilifeform: (problem from 'use as cryptosystem' pov)
asciilifeform: has same problem as every other nphard
asciilifeform: and as such is unsuitable for ptron
asciilifeform: currently i lean to unrolling them ~in the proof doc~ and leaving proggy as is.
a111: Logged on 2017-08-09 15:58 mircea_popescu: anyway, let it be said that there's nothing wrong with oaep as far as we know, but for the sake of argument a mpfhf based padding scheme would conceivably work like this : 1. given message m, of length l, generate r = random bits, of length l' up to l but not less than 256 bits. 2. compose m' = r + m + c (in that order), where c is l - l` (and its bitness is always same as the bitness of len(m')-256). 3. compose Pm = R + S +
mircea_popescu: reversing MPFHF is not required for the above quoted version, as the fhf is used there as a hash function not as a padder. (and alf's objection is valid, not a very good option, a settable size output sponge would be much better).
a111: Logged on 2017-08-09 22:09 mircea_popescu: to encrypt : take plaintext message M, no longer than 250 bytes, and zero-pad it to 250 bytes. take pile of random bits R 250 bytes long. calculate X = M xor R. calculate Y = R xor MPFHF(X) set for R.len = 250 bytes. RSA the 500 byte pile of X || Y. done. to decrypt : de-RSA the 500 byte pile. cut it in two halves. calculate R = Y xor X. calculate M as X xor R. done.
a111: Logged on 2017-08-09 23:00 mircea_popescu: the herd is lazy, the aparatchicks are scared, and the intelligent are lost in the soup, interacting with cattle and criminals as if they were people.
mircea_popescu: the herd is lazy, the aparatchicks are scared, and the intelligent are lost in the soup, interacting with cattle and criminals as if they were people. ☟︎
mircea_popescu: nobody knows what the fuck "sha 2017" is. nobody cares. even the people paid to fucking care stopped giving a shit in the 90s, as that nsa goon at "crypto conferences" piece amply attests.
mircea_popescu: to encrypt : take plaintext message M, no longer than 250 bytes, and zero-pad it to 250 bytes. take pile of random bits R 250 bytes long. calculate X = M xor R. calculate Y = R xor MPFHF(X) set for R.len = 250 bytes. RSA the 500 byte pile of X || Y. done. to decrypt : de-RSA the 500 byte pile. cut it in two halves. calculate R = Y xor X. calculate M as X xor R. done. ☟︎