Pasta curves (Pallas/Vesta) — formal verification source
Find a file
Volker Mische 67e5595702 Improve 64-bit to 32-bit limb conversion
The code base is now on Rust 1.56 and Rust edition 2021. As per
https://github.com/zcash/pasta_curves/pull/31#discussion_r824826344
the code can now be simplified. This commit is also adding a test
for the u64_to_u32 function.
2022-11-25 11:17:37 +01:00
.github Migrate to ff 0.12, group 0.12 2022-05-04 23:22:15 +00:00
benches Add benchmarks for point operations. 2021-08-11 15:09:34 +01:00
book book: Fix broken links 2021-03-04 14:02:12 +00:00
src Improve 64-bit to 32-bit limb conversion 2022-11-25 11:17:37 +01:00
.gitignore Add book/Makefile for local HTML generation. 2020-12-26 15:33:59 +00:00
Cargo.toml Migrate to ff revision with trait constants 2022-11-19 12:16:10 +00:00
CHANGELOG.md Migrate to ff revision with square root backports 2022-11-19 12:03:54 +00:00
COPYING.md Ensure that GitHub's "View license" link points to complete license information. 2022-01-04 17:30:00 +00:00
katex-header.html Initial commit 2020-08-22 14:15:39 -06:00
LICENSE-APACHE Relicense pasta_curves as MIT OR Apache-2.0 2021-09-17 16:32:36 +01:00
LICENSE-MIT Relicense pasta_curves as MIT OR Apache-2.0 2021-09-17 16:32:36 +01:00
README.md Migrate to ff 0.12, group 0.12 2022-05-04 23:22:15 +00:00
rust-toolchain Migrate to ff 0.12, group 0.12 2022-05-04 23:22:15 +00:00

pasta_curves

This crate provides an implementation of the Pasta elliptic curve constructions, Pallas and Vesta. More details about the Pasta curves can be found in this blog post.

Documentation

Minimum Supported Rust Version

Requires Rust 1.56 or higher.

Minimum supported Rust version can be changed in the future, but it will be done with a minor version bump.

Curve Descriptions

  • Pallas: y2 = x3 + 5 over GF(0x40000000000000000000000000000000224698fc094cf91b992d30ed00000001).

  • Vesta: y2 = x3 + 5 over GF(0x40000000000000000000000000000000224698fc0994a8dd8c46eb2100000001).

The Pasta curves form a cycle with one another: the order of each curve is exactly the base field of the other. This property is critical to the efficiency of recursive proof systems. They are designed to be highly 2-adic, meaning that a large power-of-two multiplicative subgroup exists in each field. This is important for the performance of polynomial arithmetic over their scalar fields and is essential for protocols similar to PLONK.

These curves can be reproducibly obtained using a curve search utility weve published.

License

Licensed under either of

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.