I'm so excited 𝔹itℤ by @0xAlbertG et al. is now public! It combines boolean and integer relations, free range checks and efficient binary field commitments. In short: your proof system is no longer tied to a particular finite field. The performance exceeded our expectations. Despite being field agnostic, it performed better on real world tasks than systems fine-tuned for the task. We completely changed the ProveKit roadmap for 𝔹itℤ, and I expect others will too! eprint.iacr.org/2026/2141

Sep 23, 2026 · 1:15 PM UTC

2
14
82
3,335
Sort replies: Relevant Recent Liked
Replying to @recmo @0xAlbertG
Does that mean you can change the finite field based on which h/w target is mostly used for proving? For example, mobile proving will use mostly cpu and webgpu, you can tune for it to use 32 bit or smaller field. But on desktop/ server targets you can use 64 bit or so field?
1
1
173
The core of it is binary fields, and these are fast on every target.
3
131
Replying to @recmo @0xAlbertG
I see. But could I have switched fields in same SNARK?
1
101
Yes, you can do either open in your field of choice. Or open in the integers and arithmetize your finite field constraints over the integers (which is very efficient in practice).
1
90
more replies