v0.19.0

What's new?

Binary field compilation

Keelung now supports compilation over any prime field or binary extension field!

What is this for?

This update enables developers to utilize proving systems that are optimized for binary fields. In binary fields, operations like XOR are inherently more efficient, leading to a reduction in constraints when compared to prime fields. For applications that heavily rely on such operations, adopting binary fields can lead to substantial performance improvements.

How to enable this?

To switch to binary fields, simply replace the FieldType in your commands:

compile gf181        program [...] [...] -- prime fields
compile (Binary 283) program [...] [...] -- binary fields

And that’s all it takes!

Checkout the documentation if you want to know more about FieldType.

What's Next?

The integration of Snarkjs/Circom’s toolchain should be around the corner, as we’ve made a lot of progress in the past few weeks.

Stay tuned for the coming releases!