mirror of https://github.com/logos-storage/plonky2.git synced 2026-01-03 14:23:07 +00:00

History

Fix BaseSumGenerator and BaseSplitGenerator Ids (#1494 )

* fix: different ids for generators with different bases

required for correct serialisation

Signed-off-by: electron-team <utsavjn48@gmail.com>

* fixing wasm32 build issue

Signed-off-by: electron-team <utsavjn48@gmail.com>

* fix fmt issue

Signed-off-by: electron-team <utsavjn48@gmail.com>

---------

Signed-off-by: electron-team <utsavjn48@gmail.com>

2024-02-01 08:49:36 -05:00

.cargo

Add math rendering with Katex (#1459 )

2024-01-12 17:07:18 +01:00

benches

Fix compile time problems and generic hash implementation (#1024 )

2023-05-11 02:59:02 +10:00

examples

Remove unused attributes

2023-08-02 08:54:20 -04:00

src

Fix BaseSumGenerator and BaseSplitGenerator Ids (#1494 )

2024-02-01 08:49:36 -05:00

Cargo.toml

Use web_time crate instead of std::time (#1481 )

2024-01-25 08:20:34 -05:00

LICENSE-APACHE

MIT + Apache2 licenses

2022-08-15 07:43:00 -07:00

LICENSE-MIT

MIT + Apache2 licenses

2022-08-15 07:43:00 -07:00

plonky2.pdf

Update paper

2022-09-07 07:46:43 -07:00

README.md

Updated mir-protocol --> 0xPolygonZero

2023-10-12 11:11:17 -06:00

README.md

Plonky2

Plonky2 is a SNARK implementation based on techniques from PLONK and FRI. It is the successor of Plonky, which was based on PLONK and Halo.

Plonky2 is built for speed, and features a highly efficient recursive circuit. On a Macbook Pro, recursive proofs can be generated in about 170 ms.

License

Licensed under either of

Apache License, Version 2.0, (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)

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.