perf(pcs): Optimize polynomial evaluation with cache-friendly algorithm

[VolodymyrBg]

closes: #

This PR:

• Optimizes polynomial evaluation in horner_evaluate function with a cache-friendly algorithm
• Improves performance for large polynomials by processing them in chunks
• Reduces redundant calculations by pre-computing powers of evaluation points

This PR does not:

• Implement the full FFT-based batch evaluation mentioned in TODO comments
• Address other performance optimizations in the codebase

Key places to review:

• pcs/src/poly.rs, horner_evaluate function - optimized algorithm with chunking approach

---

Before we can merge this PR, please make sure that all the following items have been
checked off. If any of the checklist items are not applicable, please leave them but
write a little note why.

• Targeted PR against correct branch (main)
• Linked to GitHub issue with discussion and accepted design OR have an explanation in the PR that describes this work.
• Wrote unit tests (N/A - optimization preserves existing behavior, covered by existing tests)
• Updated relevant documentation in the code
• Added relevant changelog entries to the CHANGELOG.md of touched crates. (N/A - minor optimization)
• Re-reviewed Files changed in the GitHub PR explorer