Bulat-Ziganshin

TinyCC is library. Although I don't know, may be it require too much time to setup the environment. LLVM has size of 20-40 MB, I don't know exactly. I want...

irrespective of this particular implementation 1. prefetching command is a part of sse1 2. on older cpus one can use `volatile char x = *ptr` instead. but it will probably...

the first idea that come to mind `crc32(uint64(x)*seed)`, of course for seed!=0 and 32-bit x value

afair, crcN(uintN) is always reversible function, so author can include it in his list of reversible primitives that said, half of his primitives are parameterized, so you can use any...

>If you change one bit of input, only one bit of output is changed and other are unchanged. I wonder what do you mean here? It has two operands and...

Currently, we plan a series of documents: Blog posts: - #117 - Layouts - Lazy recovery etc. Formal documents: - Layouts: formal definition and comparison by speed, reliability, extensibility etc.

We may have several different layouts. F.e. let's specify one of them, a simplified one with fair distribution of download bandwidth: User provides `S*K` blocks and requests K+M encoding saving...

That's a writeup of arguments for using "layout B", i.e. layout described in my previous message, trying to put it in the form suitable for inclusion in the document. We...

As the third alternative (layout "C"), @dryajov proposed "diagonale layout" which allows to append ECC blocks to the datastore, simplify indexing, and simplify adding recovery on top of pure data...

The "layout B" has advantage for sequential reading when some nodes lost: if we have M+K encoding, then we can receive one block per node from any M nodes and...