← | Results 1501 ... 1750 found in all logged channels for 'ffa' | →
(trilema) asciilifeform: from_ffa: hello ?
(trilema) deedbot: from_ffa voiced for 30 minutes.
(trilema) mircea_popescu: (the whole nihongo affair may be interesting to the student of high functioning autist idiocy because it's to my knowledge the only documented case of japanese being incredibly fucking dense in the sense of "dumber for being smart than if you weren't smart at all")
(trilema) mircea_popescu: asciilifeform so are you implementing maurer in ffa ?
(trilema) mircea_popescu: http://trilema.com/2016/how-to-participate-in-the-affairs-of-the-most-serene-republic/ << reviewed this yet again, mostly to include / fix ben_vulpes links and some changes to structure (merged irc bot, v impl and following the guides (which was in red before?!) all into section V, orange.)
(trilema) asciilifeform: it is worth to keep in mind that ffa is , to steal from knuth, 'for readers to read first, and for machine to execute second'
(trilema) asciilifeform: ( ffa specifically. in ffa_calc, very obviously they do , in the stack mechanism . however the inner loops, i.e. 99.9999...% of the time is spent, in ffa proper. )
(trilema) asciilifeform: ffa is one of the very few ( i dun expect to see another ) proggies where you can prove bounds. because the array indices do not EVER depend on the inputs.
(trilema) asciilifeform: http://btcbase.org/patches/ffa_ch4_ffacalc#L194 << from here , to end of ffa_calc.adb, whole mechanism.
(trilema) asciilifeform: obv. this sort of misery will not be used in ffatronic rsa.
(trilema) asciilifeform: it does need the fast ffa, among other items.
(trilema) asciilifeform: specifically re postscript --when it was new, it was every bit as clean and orthogonal as, say, ffacalc.
(trilema) asciilifeform: http://btcbase.org/log/2018-01-07#1766206 << after ffa i'ma necessarily move on to the chore of nailing down gnat.
(trilema) asciilifeform: http://btcbase.org/patches/ffa_ch1_genesis#L161 << the specific item that seems to fail on his box
(trilema) esthlos: libffa builds fine on fresh press, but not the demo http://wotpaste.cascadianhacker.com/pastes/HtlZe/?raw=true
(trilema) asciilifeform: and what it looks like is that your gprbuild, for some odd reason , refuses to recurse. try gprbuild inside libffa , then afterwards gprbuild inside ffademo.
(trilema) esthlos: uh, just used ./v.pl p press_output ffa_ch1_genesis.vpatch, if that's what you mean
(trilema) asciilifeform: the only data-dependent branches are in ffa_calc , the calculator.
(trilema) asciilifeform: ffa is possibly one of the few nontrivial proggies where you can actually do this. because there are no data-dependent branches (aside from the 'data' which is the bitness you run under -- this determines the loopness of the loops)
(trilema) asciilifeform: libffa ( the actual arithmetism ) is cumulatively ~1900 loc, (80col!11) inclusive of whitespace , banners, and commentolade ; ffacalc apparatus another ~900, ditto.
(trilema) asciilifeform: we're approx. at level of a ( much cleaner ) circa- june 2017 ffa nao.
(trilema) mircea_popescu: "LetÂ’s verify the RSA seal of ffa_ch6_simplest_rsa.vpatch, the Chapter 6 code itself, using itself". epic.
(trilema) asciilifeform: and now it takes a lifetime to simply juggle the v-mechanics, leaving ~0 time for any of the 'irrelevant' detail like, say, writing ffa.
(trilema) asciilifeform: this is when asciilifeform admits that he has a small demo of this. but is being saved for after ffa, cuz Finishing Things Properly (tm)
(trilema) asciilifeform: if there's anybody else who signed , but not currently visible in http://btcbase.org/patches/ffa_ch5_egypt in appropriate spot -- plox to write in.
(trilema) asciilifeform: point being, if you patch on an existing ffa_calc, it'll have to be reground
(trilema) asciilifeform: it's rather like... ffacalc, lol
(trilema) asciilifeform: in asciilifeform's head 'plain text' means strictly v100, i.e. this convenient (too convenient) item 'the customer Got Accustomed To'(tm)(r) in 1950s and is old, tired, being asked to do all sorts of contradictory things like sane diffability, structure-preserving edits, etc
(trilema) asciilifeform: so far the folx who code on paper, wrote ffa, and the folx who wrote on display -- wrote what.
(trilema) mircea_popescu: this is a sad state of affairs, as it limits v utility drastically ; neverthless -- commentary will be ok, long predated either v or code. code is more fragile.
(trilema) asciilifeform: and yes this is what asciilifeform does when he wakes up : rereads ffa. all of it.
(trilema) asciilifeform: there's a stray MustNotZero(Stack(SP)); in ffa_calc.
(trilema) asciilifeform: that being said, gprbuild ( what ffa uses instead of gnumake ) seems to make very effective use of a kind of interpreted subset of ada
(trilema) asciilifeform: diana_coman: as a side effect, you get an easily formatted code-box for blogging, as in ffa.
(trilema) asciilifeform: ben_vulpes: observe again style in ffa
(trilema) asciilifeform: meanwhile observe asciilifeform's formatting in ffa
(trilema) asciilifeform: and speaking of this, asciilifeform is almost certainly doomed to properly texize ffa in the end. there are so few things more loathesome than reading MECHANICALLY REFLOWED code. whether line flow or page breaks.
(trilema) asciilifeform: ~all ffa ops can be reduced to 'add-with-possible-2scomplement' and 'shift'.
(trilema) BingoBoingo: The "nice" areas now are a daylight only sort of affair. Like the old "sundown towns" but in reverse
(trilema) mircea_popescu: (and it behooves me to point out that the antique arrangement is transparently evident in the domestic affairs of the french, (and slightly, somewhat, the italians) as late as the 60s.)
(trilema) a111: Logged on 2018-01-01 20:07 ben_vulpes: pretty good, listening to raffi, working through ffa_ch4, tidying up some stuff for $work
(trilema) ben_vulpes: pretty good, listening to raffi, working through ffa_ch4, tidying up some stuff for $work
(trilema) zineKing: which crypto do you think will be the defacto, go-to coin for world wide affairs?
(trilema) asciilifeform: fortunately there is nothing nontrivial in ffa.
(trilema) asciilifeform: to round off thread -- asciilifeform very much enjoying rewriting ( and it is , yes , a total rewrite ) ffa
(trilema) asciilifeform: can haz link to ffaseries plox ? ( http://www.loper-os.org/?cat=49 is the metalink )
(trilema) asciilifeform: ( incidentally gprbuild, which is used in ffa, is quite interesting. )
(trilema) asciilifeform: all of them but the FFA_IO items and the hex_digit thing.
(trilema) mircea_popescu: and why the fuck would you maintain it in a place which has no need to maintain it. ffa is free from said flesh.
(trilema) asciilifeform: consider the approach in ffa. only critical bottlenecks, that soak up 90+% of cycles and create an impractically-slow rsa op , get massaged ~to the extent necessary~ , and without compromising type safety
(trilema) asciilifeform: trinque: orig stimulus for ffa was gossipd's rsa-in-realtime req.
(trilema) a111: Logged on 2017-12-29 03:38 asciilifeform: http://www.loper-os.org/pub/ffa/pehbot.jpg << for posterity.
(trilema) mircea_popescu: and is it getting updated in step with the ffa publishings ?
(trilema) asciilifeform: ( ffacalc, in case anyone has illusions , is not p. not yet in ch4 anyway ! )
(trilema) asciilifeform: for that matter, what's ffa, lol
(trilema) mircea_popescu: there's the buffalo item recently in trilema...
(trilema) asciilifeform: as in, ffa-width cpu.
(trilema) asciilifeform: trinque: i actually put a good bit of thought into the vtronic shape of ffa, while rewriting it ( current-day ffa , observe, is a rewrite, largely by hand, of the previous )
(trilema) asciilifeform: ffa is, among other things, an experiment with minimizing theugly.
(trilema) a111: Logged on 2017-12-24 16:46 asciilifeform: !~later tell trinque what do you recommend for a talking-in-chan bot-tron ? i'd like to hook up 'ffacalc'...
(trilema) asciilifeform: !~later tell trinque what do you recommend for a talking-in-chan bot-tron ? i'd like to hook up 'ffacalc'...
(trilema) asciilifeform: ben_vulpes, mod6 , phf , apeloyee, diana_coman , PeterL, all ffaists : ^ ptronic puzzle included! gentlemen, start yer engines...
(trilema) a111: Logged on 2017-12-24 02:42 deedbot: http://www.loper-os.org/?p=2051 << Loper OS - Finite Field Arithmetic. Chapter 4: Interlude: FFACalc.
(trilema) deedbot: http://www.loper-os.org/?p=2051 << Loper OS - Finite Field Arithmetic. Chapter 4: Interlude: FFACalc.
(trilema) a111: Logged on 2017-12-23 03:53 asciilifeform: speaking of http://btcbase.org/log/2017-12-23#1757328 , today's ffa-series item will appear tomorrow, apparently was too big a bite for asciilifeform's mere 1wk
(trilema) asciilifeform: speaking of http://btcbase.org/log/2017-12-23#1757328 , today's ffa-series item will appear tomorrow, apparently was too big a bite for asciilifeform's mere 1wk
(trilema) asciilifeform working on unexpectedly massive ffa-series piece
(trilema) danielpbarron: !!v FEFDFF454ACF461BCDAFFAD5EF64E6E3FF73AA12D485BCCA4406CC8628FD7609
(trilema) Techman: !!v CD6F4FA2F97A2B9D4070FFAD151231E9B4572DC560DE64FF94EB9BC54CD35CCB
(trilema) deedbot: CD6F4FA2F97A2B9D4070FFAD151231E9B4572DC560DE64FF94EB9BC54CD35CCB voiced for 30 minutes.
(trilema) Techman: !!up CD6F4FA2F97A2B9D4070FFAD151231E9B4572DC560DE64FF94EB9BC54CD35CCB
(trilema) asciilifeform: btw, ftr asciilifeform considered f77 as close runner-up for 'in what to write ffa and all from nao on'
(trilema) asciilifeform actually has the db item, based on 'horsecocks' routine posted earlier ; but not ready for primetime and on hold pending ffa/p release
(trilema) asciilifeform: ftr i dun plan to include 'secure memory'ism in ffa.
(trilema) asciilifeform: ( e.g., gprclean actually cleans ffa . )
(trilema) asciilifeform: btw if esthlos ( or anyone else, anywhere ) knows how to aks on 2048b primes in nongeological time, i'll happily port their algo to ffa, even if original is in cobol
(trilema) esthlos: mircea_popescu: alright. I've been thinking of writing a v implementation following http://trilema.com/2016/how-to-participate-in-the-affairs-of-the-most-serene-republic/
(trilema) mircea_popescu: esthlos i'd love for you to be able to jump straight into this ; however there's some groundwork to be laid. look into the V system, because ideally you'd be presenting the finished item as a patch on diana's eucrypt lib. and asciilifeform is working on and publishing a final FFA which is what we intend to use here.
(trilema) mircea_popescu: rather than being all negative!!!, got a review copy of ffa somewhere to pass to esthlos ?
(trilema) mircea_popescu: esthlos look through the various FFA items as pasted by asciilifeform first ; to get an idea what the item is like. so you don't have to wait till he's finished publishing it all
(trilema) mircea_popescu: esthlos ada. see ffa for a basis
(trilema) phf: asciilifeform: http://btcbase.org/patches/ffa_ch3_shifts in press order you can see all the mentioned sigs included
(trilema) asciilifeform: ( ada params are a moar complicated matter than ffa might suggest: when reading heathen proggies you will encounter such things as 'aliased' i.e. pointerola , and related items. )
(trilema) asciilifeform: ben_vulpes: there is no 'constructor' in ffa . and FZ_Clear does exactly as printed on the box
(trilema) asciilifeform: in other noose, congrats to ben_vulpes , http://www.loper-os.org/?p=1913&cpage=1#comment-18420 << 2nd ffa ch1 graduate
(trilema) asciilifeform: so then the obvious answer is from the standard, which proclaims that Restrictions(....) can be made to act per-partition (i.e. on libffa , but not the calling prog)
(trilema) asciilifeform: in other noose, http://www.loper-os.org/?p=1913&cpage=1#comment-18418 << congrats to PeterL, the first (self-proclaimed, but there ain't gonna be any other kind, i dun run a usg-style school, 'diploma' is a matter of yer own conscience) ffa ch1 graduate .
(trilema) PeterL: asciilifeform: I have succesfully built the FFA chapters 1-3 (on this here mac), and they give the expected respones using the included demo.
(trilema) PeterL: I tried to press the ffa with the mod6 v, and I am getting this error: http://p.bvulpes.com/pastes/30JHp/?raw=true
(trilema) PeterL: so I was trying to follow the ffa series, started at loper-os, followed the link to v, ended up at http://therealbitcoin.org/ml/btc-dev/2016-January/000200.html and I am getting <title>404 Not Found</title> when I tried to download the links in 0x02, did I do something wrong or am I not looking at the most up to date v source or what?
(trilema) asciilifeform: !~later tell phf plox to update ffa in /patches , ty
(trilema) asciilifeform: observe that in e.g. ffa , used nonempty placeholders.
(trilema) asciilifeform: mircea_popescu: it's a cmachineism -- 'hey this register CAN haz a 0 in it, ergo lengths of 0 are permissible'. observe that i banished this idiocy from ffa planet
(trilema) a111: Logged on 2017-12-10 21:23 nocko: I was linked to FFA guide, started looking around and am now here. I cannot say that I yet have half an idea what's going on... but hello.
(trilema) asciilifeform: common root lets you vdiffate whatever change you made to anything, even if it takes in > 1 subsystem.
(trilema) a111: Logged on 2017-12-11 19:56 asciilifeform: incidentally folx: each of you who considers himself 'graduate' of an ffa chapter, consider signing
(trilema) asciilifeform: http://btcbase.org/log/2017-12-14#1751375 << i'ma proclaim : will host all sigs for 'ffa graduates' ( http://btcbase.org/log/2017-12-11#1749492 ) in my l1+2 . 'hall of fame'!11
(trilema) a111: Logged on 2017-12-13 22:00 diana_coman: mod6, more FFA tests sounds good to me; slightly related: is there any protocol/preferred approach for publishing signatures to someone else's patches?
(trilema) a111: Logged on 2017-12-13 22:00 diana_coman: mod6, more FFA tests sounds good to me; slightly related: is there any protocol/preferred approach for publishing signatures to someone else's patches?
(trilema) a111: Logged on 2017-12-13 21:54 mod6: (I've been working off an FFA that's like... at least 3-4 months old.)
(trilema) a111: Logged on 2017-12-13 22:22 mod6: diana_coman: there is a 'mirror' feature in my V. But there is a limitation, it has a URL to the root mirror baked in. Perhaps next release this will be fixed and can take a root mirror as a parameter. This way, you could set up your own root mirror/mirrors for eucrypt or for stan's ffa.
(trilema) mod6: diana_coman: there is a 'mirror' feature in my V. But there is a limitation, it has a URL to the root mirror baked in. Perhaps next release this will be fixed and can take a root mirror as a parameter. This way, you could set up your own root mirror/mirrors for eucrypt or for stan's ffa.
(trilema) diana_coman: mod6, more FFA tests sounds good to me; slightly related: is there any protocol/preferred approach for publishing signatures to someone else's patches?
(trilema) mod6: (I've been working off an FFA that's like... at least 3-4 months old.)
(trilema) mod6: I also want to spend a few minutes here soon and adapt my FFA unit tests to the vpatches that stan has released thus far.
(trilema) BingoBoingo: La Tienda Inglesia, wonderful source of food. Local fereterias... dismal affairs.
(trilema) a111: Logged on 2017-12-11 21:56 mod6: <+asciilifeform> incidentally folx: each of you who considers himself 'graduate' of an ffa chapter, consider signing << fwiw, I have held back signing on ch1 since I can not still build it out of the box, successfully.
(trilema) mod6: <+asciilifeform> incidentally folx: each of you who considers himself 'graduate' of an ffa chapter, consider signing << fwiw, I have held back signing on ch1 since I can not still build it out of the box, successfully.
(trilema) asciilifeform: mircea_popescu: was it one of those affairs where the windmills swivel ?
(trilema) asciilifeform: ffa series is as much a course in vtronics, as in arithmetics.
(trilema) asciilifeform: incidentally folx: each of you who considers himself 'graduate' of an ffa chapter, consider signing
(trilema) asciilifeform: in other lulz, ffa series has been very, very, well... loaded? ( 'read' is not the word, i have nfi if anybody other than apeloyee read it )
(trilema) nocko: I was linked to FFA guide, started looking around and am now here. I cannot say that I yet have half an idea what's going on... but hello.
(trilema) asciilifeform: http://btcbase.org/log/2017-12-10#1749249 << 0 paramecium dropping in the ffaseries comments thus far
(trilema) a111: Logged on 2017-12-09 20:12 TomServo: heh FFA Chapter 2 is #1 on hacker news at the moment
(trilema) a111: Logged on 2017-12-09 20:12 TomServo: heh FFA Chapter 2 is #1 on hacker news at the moment
(trilema) TomServo: heh FFA Chapter 2 is #1 on hacker news at the moment
(trilema) asciilifeform: btw here's a phunphakt for ben_vulpes : ffa cannot be used as-is on ppc. ibm in infinite whizzdom made their mul instruction nonconstanttime.
(trilema) asciilifeform: and per the comments in ffa ch1, 2017 actually fixed inlining
(trilema) asciilifeform: ( what was asciilifeform going to do with mpi ? there was plan, for 1 further cut, of the logger and the allocator. but i put it in cold storage when began work on ffa . )
(trilema) asciilifeform: you are using gcc for a linker, neh. it takes arbitrary paths ( observe how i did it in ffa ch.1, it was deliberately illustrative )
(trilema) asciilifeform: http://btcbase.org/log/2017-12-07#1747976 << interestingly gprclean ( part of gprbuild system , illustrated in ffa ch1 ) actually-worx (unlike, pointedly, gnumake's)
(trilema) asciilifeform: same goes for ch1 of ffa, incidentally.
(trilema) mircea_popescu: inb4 ffa.diff reimpl
(trilema) mircea_popescu: atm there's bot, lam-par (terrible name), fg, mpi and ffa.
(trilema) diana_coman: ftr I used mod6's vtron on ch1 of ffa and it worked perfectly fine
(trilema) a111: Logged on 2017-12-05 23:44 asciilifeform: 'p' stack machine ( to be featured in last episode of ffa series ) is a demo of sane ( e.g. demonstrably-correct and bounded , yet usefully complete operator set ) code execution.
(trilema) asciilifeform: the thing ffa enables, is to make the 'this-here program takes known number of cycles, and known total bitness of memory' guarantee into an actually feasible thing.
(trilema) asciilifeform: http://btcbase.org/log/2015-10-14#1298929 << first, afaik, public mention. pre-dates ffa.
(trilema) asciilifeform: 'p' stack machine ( to be featured in last episode of ffa series ) is a demo of sane ( e.g. demonstrably-correct and bounded , yet usefully complete operator set ) code execution.
(trilema) asciilifeform: whole of ffa, in fact,
(trilema) a111: Logged on 2017-12-02 18:08 asciilifeform: diana_coman: you do have a point , though, an ffa that is an ideal mathematical description of every relevant bound, would look slightly different from the ffa i actually have, that has to actually run on idjit cmachine iron in something like real time.
(trilema) asciilifeform: i've been thinking about abolishing function overloading in ffa. ( there is apparently even a pragma for cementing it )
(trilema) a111: Logged on 2017-12-05 21:18 apeloyee: I'd like to ask asciilifeform to document the parameter ordering convention in ffa. chapter 1 is straightforward, but the various shifts posted earlier seemed to have their parameters in order which I don't understand.
(trilema) apeloyee: but ffa itself, from what I've seen, does not do that.
(trilema) apeloyee: I'd like to ask asciilifeform to document the parameter ordering convention in ffa. chapter 1 is straightforward, but the various shifts posted earlier seemed to have their parameters in order which I don't understand.
(trilema) asciilifeform: now that i think about it, if i were mircea_popescu , ffa would have gone more than simply twice as fast, it takes considerable time to reload the problem into head , after a long dive into the saecular sewers
(trilema) asciilifeform: ftr i spent more time, hour for hour, on ffa in past yr than among the heathens.
(trilema) asciilifeform: or for that matter http://btcbase.org/log/2017-12-05#1746561 aka 'why do you not only take year+ to ffa but why not also do it while living in a tent under a bridge'
(trilema) mircea_popescu: asciilifeform it's not very clear to me how your x=y things work, BUT, if you had told me in 2016 that you intend to delay c-s ada impl by 1-2-n years to wait for ffa i'd have told you symmetric cipher really dun need ffa for any reason and eulora won't wait into 2018 for it etc.
(trilema) mircea_popescu: yes ; but can you appreciate how ffa is a lot more apt for tmsr-rsa than for a simm cipher ?
(trilema) mircea_popescu: when you think "hey, ima do the right thing, spend two years making ffa" you make some decisions. they're fine and good, inasmuch as they're yours. but to be decisions, they're the choice of something over something else.
(trilema) mircea_popescu: but that discussion was re absent submission to cipher contest ; not re your work making the ffa item you came to the conclusion is generally necessary.
(trilema) asciilifeform: for what did mircea_popescu think ffa is made ?
(trilema) asciilifeform: in the process of writing one on top of my mpi, i realized that the approach is unsound, and will eventually get people killed. so went straight to what became ffa.
(trilema) mircea_popescu: what happened to "god damned it, i can't do this c-s i was going to do for the cipher comp because no ffa" ?
(trilema) asciilifeform: no cs worth considering without sane ffa.
(trilema) asciilifeform: i will stand and say, asciilifeform did exactly the Right Thing, prepared , with proper care wartime ersatz ( mpi ) for if ( as turned out to be the case ) proper item ( ffa ) takes years.
(trilema) a111: Logged on 2017-12-02 22:30 asciilifeform: fwiw asciilifeform will submit ffa.rsa to be judged in mircea_popescu's symm cipher contest, supposing the latter is still running
(trilema) asciilifeform: the original logic is that i want it to appear on every page of http://btcbase.org/patches/ffa_ch1_genesis/tree/ .
(trilema) mircea_popescu: let me take this opportunity to point out to asciilifeform that his first item in the epic ffa write-up was dec 1st. this is dec 4th. wasn't it supposed to be a 1 hour apart publishing or what's going on there ?
(trilema) asciilifeform: fwiw asciilifeform will submit ffa.rsa to be judged in mircea_popescu's symm cipher contest, supposing the latter is still running
(trilema) asciilifeform finally did dig up the first mention of proto-ffa in l0gz : http://btcbase.org/log/2016-06-09#1479552
(trilema) a111: Logged on 2017-12-02 18:08 asciilifeform: diana_coman: you do have a point , though, an ffa that is an ideal mathematical description of every relevant bound, would look slightly different from the ffa i actually have, that has to actually run on idjit cmachine iron in something like real time.
(trilema) asciilifeform: ( btw nobody yet asked why ffa is now a standalone-built static lib, rather than as before , a set of sources to be simply dropped into other projects. answer is -- binary audit )
(trilema) asciilifeform: ( 'ideal mathematically-sufficient' ffa would probably include solely egyptian multiplier, for example. )
(trilema) asciilifeform: diana_coman: you do have a point , though, an ffa that is an ideal mathematical description of every relevant bound, would look slightly different from the ffa i actually have, that has to actually run on idjit cmachine iron in something like real time.
(trilema) asciilifeform: the genericunit allowed a given running instance of ffa to know the actual ffawidth desired; and to have stricter checks on arguments
(trilema) asciilifeform: readers may recall that originally ffa was a 'generic unit'
(trilema) asciilifeform: TomServo: tried ffa ch1 tutorial yet ?
(trilema) asciilifeform: diana_coman: fortunately ffa is an arithmetron not an academitard-designed hashtron, and doesn't ever need to care about bytes, worx in units of machineword.
(trilema) diana_coman: "Note that endianness is irrelevant, here and elsewhere in FFA" <- FINALLY! esp given my recent keccak-induced headaches on the topic, I am delighted to read this; will dig deeper into ffa ch1 over the weekend
(trilema) trinque: mega congrats to asciilifeform on his first ffa post, will read soon.
(trilema) phf: slightly better rendering (will work on padding widths sometime later) http://btcbase.org/patches/ffa_ch1_genesis/tree/ffa/ffademo/ffa_io.adb
(trilema) mircea_popescu: asciilifeform reading this backbreaker of an article i must say i r impresst. exactly what ffa needed, too.
(trilema) phf: colorizer is missing ada support, so i'm slowly hacking in the highlighter http://btcbase.org/patches/ffa_ch1_genesis/tree/ffa/ffademo/ffa_io.adb comments and strings so far. i'm going to add keywords now and then leave it be
(trilema) phf: asciilifeform: i added your ffa, http://btcbase.org/patches?patchset=ffa
(trilema) asciilifeform: !~later tell phf can haz ffa-genesis and subsequent patches inserted into your spiffy patch viewer btcbase.org/patches ??
(trilema) mod6: <+asciilifeform> mod6, diana_coman , trinque , ben_vulpes , et al : lemme know if you were able to follow the ffa tutorial ch1. <+asciilifeform> and got the expected result. << will take a look for sure.
(trilema) asciilifeform: mod6, diana_coman , trinque , ben_vulpes , et al : lemme know if you were able to follow the ffa tutorial ch1.
(trilema) asciilifeform: in other lulz, ch.1 of ffa article series just about done.
(trilema) a111: Logged on 2017-09-14 17:24 asciilifeform: ^ which does mean that i'ma have to a) audit the binary when ffa built for use in the field b) patch gcc/gnat not to emit DIV
(trilema) asciilifeform: ffa.a stripped is 50kB; 'hello world' without anything whatsoever, null procedure, is 3.5MB
(trilema) asciilifeform: i'ma have to do it after ffa/p tho. but really this is ridiculous, the built binaries are not auditable until we extirpate the ball of nonsense.
(trilema) asciilifeform: the approach to making a rts ( gnatruntime ) from 0, depicted in e.g. https://github.com/alkhimey/Ada_Kernel_Module_Toolkit works -- but does not result in a ffa-usable rts , because the boundschecking exceptionhandlers are not present.
(trilema) a111: Logged on 2017-11-21 18:36 asciilifeform: in other noose, ffa elf on x86-64 with no inlinings and stripped .a , is ~50kB
(trilema) a111: Logged on 2017-11-27 20:35 asciilifeform: mircea_popescu: i've cut ffa into 30 pieces, each ~1 pg; -> bl0g article.
(trilema) a111: Logged on 2017-11-27 20:35 asciilifeform: mircea_popescu: i've cut ffa into 30 pieces, each ~1 pg; -> bl0g article.
(trilema) a111: Logged on 2017-11-27 20:35 asciilifeform: mircea_popescu: i've cut ffa into 30 pieces, each ~1 pg; -> bl0g article.
(trilema) asciilifeform: mircea_popescu: i've cut ffa into 30 pieces, each ~1 pg; -> bl0g article.
(trilema) a111: Logged on 2017-11-24 14:14 mircea_popescu: and speaking of ^, does http://trilema.com/2016/how-to-participate-in-the-affairs-of-the-most-serene-republic/ need revising ?
(trilema) phf: asciilifeform: https://duckduckgo.com/?q=jennifer+aniston&t=ffab&iar=images&iax=images&ia=images i wonder if mp used that trop before, or it comes from tlp (i'm rereading tlp again)
(trilema) asciilifeform: relatedly, asciilifeform sawed ffa into independent subunits ( e.g. mults, bitops, divides, etc. ) for smooth compilation, reading, and blogomatics.
(trilema) a111: Logged on 2017-11-21 18:36 asciilifeform: in other noose, ffa elf on x86-64 with no inlinings and stripped .a , is ~50kB
(trilema) asciilifeform: in other noose, ffa elf on x86-64 with no inlinings and stripped .a , is ~50kB
(trilema) ben_vulpes: why is this so surprising? he hasn't been involved in republican affairs since some time after wol wound down
(trilema) BingoBoingo: The affair will be blogged.
(trilema) asciilifeform: ... pretty depressing, and just about obscene, you could just about fit msdos mega-game DIGGER.COM in the space taken by gcc's notion of ffa_mul_comba !
(trilema) Ingolfr_Arnarson: I was trying to find information on gossipd, followed the 'how to participate in the affairst of the republic' link on the channel automatic text you get when you enter and reached the gossipd design document.
(trilema) asciilifeform: http://btcbase.org/log/2017-11-16#1739930 << this was probably the most frequent logical mistake asciilifeform made when writing first draft of ffa ( in particular, the shifts )
(trilema) asciilifeform: if you remove the div0 trap from ffa, you end up likewise with a reg full of 1s. it's what knuth division produces when given a 0 divisor.
(trilema) asciilifeform: the only way to detect overflow on risc-v is the algo i used in ffa.
(trilema) asciilifeform: http://btcbase.org/log/2017-11-16#1739561 << possibly i mentioned this, i am making an asm ffa in parallel with the ada item
(trilema) asciilifeform: returning to http://btcbase.org/log/2017-11-16#1739533 , i will point out that inline asm is ~likewise~ a gcc-specific syntax. so if you're marrying gcc you may as well use the existing ( as seen in ffa ) rotate intrinsic.
(trilema) asciilifeform: result is a 4x slower ffa.
(trilema) asciilifeform: not to mention that 2^4097 cannot be represented AT ALL in a 4096bit ffa
(trilema) mircea_popescu: but yes, the alternative is to genesis it and then link downstream from ffa.
(trilema) asciilifeform: prior to realizing that ffa is the troo path, asciilifeform actually planned to entirely re-do the mpi item
(trilema) mircea_popescu: And in this here FFa post we will be taking Comba Mult version x from y date and together with last week's X, Y and Z, and make this pile
(trilema) asciilifeform: i was just thinking about this, this morning, during the 'declare' thread -- wanted to link to a particular item in ffa, and realized that i couldn't
(trilema) asciilifeform: neither did modular types of arbitrary bitness, and several other minor nuts and bolts of ffa, that i cannot immediately recall.
(trilema) asciilifeform: ada ( even asciilifeform's 'fascist' ada subset ) is not exactly pascal. imho the most notable departure is the array slice abstraction, which makes for a 90% moar compact ffa ( and applies to almost anything else dealing in bitstrings, for that matter )
(trilema) mircea_popescu: but anyway, in spite of an inability to speak in public, or to make sense, extemporaneously or not, ceausescu was a major player in the status quo of 70s and 80s. that whole "don't mix into the affairs of others", very strong nationalism, managed to paralyze the us-owned and hosted un for two decafdes.
(trilema) asciilifeform: ( and definitely not ffatronic )
(trilema) asciilifeform: in n-bit ffa arithm.
(trilema) a111: Logged on 2017-11-14 11:46 diana_coman: that being said, I can't quite see it being any *worse* than this affair with fixed size AND fixed top bits
(trilema) asciilifeform: http://btcbase.org/log/2017-11-14#1737525 << this is therightthing. but note that not only is http://btcbase.org/log/2017-11-14#1737533 not a problem, but the behaviour is fundamental to ffa. in ada a structure is considered nondynamic if its size doesn't change at run time. not if 'magic number' size, like in overflowlang.
(trilema) a111: Logged on 2017-11-14 11:29 spyked: http://btcbase.org/log/2017-11-13#1737294 <-- not sure if possible with ffatronic ada subset, though, because of "no dynamic objects" restriction. in my (yet-unpublished) prototype, lisp memory size is a static knob.
(trilema) diana_coman: that being said, I can't quite see it being any *worse* than this affair with fixed size AND fixed top bits
(trilema) spyked: http://btcbase.org/log/2017-11-13#1737294 <-- not sure if possible with ffatronic ada subset, though, because of "no dynamic objects" restriction. in my (yet-unpublished) prototype, lisp memory size is a static knob.
(trilema) phf: well, i'm thinking in terms of a TMSR MACHINE. scheme.adb linked against ffa linked against that com1 hack you posted some time ago :p
(trilema) asciilifeform: indices. as seen in ffa.
(trilema) jhvh1: 12. Having had a spiritual awakening as the result of these steps, we tried to carry this message to alcoholics, and to practice these principles in all our affairs.
(trilema) asciilifeform: and for that matter of the ada std lib - using part ( once the debuggery put_line's in ffa are done away with )
(trilema) asciilifeform: spyked: it's ok to post it 1 routine at a time ( as i do with ffa )
(trilema) spyked: I'm also keeping the idea of potentially embedding in other ada projects (e.g. adacoin?) in mind. but so far wrestling the ffa aspects were enough of a challenge. oh, and there's no gc yet, the thing leaks memory like hell. but that's not its biggest problem.
← | →
Download hourly DB snapshot | Get Source Code