log☇︎
12 entries in 0.659s
a111: Logged on 2018-10-23 15:14 deedbot: http://qntra.net/2018/10/manufactured-trannycocist-outrage-over-sqlites-longstanding-benedictine-code-of-conduct-as-coc-incompatibilities-set-up-to-replace-license-incompatibilities-as-top-open-source-drama-fountain/ << Qntra - Manufactured TrannyCoCist Outrage Over SQLite's Longstanding Benedictine Code Of Conduct As CoC Incompatibilities Set Up To Replace License Incompatibilities As Top Open Source Drama Fountain
deedbot: http://qntra.net/2018/10/manufactured-trannycocist-outrage-over-sqlites-longstanding-benedictine-code-of-conduct-as-coc-incompatibilities-set-up-to-replace-license-incompatibilities-as-top-open-source-drama-fountain/ << Qntra - Manufactured TrannyCoCist Outrage Over SQLite's Longstanding Benedictine Code Of Conduct As CoC Incompatibilities Set Up To Replace License Incompatibilities As Top Open Source Drama Fountain ☟︎
asciilifeform: (tcp, that massive barrel of liquishit, was designed before the discovery of luby code - or any of the subsequent 'fountain' algos)
a111: 6 results for "fountain code", http://btcbase.org/log-search?q=fountain%20code
asciilifeform: $s fountain code
assbot: Logged on 16-12-2014 01:40:04; asciilifeform: what follows is the payload, divided into K gibblets, each below udp mtu in size, each signed with ephemeral key. the gibblets are coded using fountain code (e.g. 'raptor') and you need N of K - in any order - to reassemble.
asciilifeform: artifexd: you don't strictly speaking need fountain code in first version of this apparatus.
asciilifeform: artifexd: there are several known ways of doing a 'fountain code' (term of art) - where a bitstring, B, is transformed into a number, N, of shorter bitstrings, whereby X of N can be collected, in any order, and with certain quantity of errors permissible, to reconstitute B.
asciilifeform: at any rate, tiny packets plus fountain code plus each one is signed, will work great with transmission media other than internet (say, shortwave)
asciilifeform: what follows is the payload, divided into K gibblets, each below udp mtu in size, each signed with ephemeral key. the gibblets are coded using fountain code (e.g. 'raptor') and you need N of K - in any order - to reassemble. ☟︎
asciilifeform: someone probably wonders 'wtf, why fountain code'. answer: getting rid of tcp.
asciilifeform: i may have spoken of this once. i've a very rough draft of precisely this, using an interesting bit of mathematics called 'fountain code'