Telegram Sharding

The paper kind of shows that the incredible Mr. Durov never took an undergraduate course in cryptography

For example, what is this hillarius statement supposed to mean ?)

Mr. Durov needs to read about birthday paradox, his formulas make no sense, and also why so much obsession about numbers ?)) Why 10^{-18} ? May because it is a billion of billions and Mr. Durov thinks it is a really really big number ?))

Fixing an incorrectblock generates “ripples” that are ultimately propagated towards the recent blocks of all affected shardchains; these changes are reflected in new“vertical” masterchain blocks as well

Seem to be lots of ripples - this essentially breaks all existing mathematical proofs of bllockchain security so it is a totally unchartered territory ruled by the genius of Mr. Durov :slight_smile:

Most systems would achieve this by “rolling back” to the last block before the invalid one in this shard chain and the last blocks unaffected by messages propagated from the invalid block in each of the other shard chains, and creating a new fork from these blocks. This approach has the disadvantage that a large number of otherwise correct and committed transactions are suddenly rolled back, and it is unclear whether they will be included later at all

Which “most systems”? Who would design a crazy system that “suddenly rolls back” committed transactions?))

TVM offers support for bit strings and byte strings

If it supports bit strings isnt it automatically supposed to support byte strings, because a byte string is also a bit string ?)))

Once a validator obtains enough chunks to reconstruct the block candidate from them, it signs a confirmation receipt and propagates it through its neighbors to the whole of the group. Then its neighbors stop sending new chunks to it, but may continue to send the(original) signatures of these chunks, believing that this node can generate the subsequent chunks by applying the Reed–Solomon or fountain code by itself(having all data necessary), combine them with signatures, and propagate to its neighbors that are not yet ready

This is like the worst BFT protocol ever created ) How can neighbors “believe” in something - are they some kind of live creatures ? Or Mr Durov wants to put a human on each node ?))
How can neighbors know which other neighbors are ready and which are not ready? And then ready for what ?) He never explains what should they be ready for.

2 Likes