Optimizing Barrett Reduction: Tighter Bounds Eliminate Redundant Subtractions

Our analysis, conducted during the Rust p256 crate audit, shows that the error bound for Barrett reduction can be tighter than traditionally assumed.

In this blogpost, I proved that Barrett Reduction can have a tighter bound than the well-known bound: https://blog.zksecurity.xyz/posts/barrett-tighter-bound/