@@ -56,6 +56,17 @@ In the following we will describe the binary structure of each of the different
# Data Chunk
Each Data Chunk consists of a small header, which indicate where the rank ran. This is followed by the main data section which contains the timing data and additional aggregated data in the case of Rank 0. Finally a tiny footer indicates the end of the chunk.
If multiple permutations of randomized ranks were tests this data is stored back-to-back inside the Data Chunk. Given M permutations the Data Chunk for a rank would look like:
```
Data Chunk Header
Data Chunk Data - Permuation 1
Data Chunk Data - Permuation 2
...
Data Chunk Data - Permuation M
Data Chunk Footer
```
## Data Chunk Header
Each Data Chunk start with a small header indicate where the rank ran. For the non-zero ranks this is started with the "LKTST" ID-String.
