Forum logs for 05 Jan 2019
| mircea_popescu: | well, meanwhile it's the 5th day of this fine new year, and it occurs to me it might be a good idea to discuss some things, lest april coming around this year like any other year be perceived as some kind of subjective surprise, rather than the objective necessity it ever is. | [09:08] |
| mircea_popescu: | foremost, the lordship is not a state, but an activity. | [09:10] |
| mircea_popescu: | so : as far as i know, bingoBoingo is working on qntra and on pizarro. he's doing a very fine job with the former i'm nonplussed with recently discovering just how broken the latter's mp-wp offering actually was moreover it seems to me from a distance pizarro's still financially and customer-wise entirely dependent, ie as close to failure as you can possibly get without spelling it out. | [09:13] |
| diana_coman: | fwiw I can't say I saw a surprise so far in any of the april announcements at most more of a difference of degree at times (i.e. the expected direction/action but to a larger/smaller degree) | [09:14] |
| mircea_popescu: | yet -- it is not my business so i'm just going to count it as such, "working on pizarro" without further inquiry (and with the firm expectation that someone IS doing all that). | [09:14] |
| mircea_popescu: | diana_coman well hopefully thusly we smooth that out. | [09:14] |
| diana_coman: | I'm all for the talk, certainly | [09:14] |
| mircea_popescu: | diana_coman is working for s.mg we've recently had this exact talk and revised our plans. originally the idea was to have moved over to cuntoo, and do support work for community-driven effort at a new client. the latter completely collapsed over the shocking weakness of such community the former's at best delayed. | [09:16] |
| mircea_popescu: | so, she'll be doing client work with her own two hands, something i had every intention to avoid and we'll be looking at integrating cuntoo on the server side later on. there's some db work in the hopper also, but that's even further on the maturity vine. | [09:17] |
| mircea_popescu: | hanbot is working on the mp-wp tree, and manages as she long has a rather largeish wetworks i'm not going to get into the details of. | [09:18] |
| mircea_popescu: | other than maintaining the deedbot infrastructure, trinque is working on cuntoo, which is a rather large piece and it taking a [difficult to predict] while is not by itself the end of the world but i'd like to see some roadmapping, tentative and subject to change as it may be, lest the effort degenerates. | [09:20] |
| mircea_popescu: | finally, asciilifeform is working on rsa-based ssl-ism replacement (notwithstanding he ~seems to be~ working on any and all wank on the "side" during spare time he doesn't have and all that), which we want so we can finally move bitcoin off sheer cretinity and into cuntoo (and which is principally why we want sane db also, but as i said -- yet immature). | [09:22] |
| mircea_popescu: | other than this, mod6 is taking time off, since mid-november. nothing wrong with this, but i'd like to see some conclusions at some point. | [09:25] |
| mircea_popescu: | danielpbarron seems lost in a bucolic paradise slash midwestern parochial nightmare of his own choosing. nothing wrong with this either, and unless i hear any better that will be the conclusion. | [09:26] |
| mircea_popescu: | i have no idea what ben_vulpes is doing these days, if anything (other than maintaining his logotron, whatever that takes). i would like to hear. | [09:27] |
| mircea_popescu: | lobbes recently unveiled actionbot, which works fine, and is evidently putting all time he can into paying off technological debt he's responsible for if not necessarily guilty of. nothing wrong with this, and it can stand as such. | [09:28] |
| mircea_popescu: | spyked is evidently trying, hence feedbot, but evidently having trouble reconciling saeculum, which i'm going to let stand as such on the grounds that he's new -- even though experience shows that as a dubious idea [for all the eg one could possibly need witness how asciilifeform 's still in the swamp, so many years later]. | [09:30] |
| mircea_popescu: | let's just say it's my considered oppinion "difficulty in reconciling" such is almost never actually due to said saeculum. | [09:30] |
| mircea_popescu: | ave1 is, i suspect, silently working on gnating things -- which is fine and valuable except for the silently part. there's this tendency of lone wolf scientist to not properly report failures, out of an imaginary saving of time and resources this permits. it must be said that NOTHING could be further from the truth, nothing at all -- there's more to be gained from a properly reported failure to find than out of ten shiny succ | [09:32] |
| mircea_popescu: | esses. | [09:32] |
| mircea_popescu: | but really, it serves no one to let me suspect. i should know. | [09:33] |
| mircea_popescu: | which leaves phf who's doing an excellent job maintaining very elegant and well done extant infrastructure, and a very terrifyingly poor job at communicating himself. | [09:34] |
| mircea_popescu: | i do not know, as i sit here, what the conclusion of the http://trilema.com/forum-logs-for-19-dec-2018#2505658 discussion was, three weeks later. the man sits among a republic built on a certain methodology, aims to quietly use the exact ~other~ methodology, makes no prior mention of this, candidly references the latter as if it worked notwithstanding how howlingly it failed to work to date, on and on in this vein and at the end of it al | [09:37] |
| a111: | Logged on 2018-12-19 20:09 phf: you're constantly in logs, confused as to how anyone can get anything from anyone, yet now you're questioning my methods. | [09:37] |
| mircea_popescu: | l i have not the faintest what even came of the long avoided but eventually unavoidable discussion. | [09:37] |
| mircea_popescu: | so, phf : how about you start clearly communicating yourself, beginning with a complete, correct and true to life adnotation of said discussion in your own hand, because this "ima go meditate on things until everyone involved forgot what i was meditating on" isn't a workable approach to intellectual life. | [09:38] |
| mircea_popescu: | this about concludes the state of affairs i'd like nothing more than corrections, disputations &c by they involved. | [09:40] |
| asciilifeform: | http://btcbase.org/log/2019-01-05#1884612 << fwiw i've ~exhausted the short-term milk of the particular side cow ( there's a disk snapshot & a recipe to post, but after that will be stalled for aeons ) | [10:05] |
| a111: | Logged on 2019-01-05 14:22 mircea_popescu: finally, asciilifeform is working on rsa-based ssl-ism replacement (notwithstanding he ~seems to be~ working on any and all wank on the "side" during spare time he doesn't have and all that), which we want so we can finally move bitcoin off sheer cretinity and into cuntoo (and which is principally why we want sane db also, but as i said -- yet immature). | [10:05] |
| asciilifeform: | currently focused on ch15. | [10:05] |
| asciilifeform: | orig release sched is blown, asciilifeform's current desire is to get again to the point where can patch its tyre and reinflate and have rel sched again | [10:06] |
| asciilifeform: | ( in orig timeline also did not include problem of constant-time keccak, which i presently do not have, and neither anyone else, but is necessary to fill mircea_popescu's spec for the final product ) | [10:07] |
| asciilifeform: | http://btcbase.org/log/2019-01-05#1884623 << at the risk of pouring petrol into that particular fire, fella also promised a http://btcbase.org/log/2018-10-06#1859075 item iirc | [10:10] |
| a111: | Logged on 2019-01-05 14:37 mircea_popescu: i do not know, as i sit here, what the conclusion of the http://trilema.com/forum-logs-for-19-dec-2018#2505658 discussion was, three weeks later. the man sits among a republic built on a certain methodology, aims to quietly use the exact ~other~ methodology, makes no prior mention of this, candidly references the latter as if it worked notwithstanding how howlingly it failed to work to date, on and on in this vein and at the end of it al | [10:10] |
| a111: | Logged on 2018-10-06 23:51 phf: asciilifeform: i don't have binary diffing even in prototype form, if you could adaize your needleman-wunsch i could add it to vtools, the way i did with diana_coman's keccak | [10:10] |
| asciilifeform: | err, bin ~delete~ knob | [10:10] |
| mircea_popescu: | he promised to ask you for an item ? or is this ada n-w published somewhere meanwhile ? | [10:10] |
| asciilifeform: | i have wrong link, 1s | [10:10] |
| mircea_popescu: | maybe its not as wrong as all that. did you ever make that thing ? | [10:11] |
| asciilifeform: | bin differ ? yes. but it was never made to current-day tmsr quality , i shelved it when mircea_popescu said it wasn't particularly useful | [10:13] |
| asciilifeform: | ( and i currently agree, really one ought not to have bins in vtrees ) | [10:13] |
| asciilifeform: | i posted a complete needleman in cl ( also a draft, rather than troo genesis, nobody stood up and said 'i want this' so shelved ) 2y ago, also. | [10:15] |
| mircea_popescu: | the ~algo~ tho. not specifically for v trees, but it strikes me there doesn't exist currently a bin differ ~at all~. | [10:16] |
| asciilifeform: | mircea_popescu: http://btcbase.org/log/2017-12-29#1760563 ( napkin-level but working item i posted on prev occasions ) | [10:17] |
| a111: | Logged on 2017-12-29 05:34 asciilifeform: >>>>> https://archive.is/jMMqT | [10:17] |
| asciilifeform: | and yes it worx. you give it a similarity matrix (i.e. 'what differences are important, in the order of their importance' in matrix form) and it produces an alignment. | [10:17] |
| mircea_popescu: | mkay. in the immortal words of that fellow, http://btcbase.org/log/2018-12-12#1880371 | [10:18] |
| a111: | Logged on 2018-12-12 19:41 BingoBoingo: ^ Any awk ninjas want to try this on a few forums? | [10:18] |
| asciilifeform: | mircea_popescu: if you have a concrete application in mind, i can spare an hour or 2 to bake | [10:18] |
| mircea_popescu: | alright we leave it like this for now. | [10:18] |
| asciilifeform: | aite | [10:19] |
| asciilifeform: | algo's pretty simple btw, 1970s thing ( tho iirc it aint in knuth aop for some reason ) | [10:19] |
| asciilifeform: | grr, was looking for mircea_popescu's also for vtron file movements, still not found in log | [10:21] |
| asciilifeform: | *algo | [10:21] |
| asciilifeform: | the 1 phf went to implement and not yet came back with. | [10:21] |
| asciilifeform: | ( phf if yer stuck, pleez say on what ? ) | [10:21] |
| mircea_popescu: | http://btcbase.org/log/2018-04-03#1792105 | [10:22] |
| a111: | Logged on 2018-04-03 00:02 mircea_popescu: asciilifeform the logged discussion on the topic was, "if hashes match but paths do not, the file was moved if hashes match and paths match, the file is untouched if hashes do not match but paths match the file was modified if hashes do not match and paths do not match the file was created/deleted" | [10:22] |
| asciilifeform: | there we go. | [10:22] |
| asciilifeform: | ty mircea_popescu | [10:22] |
| mircea_popescu: | yw. | [10:22] |
| asciilifeform: | http://btcbase.org/log/2019-01-05#1884609 << mircea_popescu is that db baking blocked on http://btcbase.org/log/2018-11-16#1873099 ? | [10:26] |
| a111: | Logged on 2019-01-05 14:17 mircea_popescu: so, she'll be doing client work with her own two hands, something i had every intention to avoid and we'll be looking at integrating cuntoo on the server side later on. there's some db work in the hopper also, but that's even further on the maturity vine. | [10:26] |
| a111: | Logged on 2018-11-16 23:13 asciilifeform: it is on hold pending resolution of http://btcbase.org/log/2018-10-26#1866266 ( and is taking back seat to ffa currently ) | [10:26] |
| asciilifeform: | ( possibly diana_coman will answer this when wakes up ) | [10:27] |
| mircea_popescu: | http://btcbase.org/log/2018-10-26#1866266 | [10:27] |
| a111: | Logged on 2018-10-26 02:14 asciilifeform: meanwhile, in gnat bugs : apparently ( and this is documented or mentioned nowhere ) : it is impossible to have a Ada.Finalization.Limited_Controlled type ANYWHERE inside a static library, unless it is generic all the way down (i.e. if the lib package is generic, any sub-packages must also be instantiated as generics ) | [10:27] |
| * asciilifeform | is refreshing chalkboard, would like to get a sense of the set of items he personally owes | [10:27] |
| mircea_popescu: | asciilifeform not ~just~ on that. also on http://btcbase.org/log/2018-12-04#1878240 and on a larger pile of [not entirely specified, and i suspect not entirely known] edges. | [10:28] |
| a111: | Logged on 2018-12-04 15:14 mircea_popescu: it's not exactly clear to me yet what the situation is. it's altogether possible postgres may be rescuable through a process similar to how "peculiar linux candidate packaging sterilized into cuntoo". | [10:28] |
| asciilifeform: | right i'm mapping out which 'known and unknown edges' are mine | [10:28] |
| asciilifeform: | if diana_coman is 'stuck on X, cannot move' and it is asciilifeform's X, i'd like to know about it asap. | [10:29] |
| mircea_popescu: | certainly. | [10:32] |
| asciilifeform: | since we're refreshing chalkboards in war room, i'ma take the chance to summarize current level of ffaism. currently exponentiator is mature ( aside from the consideration where http://btcbase.org/log/2018-12-28#1883687 , i.e. it's mature when ~other~ thinkingpeople have fit it into head and concurred ) -- i.e. runs fast enuff for many battlefield applications | [10:32] |
| a111: | Logged on 2018-12-28 20:35 asciilifeform: diana_coman: sadly i do not know how to 'guarantee perfection'. all i know how to do is to bake maximally 'fits in head' and bank that the folx here will find mistake if it turns out that i made one. | [10:32] |
| asciilifeform: | what remains is 1) prime-baking 2) rsa (and similar cryptosystems, tho c-s dun need it) padtron -- requires constant-spacetime keccak 3) optional asmistic speedups. | [10:33] |
| mircea_popescu: | wait, when did we move off oaep for rsa padding ?! | [10:34] |
| asciilifeform: | we haven't | [10:34] |
| asciilifeform: | that's item 2. | [10:34] |
| mircea_popescu: | why does it need keccak ? | [10:34] |
| asciilifeform: | cuz that's how mircea_popescu specified the padding | [10:34] |
| asciilifeform: | diana_coman implemented prototype, using koch | [10:34] |
| mircea_popescu: | ima go have to re-read this now | [10:35] |
| asciilifeform: | rsa-oaep requires hashtronics for padding. | [10:35] |
| mircea_popescu: | http://ossasepia.com/2018/03/01/eucrypt-chapter-12-wrapper-c-ada-for-rsa-oaep/#selection-133.1-133.132 << right, and you want to use ~constant time~ keccak | [10:36] |
| asciilifeform: | correct | [10:36] |
| mircea_popescu: | bitcoin, of course, needs this at no juncture. | [10:37] |
| asciilifeform: | otherwise all of the nonleakage guarantees bought at the cost they were bought at, vanish. | [10:37] |
| asciilifeform: | bitcoin dun use rsa at all, at least in classical variant of bitcoin | [10:37] |
| asciilifeform: | it needs an entirely other item ( which can be sewn from ffa parts, but has not been of yet ) | [10:37] |
| mircea_popescu: | right. | [10:37] |
| asciilifeform: | i'ma prolly have to do ~this~ with own hands, too -- no one yet stood up and said 'i will' | [10:38] |
| mircea_popescu: | point being : de-sslification of bitcoin is not stalled on this. it is stalled on prior de-sslification of cuntoo, which as such doesn't yet exist, which is not really stalled on this either. | [10:39] |
| mircea_popescu: | but rather, from what i understand, is taking finishing touches re reproducible builds, consisting principally of hunting for "Where does it piss in date or w/e ruining my sigs" | [10:39] |
| asciilifeform: | mircea_popescu: correct. the item that needs padtron, is mircea_popescu's specced 'fuckng replace gpg already' and possibly also koch-free euloratrons. | [10:40] |
| mircea_popescu: | in the sense eucrypt uses mpi you mean ? | [10:40] |
| asciilifeform: | aha | [10:40] |
| asciilifeform: | also recall the (surprising to asciilifeform , but apparently nobody else) discovery that ffatron as-is-stands is ~2.5x faster than koch. | [10:41] |
| mircea_popescu: | right. a mpi-eucrypt vs ffa-eucrypt head-on will be interesting to see. | [10:41] |
| asciilifeform: | ( otoh euloratron does not spend much cpu in rsa, as currently sewn ) | [10:41] |
| mircea_popescu: | asciilifeform it doesn't nor will it, because what truly brings serpent in is the ~space~ not the time problem. ie, because of padding, straight rsa doubles message bulk, which is a major problem for online game. | [10:42] |
| asciilifeform: | right | [10:42] |
| asciilifeform: | this is entirely tru | [10:43] |
| mircea_popescu: | but the fact that we have the eucrypt item is very useful inter alia especially for such simulated-userland-tests for core libs. | [10:43] |
| asciilifeform: | well until last wk it was the only rsatron we had that ran in something like realtime | [10:44] |
| mircea_popescu: | esp because correctly written, with tests etc. so can meaningfully do ffa-eucrypt vs mpi-eucrypt as a benchmark. | [10:44] |
| asciilifeform: | ( diana_coman's , that is ) | [10:44] |
| asciilifeform: | and as of right nao it's the only ~complete~ rsatron we have, i.e. that knows how to bake privkeys | [10:45] |
| asciilifeform: | asciilifeform's current thrust is to catch up to ~that~ | [10:45] |
| mircea_popescu: | right. | [10:45] |
| asciilifeform: | ( when i have ~complete~ sys, ~then~ mircea_popescu can go 'hmm, which one to sew ~here~' etc ) | [10:46] |
| mircea_popescu: | the more toys to play with, the more playing to be had | [10:46] |
| asciilifeform: | tbh i'm not sure what kochtronic rsa will be good for once i have the keygenning ( it apparently dun win on speed anywhere, even tho it gets to skip 0s in modexp.. ) but this time not yet come. | [10:47] |
| asciilifeform: | the 1 application where ffa defo dunwork, and koch -- does, is phuctor. | [10:48] |
| asciilifeform: | ( i dun have e.g. strassen's multiplication algo, and dun have any plans to implement, it only wins for multi-megabyte ints ) | [10:49] |
| mircea_popescu: | irony of ironies. | [10:49] |
| diana_coman: | asciilifeform, what it's good for is at least ...for contrast! | [10:49] |
| asciilifeform: | hey , partizan is perfectly happy to use schmeisser taken off dead german. | [10:49] |
| asciilifeform: | ohai diana_coman | [10:49] |
| diana_coman: | and yes, I'm eating up ffa with an eye on "maybe I can finally get rid of MPI!!" | [10:50] |
| * diana_coman | waves and catches up on logs | [10:50] |
| asciilifeform: | diana_coman: i described in this log what currently stands between 'throw out mpi' . lemme know if needs moardetail. | [10:50] |
| asciilifeform: | ( tldr -- asciilifeform needs : wrapup of gcd then miller-rabin then keccak. ) | [10:51] |
| asciilifeform: | mircea_popescu: possibly i ought add : ~mpi~ dunhave strassen. ~gmp~ (the older, 'uncut' gnu thingie) has strassen. | [10:53] |
| asciilifeform: | mpi had only (ugly as fuck) karatsubatron. | [10:53] |
| asciilifeform: | i've been referring to mpi and gmp interchangeably as 'koch rsa', but this is unscientific, i must remind that they are diff items. | [10:54] |
| mircea_popescu: | what we call mpi is closer to gmp than what the retard crowd does anyway. | [10:54] |
| mircea_popescu: | right. | [10:54] |
| asciilifeform: | mircea_popescu: mpi is subset of gmp that koch cut ( and ate $mil of microshit payola to do it, somehow ) , aha. | [10:54] |
| diana_coman: | asciilifeform, thing is: from eucrypt and eulora pov, mpi is used for "big num arithmetics" only so I CAN in fact switch to ffa even without ct-time miller-rabin esp if ffa turns out to be...faster than mpi | [10:55] |
| diana_coman: | basically there is no reason NOT TO | [10:55] |
| asciilifeform: | ( phuctor, ftr, uses a (patched, to enable bigger ints) old gmp. with asmisms enabled. ) | [10:55] |
| asciilifeform: | diana_coman: it still needs m-r | [10:55] |
| asciilifeform: | ( as well as still needs diana_coman to eat & digest the thing per se ) | [10:56] |
| asciilifeform: | diana_coman: my current understanding is that in fact it's ~2.5x faster per bit of exponent length. | [10:57] |
| asciilifeform: | ( i.e. one would have to put in mircea_popescu's specced exponent bitness where 'Bitness' is in http://www.loper-os.org/pub/ffa/hypertext/ch14/fz_modex__adb.htm#85_14 , to get the speedup ) | [10:58] |
| asciilifeform: | ( as well as adjusting 'Wi' , etc. but you get the idea ) | [10:58] |
| diana_coman: | asciilifeform, re m-r: I implemented it using mpi as per http://ossasepia.com/2017/12/28/eucrypt-chapter-3-miller-rabin-implementation/ ofc I'd rather use ffa ct-time implementation but it's not a sticking point per se i.e. I can switch my implementation from relying on mpi to relying on ffa, no? | [10:58] |
| asciilifeform: | diana_coman: correct, you in fact could | [10:59] |
| asciilifeform: | ( if asciilifeform is flattened by an anvil tonight, i'd expect that diana_coman and mircea_popescu will do something of the kind. ) | [10:59] |
| asciilifeform: | otherwise can wait for asciilifeform's constant-time m-r ( or not, depending on what's in eulora war room chalkboard, i cannot presume to know what the priority is ) | [10:59] |
| diana_coman: | well, don't get flattened please, there's already waay more work than active hands as it is | [11:00] |
| asciilifeform: | i try to avoid anvils, so far succeeded.. | [11:00] |
| mircea_popescu: | diana_coman nothing wrong with ~testing~ it at some point, anyway. | [11:00] |
| diana_coman: | mircea_popescu, exactly | [11:01] |
| mircea_popescu: | put some meat on the bones of his "check it out, speed!" thing, as a courtesy if nothing else. | [11:01] |
| asciilifeform: | mircea_popescu: thing was built to be laughably easy to glue to other programs. (if it ain't -- i'd like to know asap why ) | [11:01] |
| mircea_popescu: | and yes, in the process find whatever else. | [11:01] |
| mircea_popescu: | meanwhile in vintage, https://thumb-p0.xhcdn.com/a/NABeAMFkefz66Qu6LjtJ1w/000/015/504/830_1000.jpg | [11:03] |
| diana_coman: | asciilifeform, sometimes I wonder what exactly do you think you need/don't have to move to Romania or wherever else you consider it to be "paradise, can now do just ffa/trb/..." | [11:03] |
| asciilifeform: | diana_coman: moola | [11:03] |
| asciilifeform: | i'd expect that it would cost 1 or 2 diana_coman-days to glue ch14 ffa to euloratron, to see how performs using diana_coman's existing m-r etc. | [11:03] |
| diana_coman: | well yes, but specifically: how much would be "enough"? | [11:03] |
| asciilifeform: | diana_coman: pretty sure i discussed this depressing subj in l0gz prior, would rather not clutter war room log with replay but it'd have to be enuff to buy new passport, at the very least, and then would need to earn bread somehow ( and as sit-in-torture-room, rather than driving cab , i dun think i'll be of much use to tmsr if living in cab ) | [11:05] |
| mircea_popescu: | diana_coman amusingly, spending 50k or w/e it costs to get an old farm (including barn) in whatever, fucking alba county, go walking on the hillsides with the cowsies, would take him to his paradise, yet there he toils. | [11:05] |
| asciilifeform: | mircea_popescu: fields plow themselves in ro, or how does that work , lol | [11:05] |
| mircea_popescu: | how does what work ? | [11:06] |
| asciilifeform: | barn-to-money thermodynamic machine | [11:06] |
| mircea_popescu: | farming is not an economic activity in europe nor has it for half a century or more. | [11:06] |
| asciilifeform: | i didn't think so. hence astonishment. | [11:06] |
| mircea_popescu: | i don't know what you're astonished at ? | [11:06] |
| asciilifeform: | what would '50k barn' do for asciilifeform? | [11:07] |
| mircea_popescu: | it'd pay your rent, and most of the cost of your http://btcbase.org/log/2014-10-15#876029 budget. | [11:07] |
| a111: | Logged on 2014-10-15 19:58 mircea_popescu: asciilifeform to follow that model. qntra isn't a seller of 0-dioxin, 1814-equivalent tomatoes, but a greengrocer where they don't hire retards and don't mix shit in the fruit sala.d | [11:07] |
| diana_coman: | mircea_popescu, that's precisely why I asked for concrete sum because the way I see it...he has it | [11:08] |
| mircea_popescu: | specifically, a 5 to 10k% increase in deliverables over what you currently achieve. | [11:08] |
| asciilifeform: | diana_coman: a ro passport sells for 800k usd, last i inquired | [11:08] |
| diana_coman: | why do you need the passport *first*? (i.e. not just get one after whatever hoops are in ro, living there for x years etc) | [11:09] |
| mircea_popescu: | most romanians don't have a passport either. | [11:09] |
| asciilifeform: | so as to have gedanken-farm in own name, say ? or to be able to occasionally cross borders without using u-boat , say ? | [11:10] |
| mircea_popescu: | so if anything, not having one makes you MORE romanian, not less. | [11:10] |
| asciilifeform: | ( otherwise gotta add cost of u-boat.. ) | [11:10] |
| mircea_popescu: | asciilifeform you can cross border on your current one also lol wtf. | [11:10] |
| asciilifeform: | not once usg cancels it for unpaid tribute, neh | [11:11] |
| mircea_popescu: | you know for a fact hanbot lived there for what, better part of a decade. wtf 800k passport. | [11:11] |
| asciilifeform: | hanbot had a patron with castle, neh. | [11:11] |
| mircea_popescu: | well if usg cancels it you're then a refugee. they love those in yurp lol | [11:11] |
| mircea_popescu: | apply for a stateless person thing./ | [11:11] |
| asciilifeform: | theoretically great, in practice they seem to send those back in chains to washingtonschwitz if they're subjects of trumplincton rather than africa | [11:12] |
| mircea_popescu: | your problems are in your own mind. | [11:12] |
| mircea_popescu: | wth, most everyone travels, you go visit the surrounding places now and again, takes care of the whole problem for you. | [11:12] |
| asciilifeform: | sorta why i dun go around expecting other folx to solve'em for me. i solve with own hands ( or not, if not live longenuff ) | [11:12] |
| mircea_popescu: | you don't really want to winter in romania anyway. | [11:13] |
| asciilifeform: | so happens that i like winter on that parallel | [11:13] |
| asciilifeform: | it's my home parallel after all. | [11:13] |
| mircea_popescu: | then you don't wanna summer there. | [11:13] |
| asciilifeform: | do they have mosquitoes yet ? | [11:13] |
| mircea_popescu: | depends on exactly where, but notrly afaik. | [11:14] |
| asciilifeform: | i promise to come back to this thrd, if asked. but would like to not lose the subthread earlier : diana_coman mircea_popescu : is short-term plan to test ffaistic diana_coman-r-m ? and if so, what glue is needed for this from asciilifeform , i'ma bake. | [11:15] |
| mircea_popescu: | i imagine she's going to bake a test as time permits. it's not a top priority item but then again she moves fast. | [11:16] |
| asciilifeform: | aite | [11:16] |
| asciilifeform: | i dun expect it will need many litres of glue. | [11:16] |
| mircea_popescu: | might want to read through it / see it finished first / we. i'm not squeezing it. | [11:16] |
| asciilifeform: | what i prolly oughta roll into the conveyor, is a variant of ffacalc that's libraryized (i.e. callable from other program, with string argument containing pcode, and fills a provided buffer with the output) | [11:17] |
| diana_coman: | asciilifeform, first I do need to finish getting the ffa in, so that will still take quite a while other than that, it's more a matter of "as time permits" and as mircea_popescu says it's not top priority that being said yes, I'd like to do it and see some timings and comparison for myself | [11:17] |
| asciilifeform: | right | [11:17] |
| asciilifeform: | diana_coman: btw it is perfectly ok also to simply invoke the knobs exported in ffa.ads directly, but then you gotta take care of 1) endianism of the words being put in and gotten out , to match yours 2) testing for div0 , as done in http://www.loper-os.org/pub/ffa/hypertext/ch14/ffa_calc__adb.htm | [11:18] |
| asciilifeform: | ( if you use pcode, these get done inside ffacalc, and ditto the stack memory mechanics, as you prolly knew already ) | [11:19] |
| diana_coman: | will keep in mind, ref the log when I get there and definitely come and shout at asciilifeform when/if I get stuck on something related to this | [11:19] |
| asciilifeform: | user of pcode never has to manually consider memory, so long as he knows how much stack to instantiate it with ( e.g. for modular exponentiation, you need 3 FZ worth of stack ) , and it properly eggogs if you mismeasure. | [11:20] |
| asciilifeform: | so, to illustrate: | [11:21] |
| asciilifeform: | !!up pehbot | [11:21] |
| deedbot: | pehbot voiced for 30 minutes. | [11:21] |
| asciilifeform: | !A .~# | [11:21] |
| pehbot: | asciilifeform: FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF | [11:21] |
| asciilifeform: | !A FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF0 | [11:21] |
| pehbot: | asciilifeform: EGGOG: Pos: 0: Stack Underflow! | [11:21] |
| asciilifeform: | err | [11:21] |
| asciilifeform: | !A .FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF0 | [11:21] |
| pehbot: | asciilifeform: EGGOG: Pos: 65: Constant Exceeds Bitness! | [11:21] |
| asciilifeform: | ^ there we go | [11:21] |
| asciilifeform: | or, e.g., | [11:22] |
| asciilifeform: | !A .1.1.1MX (this is ok ) | [11:22] |
| pehbot: | asciilifeform: | [11:22] |
| asciilifeform: | !A (but this aint ) .1.1MX# | [11:22] |
| pehbot: | asciilifeform: EGGOG: Pos: 22: Stack Underflow! | [11:22] |
| asciilifeform: | and so forth. | [11:22] |
| asciilifeform: | ( this being for the given bitness, which in pehbot is hard-welded to 256 ) | [11:23] |
| asciilifeform: | and likewise, you can put as many fz on stack as the stack height given in invocation of ffacalc, but not any moar. | [11:24] |
| asciilifeform: | ( i'ma stop here, folx who ate ch4 know all of this kindergartenisms ) | [11:24] |
| asciilifeform: | ffa is designed to be used via pcode (aka 'peh') but i'm not about to tell folx that they absolutely must. given the stated reqs (you gotta test for div0ism, we dun do it internally given as it's thermonuke performance) it can be safely used directly. | [11:28] |
| asciilifeform: | ( for the l0gz, refresher: pcode is meant to give a mechanically simple system where yer privkey is a pcode string, and so is yer pubkey, and so are ciphertexts, and whole mechanism is set in motion simply by feeding pcode to the processor ) | [11:30] |
| diana_coman: | well, I hardly see how you can *stop* people from using it directly or why exactly and the endian + div0 don't sound like a huge layer anyway | [11:30] |
| asciilifeform: | rright, but i dun necessarily mean to even discourage people from using directly. | [11:30] |
| asciilifeform: | so long as they know which end of the rifle bullet goes out from. | [11:30] |
| diana_coman: | well, if they don't, they'll find out quickly :| | [11:31] |
| asciilifeform: | heh | [11:31] |
| * diana_coman | goes back to chopping client "code" | [11:32] |
| asciilifeform: | ( using it directly, is sorta analogous to https://www.youtube.com/watch?v=A4QagenzsK0 . can be done... ) | [11:33] |
| asciilifeform: | http://btcbase.org/log/2019-01-05#1884619 << from ave1 , i hope to see a 'port' of tmsr-gnat that can be hard-welded into cuntoo as primary gcc ( to remove the hack where it builds gcc5, then down to 4.9, and neither of'em being a gnat ) | [11:37] |
| a111: | Logged on 2019-01-05 14:32 mircea_popescu: ave1 is, i suspect, silently working on gnating things -- which is fine and valuable except for the silently part. there's this tendency of lone wolf scientist to not properly report failures, out of an imaginary saving of time and resources this permits. it must be said that NOTHING could be further from the truth, nothing at all -- there's more to be gained from a properly reported failure to find than out of ten shiny succ | [11:37] |
| asciilifeform: | also at some point it'd be great to have a mips gnat, so i can plant ffa on pocket-sized irons. but that's for muchlaters. | [11:37] |
| asciilifeform: | ( already hats off to ave1 , who did year+ of gnat cleanup that asciilifeform was solidly convinced he'd have to do with own hands and the fixed inlining gave us a ~2x ffa speedup 'for phree' ! ) | [11:37] |
| asciilifeform: | http://btcbase.org/log/2019-01-05#1884626 << i suspect phf is hunting elk in kamchatka, or similar , atm ( i.e. still waiting for http://btcbase.org/patches?patchset=ffa refresh , so i dun think he's been at console much recently ) | [11:40] |
| a111: | Logged on 2019-01-05 14:38 mircea_popescu: so, phf : how about you start clearly communicating yourself, beginning with a complete, correct and true to life adnotation of said discussion in your own hand, because this "ima go meditate on things until everyone involved forgot what i was meditating on" isn't a workable approach to intellectual life. | [11:40] |
| asciilifeform: | hopefully he comes back soonish ( i'ma not even pester him re bolix, bolix is asciilifeform's personal war, learned not to expect help from anyone, and currently in refrigerator, i dun expect to spend much time on it while ffa undone ) | [11:41] |
| asciilifeform: | i admit that i'm at least a little curious how phf finally managed escape velocity from the bigzone, but if he doesn't feel like spilling re subj, also won't cry. | [11:44] |
| asciilifeform: | http://btcbase.org/log/2019-01-05#1884603 << BingoBoingo i'd ~really~ like to hear what is current plan for gettin' heathen custom, so as to finally get the hell out of the red. asciilifeform dun have a massive treasure chest that can run pizarro 'on battery' 4evah (hopefully not surprising, this) | [11:45] |
| a111: | Logged on 2019-01-05 14:13 mircea_popescu: so : as far as i know, bingoBoingo is working on qntra and on pizarro. he's doing a very fine job with the former i'm nonplussed with recently discovering just how broken the latter's mp-wp offering actually was moreover it seems to me from a distance pizarro's still financially and customer-wise entirely dependent, ie as close to failure as you can possibly get without spelling it out. | [11:45] |
| asciilifeform: | and without pizarro, it will be very very cold and dark and we'll be drifting in the unforgiving vacuum of interstellar space. | [11:46] |
| asciilifeform: | mircea_popescu: any idea what happened to esthlos ? | [11:50] |
| asciilifeform: | !#seen esthlos | [11:50] |
| a111: | 2018-10-23 <esthlos> http://btcbase.org/log/2018-10-19#1864316 << apologies alf, I'm running behind! trying to gather time to get caught up in the next week or two | [11:50] |
| asciilifeform: | to round out the 'loose ends' thread -- asciilifeform also has a ~90% built node-walker and www front end for same. but it is in refrigerator, no one is direly starving for the lack of the thing, i expect i'll come back and finish it off strictly after ffa is fielded . | [12:07] |
| asciilifeform: | there is also a serpent-on-ice40 thing, with similar level of unfinishitude and a ice40-powered 'FG2', ditto. | [12:07] |
| asciilifeform: | ( there is also a 'giant ice40' that amberglint dug up recently, that gotta be tested, but i dun even physically have 1 yet, and deliberately not bought so as not to distract from moar urgent matters ) | [12:09] |
| asciilifeform: | to entirely round off the chalkboard, mircea_popescu may be interested to know that no one has called the 1-800 since we last spoke of it. the current summed cost stands at 12 orcbux, and is set to increment by 22 orcbux/mo ( we've spent the vendor's 'test drive' bait). i'ma cover the lunch money cost of this item until given to know that it aint wanted. | [12:11] |
| asciilifeform: | this concludes the 'state of asciilifeform' broadcast for nao -- plox to lemme know if i missed sumthing. | [12:13] |
| * asciilifeform | will bbl, maintaining meat systems | [12:13] |
| BingoBoingo: | <asciilifeform> and without pizarro, it will be very very cold and dark and we'll be drifting in the unforgiving vacuum of interstellar space. << Today crunching monthly numbers. Followed on the agenda by reviewing 2018/putting forth tentative plan based on those lessons 2018 | [12:34] |
| lobbes: | http://btcbase.org/log/2019-01-05#1884616 << imo, this is a perfect summary of my current state. I walked through the tmsr doors in ~2014 at roughly epsilon and 'learned as I went'. As a result, many of my projects here were built on unsteady scaffolding, and I have been slowly going back and pouring in proper foundations where needed | [13:07] |
| a111: | Logged on 2019-01-05 14:28 mircea_popescu: lobbes recently unveiled actionbot, which works fine, and is evidently putting all time he can into paying off technological debt he's responsible for if not necessarily guilty of. nothing wrong with this, and it can stand as such. | [13:07] |
| lobbes: | possibly the bar to lordship will raise above me while I rebuild, but regardless I'ma keep rebuilding as it seems the only sane move for me. Ultimately, I just want to continue to be +ev for the republic and no way to do that without paying my technological debts | [13:07] |
| lobbes: | !Xsell 140mn 48 500 wired filthy fiats (WU) | [15:12] |
| auctionbot: | Sell order # 1033 created by lobbes: 500 wired filthy fiats (WU) Opening: 140mn ecu Ending: 2019-01-07 08:15:26.113976 UTC (47 hours) | [15:12] |
| mircea_popescu: | meanwhile in other olds, https://thumb-p1.xhcdn.com/a/YfBOpNSfEGCbtgf3vER4rg/000/015/504/831_1000.jpg | [16:10] |
| mircea_popescu: | asciilifeform no idea re esthlos . maths dude who did summaries, then fell behind, then caught on and wanted to put more effort into it, then fell behind again. maybe he re-emerges. | [16:13] |
| mircea_popescu: | asciilifeform yeah, give the phone thing a year or two, whynot. | [16:15] |
| mircea_popescu: | lobbes on the positive side, at least now you know that should that occur, it won't occur in 2019. | [16:15] |
| lobbes: | this is encouraging. And if it occurs in 2020, then by that time I'll hopefully have built the solid foundation upon which to launch back into lordship in 2021. | [16:29] |
| asciilifeform: | mircea_popescu: in moar pedestrian matters : daykin's algo , turns out, aint good for much -- at least, not in anyffin like orig form. consider the case where P is large ( but not at all close to complement(P) ) and Q is 1. | [17:21] |
| asciilifeform: | you get a potentially 'geological' number of steps that increment by 1. | [17:21] |
| asciilifeform: | ( e.g. 64 bits worth of 'increment this 4096-bit fz by 1' is roughly 400 years... ) | [17:23] |
| mircea_popescu: | works well for the example he gave -- numbers with same digit count. | [17:23] |
| asciilifeform: | aha, for napkin numbers. | [17:23] |
| asciilifeform: | i suspect that it's possible to cure it by adding 2^k-multiples of the small Q instead of Q itself, tho | [17:24] |
| asciilifeform: | ( and then shifting out the 2^k ) | [17:24] |
| asciilifeform: | rather like what we did in barrett. | [17:24] |
| mircea_popescu: | possibly | [17:25] |
| asciilifeform: | it is interesting to note, i did an exhaustive dig re gcd algos and found that there are half a dozen sub-quadratic ones, but none of those can be made constant-time. | [17:25] |
| asciilifeform: | (i.e. working subquadratically in worst-case) | [17:25] |
| asciilifeform: | so anyffin we do for gcd is gonna be quadratic, q is strictly re the constant factor. | [17:26] |
| asciilifeform: | this isnt catastrophic (or surprising, apeloyee warned about it yr+ ago) , and the only place where need gcd is the pre-millerrabin primorial 'divisible by small primes?' litmus. but would still be good to cut the constant down. | [17:27] |
| asciilifeform: | and even a dog-slow gcd is still faster than knuth-division by each of million smallprimes. | [17:28] |
| mircea_popescu: | one simple solution would be to just keep digit-appropriate primorial. | [17:55] |
| mircea_popescu: | test as many small primes as their product is as many digits as your proposed large prime and be done with it, daykin will work ok for same bitness | [17:56] |
| mircea_popescu: | ~that~ is one of the exceedingly rare justifications for magic number. "what is this 2048 bit strange ?" "the product of the first as-many-primes-as-their-product-fits-in-2048-bits" | [17:58] |
| feedbot: | http://bimbo.club/2019/01/philosophical-transactions-for-the-months-of-september-and-october-1715-part-ii/ << Bimbo.Club -- Philosophical Transactions. For the months of September and October, 1715 - Part II. | [18:19] |
| asciilifeform: | mircea_popescu: magic # primorials are unavoidable. but i dun immediately see how to make it go with daykin, there aint a bailey-borwein-plouffe-style algo for gcd | [18:34] |
| asciilifeform: | ( i suspect btw that if there were , you could nail rsa, thinkaboutit ) | [18:34] |
| mircea_popescu: | consider the simpler case of 16 bit rsa. you thus make two 8 bit primes. you daykin each of these with 210, which happens to be the 8 bit primorial, aka 11010010. | [18:35] |
| mircea_popescu: | had you instead used 32 bit rsa, you'd have had two 16 bit primes you'd have daykin'd with 2×3×4×7×11×13 aka 0x5DD8 | [18:37] |
| asciilifeform: | soo hm, what's the idea, 8192 stored primorials ? | [18:41] |
| mircea_popescu: | just a 8192 bit number, equal to their product. | [18:43] |
| mircea_popescu: | you simply gcd each candidate prime with the same "product of primes in order up to bitness" | [18:43] |
| mircea_popescu: | it's a one-shot thing, and it eliminates however many dozen small primes. | [18:43] |
| mircea_popescu: | (i suppose if indeed you want to test MORE small primes than fit in one 8kb, you'll have a number of such composite numbers to test about. however many it takes. and yes, you can clever the knobs so they're not in strict order so that the composites are each exactly 8192 bits) | [18:44] |
| asciilifeform: | 'product but up to bitness' dun do the same job | [18:48] |
| asciilifeform: | ( storing e.g. 8192 primorials, ~would~ work, tho ugly, but ~would~ leak the bitness when fired ) | [18:52] |
| mircea_popescu: | huh ? | [18:58] |
| asciilifeform: | primorial that fits in, e.g., 2047 bits, is not equal to '1st 2047 bits of primorial that fits in 2048' | [18:59] |
| asciilifeform: | ( would be nifty if it were, tho... ) | [18:59] |
| asciilifeform: | on top of this, if you actually carry out a diff stream of instructions for 2047 and 2048, you leak the bitness of the integer under test. | [19:00] |
| asciilifeform: | which is a nogo. | [19:00] |
| asciilifeform: | gcd(x, primorial) gotta use same instructions when x = 0, 1, ... as when it equals 2^ffawidth - 1 . | [19:01] |
| mircea_popescu: | dude, why is every little thing such a fucking uphill struggle with you. suppose you wish to see if x is coprime with the number 2. you run gcd (x, 2). suppose then you wish to also see if x is coprime with the number 3. you run gcd(x, 3). all this is EXACTLY EQUIVALENT to running gcd (x, 6) : if this returns 2, it was not coprime with 2, and if it returns 3, it was not coprime with 3. | [19:02] |
| mircea_popescu: | since your best gcd algo seems to be one that expects x and 6 be same bitness, there's nothing wrong with making a buncha prefab such products-of-primes. | [19:02] |
| mircea_popescu: | then test against them. | [19:02] |
| asciilifeform: | this much is correct, and why i have gcd to begin with. right nao i have a modified stein that goes in constanttime. | [19:02] |
| asciilifeform: | orig q was whether it is possible to improve the constant factor of stein. | [19:02] |
| mircea_popescu: | the whole discussion was re daykin, specifically that for our particular usecase, it's not the end of the world that it wants "napkin numbers" : we enjopy the luxury whereby we can construct them to measure. | [19:03] |
| asciilifeform: | it is used to take gcd(x, primorial(currentwidth)) , and if it dun equal 1 or x , then x is 'cheaply known composite' . | [19:03] |
| asciilifeform: | mircea_popescu: if you gotta do multiple calls to gcd to take gcd(x, primorial) you lose the win from using gcd. | [19:04] |
| asciilifeform: | whole point is that it tests for divisibility by million small primes in 1 pull of trigger. | [19:04] |
| mircea_popescu: | possibly. that's not clear, nor was it ever discussed before now. it MAY BE that a dozen calls of gdc-daykin(x, daykin-primorial) are in fact cheaper than 1 call to gdc-stein(x, primorial(currentwidth)). | [19:04] |
| mircea_popescu: | it all depends on the quadratic and parameters etc. | [19:05] |
| asciilifeform: | and yes it is possible to daykin with a hardcoded list of primorials, 1 for each possib bitness. the issue aint even that you gotta keep around e.g. 8192 primorials ( you do, they can't be sliced ) , but that it leaks the bitness of X . | [19:05] |
| mircea_popescu: | the bitness of x is already leaked : 2048. | [19:05] |
| asciilifeform: | nope | [19:05] |
| asciilifeform: | the factual bitness | [19:05] |
| mircea_popescu: | ... | [19:05] |
| asciilifeform: | which can be e.g. 1, or 17, etc | [19:05] |
| asciilifeform: | ( index of highest 1 bit ) | [19:05] |
| mircea_popescu: | what ? | [19:05] |
| mircea_popescu: | all our factors are 2048 bits per spec. | [19:06] |
| asciilifeform: | bitness in the FZ_Measure sense of the word. | [19:06] |
| asciilifeform: | of X ! | [19:06] |
| asciilifeform: | not of the primorial ( 'Y' if you will ) | [19:06] |
| mircea_popescu: | this wasn't a rsa genprime application ? | [19:06] |
| asciilifeform: | of the unknown integer being tested. | [19:06] |
| asciilifeform: | it is, and x is a random string from rng | [19:06] |
| mircea_popescu: | the "unknown integer" being tested IS ALWAYS 2048 BITS. | [19:06] |
| asciilifeform: | why, cuz you pegged the high bit ? | [19:06] |
| mircea_popescu: | cuz im not going to have non-2048 factors in my 4086 bit rsa key, wtf. | [19:06] |
| asciilifeform: | remember, gcd will be an exposed operator, 'G' . can be used for ~anything~ . | [19:06] |
| asciilifeform: | simply so happens that it is also needed for rsa primegen. | [19:07] |
| asciilifeform: | this is the montgomery thread replayed | [19:07] |
| asciilifeform: | no canhaz montgomery, cuz modexp gotta work for ALL ints. | [19:07] |
| asciilifeform: | same here. | [19:07] |
| mircea_popescu: | i thought this entire discussion was a) specifiucally as to daykin (not to stein) and b) specifically as to primegen for rsa secret key baking, (not "in general math functions). | [19:07] |
| asciilifeform: | tho i finally see what mircea_popescu was getting at earlier re daykin. | [19:07] |
| asciilifeform: | yes , you can do this is if all you want gcd for is primegen. | [19:07] |
| asciilifeform: | so happens that it is needed as a general-purpose knob tho. | [19:08] |
| mircea_popescu: | otherwise, i guess daykin gcd can exist as a class, native or extended, w/e. | [19:08] |
| mircea_popescu: | nobody is going to hate your ffa if it includes montgomery, with the proper warning. | [19:08] |
| mircea_popescu: | (whole thing already comes with a "nozero" rule anyways) | [19:08] |
| asciilifeform: | anyway i suspect that i'm overmassaging this particular piece, most of cost of primegen will be in m-r regardless of how i bake gcd. | [19:08] |
| mircea_popescu: | prolly. | [19:09] |
| asciilifeform: | mircea_popescu: nonzero rule is elementarily cuz you cant div0. | [19:09] |
| asciilifeform: | btw iirc apeloyee had a comment re 'why do you want to gcd(x, primorial), why dontcha generate a random x and multiply it by primorial + 1 ' | [19:09] |
| asciilifeform: | i can't recall why i barfed tho, nao i gotta dig out the notes... | [19:10] |
| asciilifeform: | oh hm i recall nao. ( it was because operator 'P' wants to be a general-purpose primality test, valid for any input whatsoever that fits in the ffawidth, rather than simply 'generate prime' ) | [19:10] |
| asciilifeform: | ( why this is, is because for certain types of pubkeycrypto, you want to test adjacent nums for primality. rsa in particular. ) | [19:11] |
| mircea_popescu: | i don't get it how you expect to multiply some value by a (product of primes +1) and not get an even number. | [19:11] |
| asciilifeform: | grr nao i gotta find the orig statement, which wasn't obv. broken | [19:12] |
| asciilifeform: | ( mircea_popescu is elementarily correct here ) | [19:13] |
| asciilifeform: | aah it was x * (primorial) + 1 obv. | [19:13] |
| asciilifeform: | not x * (primorial + 1 ) lol | [19:13] |
| mircea_popescu: | and this is... an even number. | [19:13] |
| asciilifeform: | as in euclid's proof-there-aint-a-last-prime. | [19:13] |
| mircea_popescu: | behold, | [19:14] |
| mircea_popescu: | !Qcalc 7 * 11 +1 | [19:14] |
| lobbesbot: | mircea_popescu: 78 | [19:14] |
| asciilifeform: | 7 or 11 is a primorial ?! | [19:14] |
| mircea_popescu: | !Qcalc 3 * (5*7*11*13*17)+1 | [19:15] |
| lobbesbot: | mircea_popescu: 255256 | [19:15] |
| asciilifeform: | ok this dunwork, i'ma have to pull out the orig item | [19:15] |
| mircea_popescu: | well this was entertaining, bbl. | [19:15] |
| asciilifeform: | lol | [19:15] |
| asciilifeform: | http://btcbase.org/log/2017-10-07#1722402 << oook here it was. | [19:17] |
| a111: | Logged on 2017-10-07 21:48 apeloyee: http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-prime-fit-in-your-primorial and find what number of primorial is congruent to it using chinese remainder theorem | [19:17] |
| asciilifeform: | not particularly relevant to the problem of general-purpose isPrime() tho, so i'ma put it back on shelf for nao. | [19:17] |
| asciilifeform: | http://btcbase.org/log/2019-01-06#1884935 << i actually considered to have 'if low bit is 0 - i.e. N is even -- then montgomery, otherwise barrett' but what this does is break constanttimeism of modexp -- nao you broadcast the parity of N for whole planet, cuz entirely diff execution profiles for the 2 algos. and montgomery is at the very most a 10% revvup over barrett. | [19:23] |
| a111: | Logged on 2019-01-06 00:08 mircea_popescu: nobody is going to hate your ffa if it includes montgomery, with the proper warning. | [19:23] |
| asciilifeform: | ( and if you montgomery, then you gotta either test whether gcd(N, modulus) == 1 , or ~assume~ , the latter is a mine that user will step on. unlike div0ism , it is not an inexpensive test . ) | [19:24] |
| mircea_popescu: | i dunno why you barfed but i barfed because it's fucking stupid, you lose a lot of variety in your primes for no gains worth the mention. | [19:24] |
| mircea_popescu: | and i meant include barret ~as an optional~, like a callable function. | [19:24] |
| mircea_popescu: | since you're doing this "general purpose", there's no crime if user can call montgomery. | [19:25] |
| asciilifeform: | mircea_popescu: barrett is the 1 that actually works for all integers without restricted domain. | [19:25] |
| mircea_popescu: | so ? | [19:25] |
| asciilifeform: | so , my spec was 'all operators do The Right Thing arithmetically, and program stops if you demand div0' , like yer cpu does. | [19:25] |
| asciilifeform: | rather than 'watch out, be sure that you constructed right inputs, or you might get soup' | [19:25] |
| asciilifeform: | mircea_popescu: the 'lose variety of primes' was my objection to using wholly-constructed primes. rather than in prelude to m-r . | [19:26] |
| asciilifeform: | ( apeloyee originally proposed it as substitute for primality testing per se where it elementarily constricts the domain of possible primes, and is unacceptable per my lights ) | [19:26] |
| mircea_popescu: | right. | [19:26] |
| mircea_popescu: | anyway, nothing wrong with that ffa design choice, if you like it if you don't anymore, also not the end of world. | [19:27] |
| asciilifeform: | upstack, i'ma polish off stein, and see if the lily in fact needs gilding ~after~ | [19:27] |
| asciilifeform: | rather than to hold up orchestra for its gilding. | [19:27] |
| asciilifeform: | ( as for the other thing -- much of asciilifeform's oddball 'must work for all integers!' thrust, is on acct of his interest in cryptosystems other than classic rsa, e.g. c-s and variations on theme ) | [19:29] |
| asciilifeform: | c-s actually has 1 interesting win over good old rsa -- it dun need a hash padtron | [19:30] |
| asciilifeform: | but this is a diff thread, possibly. | [19:30] |
| asciilifeform: | ( and at any rate we gotta have trad rsa working 1st, before any such side dishes can be considered ) | [19:30] |
| mircea_popescu: | sure. | [19:33] |
| asciilifeform: | i'm carrying out mircea_popescu's orig spec, where 'i want a peh key with my rsa modulus that i carved on the mountain' or how it went. | [19:33] |
| mircea_popescu: | just note that eucrypt having rsa does in no manner hurt your serpent-only-phonecrypto putative app just like it having serpent dun hurt a "this is my pgp implementation" usecase, and so on. | [19:33] |
| asciilifeform: | right. whole affair is 'what's the most general arithmetron that is also a useful rsatron', from my pov. | [19:34] |
| mircea_popescu: | libraries, definitionally, contain functionality some end users won't use. | [19:34] |
| asciilifeform: | correct. ( i'ma include jacobi operator, after thing is flying in the field, even tho none of the currently popular schemes use it, for instance. ) | [19:34] |
| mircea_popescu: | right. | [19:35] |
| asciilifeform: | ideally , one'll be able to implement any crypto scheme without having to rip into the ada simply by writing pcode. | [19:35] |
| asciilifeform: | at ~that~ juncture it'll be possible to ~hardwarize~ the thing, into the ultimate (per horse's mouth) usg nightmare. | [19:36] |
| asciilifeform: | ( i.e usefully general-purpose cryptotron. ) | [19:36] |
| asciilifeform: | i.e. that 8192-bit cpu mircea_popescu gedankenexperimented. | [19:37] |
| mircea_popescu: | right. | [19:37] |
| asciilifeform: | it'll be quite a riot, i expect, when the problem for enemy of determining what to do with ~an unknown pubkey~ is suddenly np-hard. | [19:38] |
| asciilifeform: | ( suddenly, 'which of these bigints do we need to try and factor, and which are noise' becomes an open human-powered q ! for'em. ) | [19:39] |
| asciilifeform: | it took asciilifeform 2y ( 3, if you count the mpi dead ends ) to build ~that~ deathray. and it's just about ready to fire.. | [19:40] |
| asciilifeform: | i can picture, for instance, that some folx will have a pubkey where 'well, first you gotta decrypt via these 2 rsa keys, and depending on the low 4 bits of the plaintext, the rest is via 1 of these 4 c-s' or the like. | [19:41] |
| asciilifeform: | the problem of even beginning to break, becomes , from empty space, exponential. | [19:42] |
| asciilifeform: | ( of course it also becomes possible to blow out yer own brains by misconstructing a pubkey, but this is a problem that existed before me and will exist after ) | [19:43] |
| asciilifeform: | and this is before you even consider that the plaintext itself can be pcode... | [19:44] |
| mircea_popescu: | finally some actual movement in teh damned horses. | [19:50] |
| asciilifeform: | imho yes. actually using 'we have a comp' for sumthing tangible. | [19:51] |
| asciilifeform: | ( in this case, to make enemy have to sweat to simply determine ~what cryptosystem~ particular key is for.. ) | [19:51] |
| asciilifeform: | let'em 'ai' or whatever. haruspicy. necromancy. | [19:52] |
| mircea_popescu: | "them" keks. | [19:53] |
| mircea_popescu: | what fucking them. the ~pretense~ is entirely based on cheapness. no cheapness, no pretense. | [19:53] |
| asciilifeform: | for all values of 'thems', present, future. | [19:53] |
| mircea_popescu: | same exact reason preteen boys don't discuss their "sexual conquests" within hearshot of adult woman. | [19:54] |
| asciilifeform: | stupidity, as mircea_popescu pointed out in the old essay, 'has infinite health' | [19:54] |
| mircea_popescu: | i don't recall any villein serfs going around derping about http://btcbase.org/log/2019-01-03#1884205 / http://trilema.com/2014/agency-and-other-notes/#selection-31.0-31.271 five centuries ago. | [19:55] |
| a111: | Logged on 2019-01-03 19:24 stratum: Right now, for the billions, I think it is probably better than nothing, just like easily popped household locks. | [19:55] |
| asciilifeform: | 5 no , 2 yes | [19:56] |
| asciilifeform: | ( even 5 maybe -- hussites ? ) | [19:56] |
| asciilifeform: | or hm, who were the derps on mountain fort with 'equalite liberte'... | [19:57] |
| asciilifeform: | cathars ? | [19:57] |
| asciilifeform: | that sorta thing is always there, somewhere, like polio. | [19:57] |
| mircea_popescu: | closer to southern france resistence to growing crown than anything in the derp vein, but why not./ | [19:57] |
| asciilifeform: | there's 'resistance' but then there's 'кто был ничем тот станет всем'(tm)(r), former dun necessarily roll in the latter | [19:59] |
| asciilifeform: | i suppose if archaeologizing re the latter, oughta start at spartacus.. | [20:00] |
| Mocky: | I just hit double digit grand kids | [22:17] |
| Mocky: | and number 11 is in the oven | [22:20] |
| asciilifeform: | congrats Mocky | [22:24] |
| asciilifeform: | coincidentally, i nailed garbage panda #11 today. | [22:25] |
| asciilifeform: | ( http://bimbo.club/#footnote_6_114 << them ) | [22:26] |
| asciilifeform: | ( not nearly as sisyphian work as may seem, 1 good hunt removes infestation for 2-3 month ) | [22:27] |
| Mocky: | to bring it full circle, I saw one of my grandsons yesterday watching a cartoon about how helpful raccoons are for eating trash so less waste goes to the land fill, and how clean and friendly they are | [22:35] |
| Mocky: | was hoping to see a russian d00d shoot at them from a window, but no, instead the raccoons went down to the creek after dinner to wash their paws | [22:38] |
| BingoBoingo: | If only there were a way to get the locals to put the reject trash back in the dumpster when they finish mining | [23:06] |
| asciilifeform: | http://btcbase.org/log/2019-01-06#1885027 << oblig >> http://btcbase.org/log/2015-02-11#1015606 | [23:15] |
| a111: | Logged on 2019-01-06 03:35 Mocky: to bring it full circle, I saw one of my grandsons yesterday watching a cartoon about how helpful raccoons are for eating trash so less waste goes to the land fill, and how clean and friendly they are | [23:15] |
| a111: | Logged on 2015-02-11 06:58 BingoBoingo: A viewer complained that an episode of the animated childrens series Peppa Pig was inappropriate for an Australian audience because it said that spiders were not to be feared. >> http://about.abc.net.au/complaints/peppa-pig-received/ | [23:15] |
| asciilifeform: | 'tis said that in gringolandia there's a steady stream of rabies cases from some derp who hand-feeds 'cute furry' shitpanda | [23:16] |
| asciilifeform: | ( fox is rare here, so the primary reservoir of the virus is instead this ) | [23:18] |
| asciilifeform: | nicoleci aint wrong, btw, they'll walk right up to you. | [23:20] |
Category: Logs
