A Fountain code demo using Luby transforms. The message is transformed into (theoretically) limitless number of chucks. The message can then be assembled by collecting enough "droplets" that is proportional to the original message size.
Each droplet starts a resolution process, which is coloured as follows: Inver by current packet Infer previous packet, and Immediately known
* For simplicity I used simple-soliton distribution, this can cause skews and does not guarantee completion. A robust-soliton distribution should work far better.