Gray's Law of Trivial Dynamic Compression

'n+1' trivial tasks are expected to take no longer than 'n' trivial tasks. However, 'n+1' trivial tasks take twice as long as 'n' trivial tasks.

||||