Plasma Cash Defragmentation

[kladkogex]

@vbuterin

What claim are you looking to STARK prove? In general it should be possible to just make a STARK proof for an entire subtree in O(log(n))O(log(n)) time.

May be it is not relevant anymore, but people were thinking about doing non-inclusion proofs using SN(T)ARKS - may be it is not relevant

Plasma Cash verification cost

If there is a Plasma block every minute, then if one holds a coin for a year the size of the non-spend proof for a payment is 60 * 24 * 365 * 100 * 10 * 256 = 17 Gbyte This assumes that an average payment transfers 10 coins and that the depth of the Merkle tree is 100 This needs to be multiplied by 2 because the receiver needs to send the change back. So it is 34 GByte total traffic How feasible is the entire payment then? How long will it take for sender to upload and for receiver to down…

If there are lots of small coins there will be lots non-inclusions proofs - correct me I am wrong …