General approach » History » Revision 1
Each file the user want to share is cut sequentially in pieces called chunk. Each chunk has the same size except the last one which can be smaller.
For each chunk there is a footprint called hash which identify the chunk. We admit that two chunks with the same hash contains the same data. The hash is computed with a cryptographic hash function like SHA-1.