So it compresses titanic data down to some Booleans and chess expressions.
Size: 4096 x 4096 Offset: (0,0) Def: GameA Opening Lib:C3 Turns: 2567
[&] Size: 512x 512 Offset: (12,0) Def: GameB Opening Lib:G42 Turns: 12
[!] Size: 4096 x 4096 Offset: (0,0) Def: GameD Opening Lib: FULL_HOUSE Turns: 0
Its a pretty nifty way to compress files beyond the point of no return, knowing that the deterministic knowledge of the game- allows for a full recreation of any file, given enough processing power and time.
There are of course some attempts to optimize the whole process- having often used game snapshots to fast-forward from and re-wind back too.