feat: update to provable params

[zlangley]

Syncs with openvm-org/stark-backend#202

closes INT-5601

[codspeed-hq]

CodSpeed Performance Report

Merging #2301 will not alter performance

_{Comparing feat/provable-params (ee964ac) with main (a1bce3e)¹}

⚠️ Unknown Walltime execution environment detected

Using the Walltime instrument on standard Hosted Runners will lead to inconsistent data.

For the most accurate results, we recommend using CodSpeed Macro Runners: bare-metal machines fine-tuned for performance measurement consistency.

Summary

✅ 24 untouched
⏩ 36 skipped²

Footnotes

1. No successful run was found on develop-v1.5.0 (83a5ca7) during the generation of this report, so main (a1bce3e) was used instead as the comparison base. There might be some changes unrelated to this pull request in this report. ↩

2. 36 benchmarks were skipped, so the baseline results were used instead. If they were deleted from the codebase, click here and archive them to remove them from the performance reports. ↩

[jonathanpwang]

Reth benchmark using this branch: https://github.com/axiom-crypto/openvm-reth-benchmark/blob/gh-pages/benchmarks-dispatch/refs/heads/feat/provable-params/reth-dddd29dc3442152a98fb91f46148156651861c31-303f412b71c36c32dddf226588efdea588bcf1c93ccd066444df50253c9098b9.md

[github-actions]

group	app.proof_time_ms	app.cycles	app.cells_used	leaf.proof_time_ms	leaf.cycles	leaf.cells_used
verify_fibair	728	621,589	3,608,490	-	-	-
fibonacci	1,616	1,500,209	2,100,402	3,883	3,999,477	19,821,452
regex	3,883	4,137,502	17,695,216	11,271	9,252,144	60,830,730
ecrecover	1,010	122,859	2,262,772	5,577	4,109,187	34,465,046
pairing	2,232	1,745,742	25,408,302	6,367	5,977,438	40,833,672
fib_e2e	5,816	12,000,209	14,203,554	26,963	24,071,196	124,637,876
kitchen_sink	3,733	154,763	18,338,948	10,494	12,577,391	125,247,500

Commit: ee964ac

Benchmark Workflow

[jonathanpwang]

LGTM

I fixed Sdk constructor to never use testing constructor. I fixed the integration test: the reason is that if the leaf params has no queries but the internal params do, you can get a situation where no amount of recursion shrinks the proof enough.