On Thu, Mar 06, 2025 at 12:43:56AM +0100, Michael Niedermayer wrote:
> This improves compression by 0.1% overall and 44% for the changed table
> I tried several other things but so far this is the best
> compromise between complexity and compression
> 
> This can also be extended to 32 and 64bit floats
> 
> Sponsored-by: Sovereign Tech Fund
> Signed-off-by: Michael Niedermayer <michael@niedermayer.cc>
> ---
>  libavcodec/ffv1dec_template.c | 23 ++++++++++++++++++-----
>  libavcodec/ffv1enc_template.c | 17 ++++++++++++++---
>  2 files changed, 32 insertions(+), 8 deletions(-)

Will apply

This requires strict experimental currently, so it can still
be changed

thx

[...]
-- 
Michael     GnuPG fingerprint: 9FF2128B147EF6730BADF133611EC787040B0FAB

Awnsering whenever a program halts or runs forever is
On a turing machine, in general impossible (turings halting problem).
On any real computer, always possible as a real computer has a finite number
of states N, and will either halt in less than N cycles or never halt.