asciilifeform: and to this day afaik nobody has anything like a sybilproof way to glue 1024 unreliable chickens into a simulacrum of a pc
asciilifeform: plugging the funnel at wrong end, so to speak.
asciilifeform: possibly we had this thread, but asciilifeform's unpublished, failed stab 'at bitcoin' decade+ ago was , more or less, 'uci running martianbank'
asciilifeform: ( usaschwitz inmate could live 100yrs without once seeing a live chicken )
asciilifeform: i fully expect that most 'uci' install would be by hand.
asciilifeform: and during this, thought 'you could easily get folx installing 'virus' wholly voluntarily, if it eliminated this & other crapola in a silent-to-brass way'
asciilifeform: when asciilifeform toiled in usg salt mine, on some days the Official shitbox would be ~unusable: ~no cycles left over from 'antivirus'
asciilifeform: mircea_popescu: right but they sell it at, what , 1000x margin.
asciilifeform: the ancient dream of the fungible cpu cycle keeps coming back. but sadly still - a dream
asciilifeform: that's the thing with sybils: what you thought were independents, turn out to be an aggregate
asciilifeform: depends in which way unreliable. e.g. say they all , on command, simultaneously reveal to be d00dz and pick up rifles. then battalion, whereas yesterday - brothel
asciilifeform: ( even to the extent of whether it happens )
asciilifeform: hey this worx great so long as the secrecy of the contents, or the reliability of the computation, dun matter at all
asciilifeform: ( 'but there was a protected type!' alert reader will ask. the pill is the obvious one, i will reveal it later. )
asciilifeform: interestingly this gives ~0 performance boost. gcc optimizer, turns out, is notbad.jpg.
asciilifeform: mod6 et al : in other noose, i have a working experimental build with No_Implicit_Conditionals, No_Implicit_Heap_Allocations, No_Implicit_Dynamic_Code, No_Secondary_Stack, No_Exception_Propagation, No_Tasking, No_Protected_Types, No_Delay, No_Allocators, No_Dispatch restrictions.☟︎
asciilifeform: ( recall the sheet of paper that came with your FG. )
asciilifeform: so we actually have it, in there, nao.
asciilifeform: eventually i derived that this is equivalent to the equation seen in the 'watchdog' circuit in fg.v
asciilifeform: i.e. a lamp whose brightness is proportional to how close (bits emitted from vonneumann filter per sec) / ( bits entering same, per sec) is to 1
asciilifeform: mircea_popescu: i actually considered something that is arguably a variant of your test, when designing FG,
asciilifeform: e.g., aes(0, 1, 2, ...., maxint) is perfectly uniform by all known tests.
asciilifeform: passfail or 1024bit number, dun matter.
asciilifeform: meanwhile in the land of toy crypto, https://eprint.iacr.org/2017/655 >> '...Inmarsat satellite phones... the 64-bit encryption-key... recovered in around 0.02s on average'