Guest41016: Logged on 2017-08-14 20:37 mircea_popescu: that's why the whole "doctor shining light in eyes" thing.
asciilifeform: http://btcbase.org/log/2017-08-14#1697933 << pretty easily. asciilifeform had a bumper wreck in bmore once, passing cop declined to take report, demanded 'who was killed here? if nobody, i have no time for this, and no one else from station will come either'
Guest41016: Logged on 2017-08-14 20:57 mircea_popescu: how the fuck does the police "decline" to patrol.
asciilifeform: ( why even asked? because insurance pays 0 w/out police docs )
asciilifeform: iirc the details of this tale are in last summer's l0gz
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.
mod6: but i've only scanned it once. so perhaps I shouldnt comment too much on that.
asciilifeform tries to count how many 'improved' versions he wrote, and then discarded...
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: and incidentally mod6 , is it obvious why this only works if L is restricted to powers of 2 ?
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
asciilifeform: it can be used as a procedure argument anywhere you could use an array.
asciilifeform: array slices retain the indexing of the underlying array. this is The Right Thing ( see prev thread on subj where i explained to mircea_popescu ) but makes iterating over them slightly trickier in certain cases.
mod6: <+asciilifeform> and incidentally mod6 , is it obvious why this only works if L is restricted to powers of 2 ? << no, i think im missing the entire idea of why this is written this way.
asciilifeform: mod6: look at x0, x1, y0, y1 in original kara-mul, and xl/xh in kara-square
a111: Logged on 2017-08-14 17:20 mircea_popescu: this is actually going to be teh magic number of the republic. so at this juncture i would like to ask everyone to compute "the largest primorial (ie, product of all successive primes) that fits in 515 bits", sign it and put it into deedbot.
mircea_popescu: in other lulz, "the taking of pelham 123" is one helluva usg-film offering. we find that "wall street guys" r criminalz, that everyday mta riders are heroic (even if a little half-breed), and all sorts of good and valuable citizenship lessons for life!
asciilifeform: mod6: amusingly, if you ~did~ have a big enough and old enough universe to contain primorial(2**4096), you could factor, e.g., mircea_popescu's key, in polynomial time, with plain old gcd
shinohai: 13:40:00 @gmaxwell (also for sending out transactions people can use many other options, including SMS and snail mail--- a txn is so small you can just communicate it however else you communicate. Snail mail is slow, but if you're only communicating with the outside world via that already...)
mircea_popescu: http://btcbase.org/log/2017-08-15#1698273 << verification happens through coherence. if one man writes one program to do one calculation, that man must check that a) his implementation is correct and b) his design actually does take from input to output if correctly implemented. if however the lordship writes a dozen+ programs to do the same calculation, no one man needs to verify either a or b for his own item UNLESS there's
a111: Logged on 2017-08-15 18:45 asciilifeform: lobbes: it isn't that this doesn't work, but that the effort needed to verify that you didn't somehow miss one , is substantial
a111: Logged on 2017-08-15 06:00 ben_vulpes: what secrets of the universe did my inferior american education deprive me of?
mircea_popescu: in other words, the republican model significantly reduces costs and, incredibly enough, introduces a new revenue stream.
mircea_popescu: these premises are dependent however on diversity of implementation. (remarkably, they are not dependent on correctness of implementation ; but they are dependent on correctness of treatment of divergence, ie, no "consensus-building", ever, at all)
mod6: In that case, I have a bit more simplified version of mine that more closely resembles what I started with before.
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: it's certainly possible. i know the list "3, 5, 7, 11" is a list of primes through memory.
asciilifeform: 'bro do you lift!11' 'hey i lifted myself off the bed today!'
phf: could have a monk of saint ascii life form memorize primes by heart to the 1'000'000th one, referred to by the other monks when primes are required. "please, brother joseph, we need primes #5002 to #5040"
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: and this also means as few 'magic numbers' as it is physically possible to get away with.
asciilifeform: and this yes means that asciilifeform holds caps on modulus width to be asinine
asciilifeform: p proggy opens up with the breathoflife preamble, e.g., (TMSR!8192*3,50*500) << 8192bit bus, 3 words of stack, 50 bytes of program following the closing ), 500 steps of execution max.
asciilifeform: this means that the reader (READER, long before executing) knows precisely how much time and space the proggy requires.
asciilifeform: so he can never be surprised by 'd00d's modulus is Too Big!111omfg'
asciilifeform: if i specify a pubkey for myself with 65536-bit public mod, then other people can simply decide that i'm an arse and that verifying my sigs isn't actually +ev for them
asciilifeform: it is a matter strictly between the fella generating the key, and his wot, not for the author of rsatron.
asciilifeform: the duty of the rsatron author is ~to get the fuck out of the way~
asciilifeform: in that spirit, other thing asciilifeform aims for with 'p', is to zap the idiocy where pubkey was strictly an item for ~machine~ to read, and make it something primarily for ~man~ to read.
asciilifeform: ( while also operable on by machine, to demonstrate that the arithmetic in fact comes out as stated )
a111: Logged on 2016-12-27 05:27 asciilifeform: the only sane 'fingerprint' is the entire modulus+exponent.
a111: Logged on 2017-04-09 14:45 mircea_popescu: asciilifeform incidentally, the more i think about it the more i'm convinced the ONLY "fingerprint" for rsa key may be... the modulus. 4096 bits and fuck you, if you can't take 32 chars you don't belong here.
mircea_popescu: this is not altogether a weak argument. consider the converse though : suppose i wish to refer to my key by using fewer chars than 512 ?