log
900+ entries in 0.088s
mircea_popescu: but yes, "ffa mostly exists to show you that no, you actually DO NOT have a leg there".
asciilifeform: ( again in re individual built item, e.g. ffa, rather than whole gnat )
asciilifeform: ftr potentially interesting, to n00bz, ffa thread, in http://logs.bvulpes.com/trilema-mod6?d=2018-1-22#289427 today.
asciilifeform: mircea_popescu: loox like he appeared today, introduced as ffa reader.
caaddr: and my vpatch was trivial work, I just wanted to report it here to avoid other ffa pioneers having to duplicate trivialities
mircea_popescu: http://btcbase.org/log/2018-01-22#1773933 << you know alf, it occurs to me ffa actually attracted a lot more intelligent commentary than phuctor's results. fucking_unexpected.gif. ☝︎
asciilifeform: prolly right after ffa series is done.
ave1: Yes on restrict.adc plus it's the inline pragma that did not work for earlier FFA (adacore 2014).
a111: Logged on 2018-01-22 16:04 ave1: re: http://btcbase.org/log/2018-01-22#1773970, it seems that gcc simply lags behind and a releases version will never be updated / fixed to newer adacore releases. AdaCore 2014 also cannot build FFA from the box
deedbot: asciilifeform rated diana_coman 3 << industrial FG user; adatronicist; ffa reader
asciilifeform: !!rate diana_coman 3 industrial FG user; adatronicist; ffa reader
a111: Logged on 2018-01-22 14:18 deedbot: diana_coman rated caaddr 1 << ffa reader
ave1: re: http://btcbase.org/log/2018-01-22#1773970, it seems that gcc simply lags behind and a releases version will never be updated / fixed to newer adacore releases. AdaCore 2014 also cannot build FFA from the box ☝︎
asciilifeform: ffa should not even be necessary, on sane iron
deedbot: diana_coman rated caaddr 1 << ffa reader
diana_coman: !!rate caaddr 1 ffa reader
diana_coman: upload the patches there + discussion as to why and what; link to asciilifeform's ch1 ffa and you're done
diana_coman: I suppose asciilifeform will want to have a look at them perhaps ; I'm not sure though I see a point in changing ffa to fit whatever gnat4 wants though
diana_coman: wait, you created a vpatch for ..ffa?
deedbot: http://thetarpit.org/posts/y04/06a-ffa-ch4-puzzle.html << The Tar Pit - A solution to the largest-of-seven FFACalc puzzle
mod6 is having some fun stepping through some ffa procedures
phf: i don't grok the first homework: do you mean produce random computations, and programmatically verify ffa against them?
asciilifeform: i.e. Product is only written to as result of the FZ_Mod call , http://btcbase.org/patches/ffa_ch7_turbo_egyptians#L148 , which in turn , inside FZ_Mod, is a clean 1-shot, http://btcbase.org/patches/ffa_ch7_turbo_egyptians#L102 . QED.
a111: Logged on 2018-01-20 11:37 spyked: ftr, asciilifeform's ch4 seal (grabbed from http://www.loper-os.org/pub/ffa/ffa_ch4_ffacalc.vpatch.asciilifeform.sig ) also seems to be binary (found it while double-checking my copies)
spyked: ftr, asciilifeform's ch4 seal (grabbed from http://www.loper-os.org/pub/ffa/ffa_ch4_ffacalc.vpatch.asciilifeform.sig ) also seems to be binary (found it while double-checking my copies)
spyked: http://btcbase.org/log/2018-01-19#1773176 <-- yikes! sorry phf, I fixed it (and double-checked, as I should have in the first place) --> http://lucian.mogosanu.ro/v/seals/ffa_ch4_ffacalc.vpatch.spyked.sig ☝︎
a111: Logged on 2018-01-19 17:56 mircea_popescu: !~later tell spyked "Note that this article is not meant to replace the actual thing. If you want to understand FFA properly, go read FFA. And just so that we understand each other, that DeGrasse Tyson guy is an imbecile" << no links ? what did links ever do to you!
phf: http://btcbase.org/patches/ffa_ch4_ffacalc/seal/spyked
mircea_popescu: !~later tell spyked "Note that this article is not meant to replace the actual thing. If you want to understand FFA properly, go read FFA. And just so that we understand each other, that DeGrasse Tyson guy is an imbecile" << no links ? what did links ever do to you!
asciilifeform: he's been following ffa, doing the homeworkz
asciilifeform: in other noose, http://www.loper-os.org/?p=2051&cpage=1#comment-18804 << >> http://thetarpit.org/posts/y04/06a-ffa-ch4-puzzle.html
asciilifeform: consider a translation of ffa to c
mircea_popescu: say it in the fucking comments of ffa, not here, at that.
asciilifeform: and i will say, ftr, that invocation of ANY ffa components on ANY overlapping segments, is an abuse. and there is not in fact any way to guarantee correctness , if such a thing is permissible.
asciilifeform: nuffin in ffa is an import, in classical v, or in asciilifeform's ideal v
mircea_popescu: note how ffa ends up satisfying the greenspun rule, through the predictable entry point.
asciilifeform: it's next on asciilifeform's conveyor after ffa. ( this should not discourage anybody else from writing adatronic lisps of whatever type, however )
asciilifeform: currently ffa has 0 pointerism.
asciilifeform: i have a similar item , http://btcbase.org/log/2017-05-16#1657241 , it proved to be of very, very limited help for ffa , the constraint of the pc arch limits the use of fancy adders etc ☝︎
a111: 0 results for "from:fromloper ffa", http://btcbase.org/log-search?q=from%3Afromloper%20ffa
asciilifeform: !#s from:fromloper ffa
asciilifeform: he's a very clever maths d00d. logs in every other week or so, nitpicks re fine points of ffa.
asciilifeform: for single-author, e.g. ffa, nothing really changes.
asciilifeform: ftr several different items in ffa seemed to me to be 'five-angled heptagons' (starting with how to compute the asm-less addition carries) until i solved'em
asciilifeform: the other open q is where to draw the line re 'somebody, some day, with mutilated ffa' .
a111: Logged on 2018-01-17 16:43 asciilifeform: concretely, e.g., Dividend_Index in http://btcbase.org/patches/ffa_ch7_turbo_egyptians#L31
asciilifeform: concretely, e.g., Dividend_Index in http://btcbase.org/patches/ffa_ch7_turbo_egyptians#L31
asciilifeform: ffa itself is a sort of tightrope walk, an attempt to 'и рыбку съесть и нахуй сесть' . it isn't actually possible to make all of the routines able to take every conceivable kind of compile-time abuse ( which i'd argue overlap of arguments, is ) without conditional jumps.
asciilifeform: i never proclaimed, fwiw, that all ffa routines must be able to cleanly walk over own inputs.
asciilifeform: (spoiler : ^ == ffa ch4 )
asciilifeform: the whole point of ffa is that it is to contain NO such possibility of NO such thing.
a111: Logged on 2018-01-16 06:15 apeloyee: FFA homework is fun! I'd like to present a homework problem of my own, the following Perfectly Innocent (tm) patch: http://p.bvulpes.com/pastes/tcvvO/?raw=true . The task is to find a bug WITHOUT running the code (that's cheating, per Dijkstra: " we see to it that the programming language in question has not been implemented on campus so that students are protected from the temptation to...
apeloyee: FFA homework is fun! I'd like to present a homework problem of my own, the following Perfectly Innocent (tm) patch: http://p.bvulpes.com/pastes/tcvvO/?raw=true . The task is to find a bug WITHOUT running the code (that's cheating, per Dijkstra: " we see to it that the programming language in question has not been implemented on campus so that students are protected from the temptation to...
asciilifeform: though i'll point out that ffa as seen today, does not use the cpu carry flag ( recall, no-inline-asmolade rule )
a111: Logged on 2018-01-15 19:45 BingoBoingo: phf: If I remember right Elbrus was a SPARC64 y entonces likely missing an ASM instruction useful for FFA with speed
BingoBoingo: phf: If I remember right Elbrus was a SPARC64 y entonces likely missing an ASM instruction useful for FFA with speed
mircea_popescu: dja happen upon either ffa or eucrypt write-ups, as it happens ?
asciilifeform turns head and looks at the literal wall of ffa
mod6: from_ffa: sorry I missed ya on here. but for now, yeah, that behavior is intended.
a111: Logged on 2018-01-10 20:17 from_ffa: at any rate, if I run "v.pl p ~/workspace ffa_ch1_genesis.vpatch" I expect to find ffa alongside all other projects. not an empty workspace dir with ffa in it
from_ffa: at any rate, if I run "v.pl p ~/workspace ffa_ch1_genesis.vpatch" I expect to find ffa alongside all other projects. not an empty workspace dir with ffa in it
asciilifeform: from_ffa: so please consider logging in
asciilifeform: from_ffa: and please consider getting a name, and registering with deedbot,
asciilifeform: from_ffa: post it, he'll answer when he wakes up
from_ffa: a regular lurker of the chan. just started to muck around with your ffa series
asciilifeform: from_ffa: who might you be ?
asciilifeform: from_ffa: hello ?
deedbot: from_ffa voiced for 30 minutes.
asciilifeform: !!up from_ffa
asciilifeform: meanwhile, in other ffa noose, http://www.loper-os.org/?p=2105&cpage=1#comment-18610
mircea_popescu: asciilifeform so are you implementing maurer in ffa ?
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'
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. )
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.
asciilifeform: http://btcbase.org/patches/ffa_ch4_ffacalc#L194 << from here , to end of ffa_calc.adb, whole mechanism.
asciilifeform: it does need the fast ffa, among other items.
asciilifeform: http://btcbase.org/log/2018-01-07#1766206 << after ffa i'ma necessarily move on to the chore of nailing down gnat. ☝︎
asciilifeform: http://btcbase.org/patches/ffa_ch1_genesis#L161 << the specific item that seems to fail on his box
esthlos: uh, just used ./v.pl p press_output ffa_ch1_genesis.vpatch, if that's what you mean
asciilifeform: the only data-dependent branches are in ffa_calc , the calculator.
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)
asciilifeform: we're approx. at level of a ( much cleaner ) circa- june 2017 ffa nao.
mircea_popescu: "Let’s verify the RSA seal of ffa_ch6_simplest_rsa.vpatch, the Chapter 6 code itself, using itself". epic.
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.
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)
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.
asciilifeform: !~later tell phf plox to snarf http://www.loper-os.org/pub/ffa/ffa_ch3_shifts.vpatch.benvulpes.sig .
asciilifeform: !~later tell phf plox to snarf http://www.loper-os.org/pub/ffa/ffa_ch4_ffacalc.vpatch.benvulpes.sig , ty
asciilifeform: http://btcbase.org/patches/ffa_ch5_egypt/tree/ffa/ffacalc/ffa_calc.adb#L232 << for reference
asciilifeform: point being, if you patch on an existing ffa_calc, it'll have to be reground
asciilifeform: so far the folx who code on paper, wrote ffa, and the folx who wrote on display -- wrote what.
asciilifeform: and yes this is what asciilifeform does when he wakes up : rereads ffa. all of it.
asciilifeform: >> http://btcbase.org/patches/ffa_ch5_egypt#L63 << concretely.
asciilifeform: there's a stray MustNotZero(Stack(SP)); in ffa_calc.
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
asciilifeform: diana_coman: as a side effect, you get an easily formatted code-box for blogging, as in ffa.
asciilifeform: e.g. http://btcbase.org/patches/ffa_ch4_ffacalc#L205
asciilifeform: ben_vulpes: observe again style in ffa
asciilifeform: meanwhile observe asciilifeform's formatting in ffa
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.