900+ entries in 0.086s
: ( e.g. in above example -- FFA_FZ_Get_Head is not linkable, and several hrs of dig failed to tell me why )
: i'm sure if someone defaces ffa
series to talk about what-ustards-understood-of-foucaults-sexnonsense-half-century-later someone'll notify you.
: pehbot is simply a wrapper around compiled ffa_calc , currently it gives closest possible picture to what you get if you ran the proggy itself locally.
: mircea_popescu: now you know what half of ffa
illustration sweat loox like !
: i've added all kindsa 'new api' in ffa
, but the only regrind was when we took up new hash type for vtrons
: ( e.g. ffa
genesis, is very small, but contained all of the basic fundamental moving parts for simple arithm )
: Logged on 2018-06-25 16:40 mircea_popescu: spyked> I think there's great benefit in the ffa
chapter-based approach << that ~started with a genesis~.
: Logged on 2018-11-18 16:57 asciilifeform: unrelatedly, ave1 , diana_coman , mircea_popescu , phf , other folx with a gnat and 10min of free time -- asciilifeform would like to see outputs of http://www.loper-os.org/pub/ffa/thousand_muls.txt
( ch12 benchmark ) on various irons
presently massaging ffa
ch12, expects to take most of today
: ( i deliberately wrote ffa
in such a way that it oughta work on under 32bit or even plain 16, supposing somehow enuff ram )
: btw i was going through my ffa
notebooks and found a margin note that was actually about this, that prolly oughta go in the l0gz : if yer 'pow' is a walk-through-storage, 1 problem is that initial state of the system gives too little material to walk. so 1 interesting answer might be to include a 'ballast', consisting of, say, the first 9 yrs of classical btc blox, 1...N, that is part of the luby'd set (as raw bytes, rather than as m
actually ran 2 printers into the ground since started ffa
: i wish i could concur, but while baking ffa
i had to eat a good 100GB of pdf.
: mod6: have you considered to get a diff heathen gig ? the kind where you dun have to go anywhere ? in '16 asciilifeform pulled this off, yes it took having to run on batteries for a spell, but was 100% worth it, it's the only reason i had strength to actually do FG, ffa
: i was hoping to avoid baking hashing into ffa
/p , but loox like it isn't escapable if we're doing oaep
: the table with FFA
patches looks great; I'll look into carving again some space to re-start on it
: i think just his bigendian vs littlendian speshulcases (why he has any?! ffa
doesn't..! ) weigh moar than all of ffa
: i'd like to be able to put a link in the 'ffa
regrind' article, 'and you can press it with ~this~'
: Logged on 2018-11-13 14:21 asciilifeform: when i started ffa
, i did not plan to bake any asm speedups at all. but there's 2 reasons to do it, eventually : one is that on e.g. x86/x64, getting the upper half of a word-sized multiplication, without asm, takes ~four~ MULs plus a buncha additions : http://www.loper-os.org/pub/ffa/hypertext/ch11/w_mul__adb.htm#95_14
: nao, this being said, my objective is still to give acceptably-performing, re erryday ops, ffa
~without asm~. but asmism will make a serious diff re e.g. key generation, make minutes instead of day+.
: ( but eventually i do want to write e.g., asmtronic MUL, for arm64 ffa
: i was able to regrind ffa
today, using phf's vdiff, but atm cannot yet press and confirm that it actually presses to same thing as the classical
: though i have nothing against work on bignum multiplication and modexp -- but as i see it, it could be a side branch of ffa
already provides a solid foundation for such algorithm exploration.
in the process of keccakizing ffa
, hence practical q
: when i have the choice, i'd rather write proggy to need no such cassettes ( observe, streams are not used in ffa
: So usually that leaves 30min-1hour per night, sometimes more depending on the size. Sometimes I fall down a well in the logs if i'm looking for something specific related to any number of things: pizarro, foundation, ada, ffa
, who knows.
: mircea_popescu: after ffa
/p beta rollout, i'ma be at yer service for the next thing ( fg2? tmsr.mips ? radio ? or other, take yer pick )
: ( i got one coming in a week or so, tho, for ffa
exhaustive tests )
: ^ mircea_popescu , diana_coman , other potential ffa
finally finished rereading ffa
, nao preparing ch12 + estimate of just-how-long-to-battlefield promised earlier
: phf: i prolly won't get a chance to actually put it to use in near term, hands pretty full with ffa
; but would like to have it. if it's there to be had.
: phf: it's definitely not perfect, e.g. why the FUCK is FFA_FZ_ZeroP not clickable ?
: 3) -l1 turns on line numbering; -I adds paths to the libraryisms ; -p takes a file containing src_dir=. gpr_file=ffa_calc.gpr .
: 2) cd ffa
/ffacalc ; gnathtml.pl -l1 -f -D -I obj -I ../libffa -I ../libffa/obj -p ffa_calc.adp ffa_calc.adb
: fwiw i've massaged ffa
to the point where it's fully static and the problem dun affect it any. but some of my other stuff (mmap) is hobbled by it.
: ( it's not a wholly useless thing, i dun have it in current ffa
but my 1st draft used it to wipe all data on the stack erry time it goes out of scope )
: myeah, i solved it by maximally recreating the ffa
project structure, so can't say i did anything informed by the 'first principles' there.
: otoh, when i added a single line 'package SIO is new Ada.Sequential_IO(Positive);' to ffa_calc.adb, it errored out during the compilation in the same way
: just tested ffa
-8 where rng was introduced -- it works fine. would be trying to understand what is wrong with my code, then
: hm, weird; now I'm really curious if you get the same complaint with asciilifeform's ffa
(or my smg comms for that matter)
: i used gnat 2017. will test ffa
rng code and see if it works out.
: hence the whole effort in ffa
, which is nothing else and nothing besides a switching harness for 64 bit cpu so it doesn't leak data while switching it for a 8192 native byte.
: Logged on 2018-11-01 21:02 asciilifeform re-rotates desk to ffa
: Logged on 2018-10-31 17:54 asciilifeform: implicit conditionals aint evil per se , tho ; i banned them in ffa
specifically as they get in the way of constanttimeism, is all
: there is no particular reason why ~erry~ proggy has to have the same pragma fascism as ffa
( and in fact i've written several that cannot function under that set of constraints, e.g. the mmap thing requires System.Address )
: implicit conditionals aint evil per se , tho ; i banned them in ffa
specifically as they get in the way of constanttimeism, is all ☟︎
: diana_coman: out of curiosity -- given what mircea_popescu said the other day re necessary speed of rsa ops, could potentially use the current (11) ffa
: bvt: i have a variant of this in ffa
, and yet another subset in mmap
: ftr I quite like the neat way in which asciilifeform defined those basic types in FFA
; however, he went for the classical types so byte, nibble ; and I find octet SO much easier than I'm reluctant to give it up in my code (though all it takes is anyway a "subtype Octet is Byte" at top if Byte definition is to be adopted)
: hm interesting. I too have hands tied up but have been meaning to get a few chapters of ffa
under my belt. I'll jot this idea down for far off in the conveyor if someone else doesn't get to it first (and by all means, Someone: feel free to beat me to this punch)
: i have 1 presently ( switched off, will move it to pizarro in near fyootoor ) , talks to ffa
: asciilifeform, I was looking for mux just now in ffa
just now and I came by the add_gated which uses a different method,.
: ave1: you dun need ffa
for this, yer dividing single words by single word
: the div variant could be made to be constant time using the ffa
primitives but currently is not.
: we ~needed~ a republican crc32 anyway, it's useful and important, chapter head exactly like "we need a hash" or "we need a ffa
", and i was aware extant code is not fit for pitching.
: Logged on 2018-10-01 15:59 mod6: And before the republic, I was very much a one-thing-at-a-time type of engineer. Seems like over the last year or maybe 18 months, I feel like I'm context switching so much, that I find it hard to get deep into the thinking that I need to. For instance, it bothers me that I still haven't found time to work through FFA
: Not only FFA
, but other parts of TRB that I'd love to educate myself upon. I think you take my meaning.
: And before the republic, I was very much a one-thing-at-a-time type of engineer. Seems like over the last year or maybe 18 months, I feel like I'm context switching so much, that I find it hard to get deep into the thinking that I need to. For instance, it bothers me that I still haven't found time to work through FFA
: Logged on 2018-09-28 16:15 Mocky: asciilifeform, O(1) crapolade packet rejection is already available in software with your FFA
lib, if RSA over non-frag UDP was built on top, no?
: asciilifeform, O(1) crapolade packet rejection is already available in software with your FFA
lib, if RSA over non-frag UDP was built on top, no? ☟︎