The expedience of progressing hierarchical lossless image compression is justified, 
the method of round of pixels and basic static predictors for realization 
of such compression are described. The algorithm of generation of the alternative 
compressed Deflate-blocks, choice of the shortest block from alternative 
and iterative diminishing of its length for the improvement of compression 
of information are described. The modifications of format Deflate for the increase 
of efficiency of hierarchical lossless image compression with the use 
of a few dictionaries but sliding windows are offered and grounded. 
As experiments show, combined application of the offered algorithms 
for optimization of Deflate-blocks enables to decrease aspect 
of images ratios approximately on 6 % but to accelerate decoding on 20 %.