Seta, the humble poor inventor who largely relied on the sacrifices of his pupils for his livelihood, appeared before the king.

`I'd like to award you, Seta, for your astonishing game' said the king.
`My lord,' replied Seta, `Please give me one wheat grain, and...'
`Wheat grain?' the king interjected.
`Yes, My lord. One more grain for the first square of the chessboard, two for the second, four for the third, eight for the fourth, sixteen for the fifth, thirty two for the sixth...'
`Enough!' the king dejectedly interrupted him. `You will get grains for all sixty four squares, as you wish: twice more grains for each square than for its predecessor. Remember, your request is unworthy of the Crown.'

Before retiring to bed that evening, the king inquired whether Seta had left the courtyard with his bagful of grains.
`My lord,' his courtier said, `court mathematicians are still busy and hope to finish the count before dawn.'

Next morning the royal mathematician was awaiting audience at the palace.
`Tell me,' the king shouted, `had Seta got the miserable reward he wanted.'
`That is why I have came so early, My lord' replied the old man, and continued. `You may plough all lands, dry up all oceans, melt all frozen seas, raze all mountains to ground, sow the whole earth with wheat, and yet the harvest will not come up to his reward. The number of grains needed is, indeed, inconceivable:

The larger the bit-capacity, the greater the time needed to scan data for changes. But CRC16- and CRC32-based strategies make decisions on interference algorithmically and, therefore, almost instantly.

LAN64-based algorithm is intelligent enough to taboo any data interference without changing the hash function. Therefore, scanning is the only way and, therefore, bit-capacity here plays a key role! The amount of computations required for LAN64 is not executable in real time. The number of variants that have to be explored for selecting suitable interfering bytes is, indeed, inconceivable: