500+ entries in 0.06s
: 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? ☟
: ( i had'em in the 1st drafts of ffa
, then abolished , they interfere with proper compartmentalization )
: diana_coman: currently i am lacking a bigendian iron (or a gnat for such) so never got a chance to truly and properly test endianism conversion (as for ffa
, it is endian-insensitive, but this is simple where there is no networking)
: ( and i didn't get a chance to finish the whole thing, was right when i picked up ffa
: BingoBoingo: i'm willing to talk to 'hey i read ffa
and in ch4 you missed this-here obvious optimization, here's proof'. but 'hi i am reddit, hear me roar' can go the fuck perma-away.
: depending on how that goes, i'll explore different power plants, and if THAT goes well, there's a gnat port to build future ffa
: ( ffa
in particular , only needs a stack, and 2 uarts, 1 for commands, 1 for FUCKGOATS ... )
: Logged on 2018-08-04 22:05 asciilifeform: ben_vulpes: iirc i proposed at one time an intermediate item on the way to proper gossipd ( 'serpent'-ciphered tunneler to connect coupla ircd instances to each other, and ditto for users ( get otp cookie a la deedbot, get a key that's good for 1 tcp connect ) but so far instead followed mircea_popescu's advice re not wasting sweat on such a thing, but pushing with ffa
so as to get with what to gossipd.
: ben_vulpes: iirc i proposed at one time an intermediate item on the way to proper gossipd ( 'serpent'-ciphered tunneler to connect coupla ircd instances to each other, and ditto for users ( get otp cookie a la deedbot, get a key that's good for 1 tcp connect ) but so far instead followed mircea_popescu's advice re not wasting sweat on such a thing, but pushing with ffa
so as to get with what to gossipd. ☟
finally got inlining to work properly in ffa
, ave-style . nao, the article!
: asciilifeform: while you're at it, ffa_ch4_ffacalc is also binary
: i'll note that everthying the republicans deliver builds like a fucking charm, be it ffa
, avetronics or what have you. i've never had a problem of this sort inside the walls.
: Logged on 2018-07-18 13:42 asciilifeform: phf: say what you will re ada standard, but e.g. ffa
is ( afaik! ) a nontrivial and at same time ada2012-compliant proggy.
: mircea_popescu: conceivably not all works call for the ffa
degree of fascism, where asciilifeform insists on being able to say exactly how many bytes are required after a O(1) look at the inputs, and to say exactly in what order they will be accessed etc
: for thread completeness i must add that there are items in the standard (i.e. 'tasks') that i do not use in ffa
, but intend to make use of in future ( i.e. trbi ) , and may be let live.
: Logged on 2018-07-18 13:45 phf: as far as ada is concerned, the tmsr ada is a subset of standard, that only exists in your head, and can be somewhat inferred from ffa
. that's no standard
: ( hence why the logic is brought out to ffa_calc, rather than part of the lib proper -- to emphasize this )
: i'm starting to think that maybe it doesn't (my memory of logs are hazy on that point, perhaps ave1 mentioned that he's working on getting ffa_calc working), because i believe you're also using interfaces.c at least to declare the types that you get in/out of c system calls
: phf: my specific motivation in asking ave1 for this, was to enable building e.g. ffa
where binary is small enuff to manually disasm and audit.
: asciilifeform: i thought that you were arguing that the subset of ada runtime that's included in zfp "ought to be enough for everyone", since at the moment i believe it compiles ffa
, my apologies.
: as far as ada is concerned, the tmsr ada is a subset of standard, that only exists in your head, and can be somewhat inferred from ffa
. that's no standard ☟
: ( ~ffa_calc~ is not, as it uses a gnatism to grab the commandline args. )
: phf: say what you will re ada standard, but e.g. ffa
is ( afaik! ) a nontrivial and at same time ada2012-compliant proggy. ☟
: shinohai: otherwise pretty busy, currently with ffa
: trinque: currently massaging ch11 of ffa
series, right after this will test-fire your opus
: thx diana_coman, It's now very minimal, mostly so that it can be understood as is. I'm working on adding all the code in so that at least ffa
: Logged on 2018-07-05 05:17 mircea_popescu: asciilifeform when's the ffa
restart btw ?
wrapping up a very gnarly ffa
surgery, >2x speed boost. thx to ave1 for the gnat clues.
: observe that ffa
runs , per PeterL, on winblowz, despite asciilifeform having made 0 effort in this direction