@@ -11,40 +11,25 @@ A collection of cryptography primitives written in Rust.
1111This library contains primarily the following cryptographic primitives:
1212
1313- The Tip5 hash function
14- - [ The Tip5 Hash Function for Recursive STARKs] ( https://eprint.iacr.org/2023/107 )
14+ - [ The Tip5 Hash Function for Recursive STARKs] ( https://eprint.iacr.org/2023/107 )
1515- Lattice-crypto
16- - arithmetic for the quotient ring $\mathbb{F}_ p[ X] / \langle X^{64} + 1 \rangle$
17- - arithmetic for modules over this quotient ring
18- - a IND-CCA2-secure key encapsulation mechanism
19- - [ Lattice-Based Cryptography in Miden VM] ( https://eprint.iacr.org/2022/1041 )
16+ - arithmetic for the quotient ring $\mathbb{F}_ p[ X] / \langle X^{64} + 1 \rangle$
17+ - arithmetic for modules over this quotient ring
18+ - a IND-CCA2-secure key encapsulation mechanism
19+ - [ Lattice-Based Cryptography in Miden VM] ( https://eprint.iacr.org/2022/1041 )
2020- ` BFieldElement ` , ` XFieldElement `
21- - The prime-field type $\mathbb{F}_ p$ where $p = 2^{64} - 2^{32} + 1$
22- - The extension field $\mathbb{F}_ p[ x] /(x^3 - x + 1)$
23- - A codec trait for encoding and decoding structs as ` Vec ` s of ` BFieldElement `
24- - [ An efficient prime for number-theoretic transforms] ( https://cp4space.hatsya.com/2021/09/01/an-efficient-prime-for-number-theoretic-transforms/ )
21+ - The prime-field type $\mathbb{F}_ p$ where $p = 2^{64} - 2^{32} + 1$
22+ - The extension field $\mathbb{F}_ p[ x] /(x^3 - x + 1)$
23+ - A codec trait for encoding and decoding structs as ` Vec ` s of ` BFieldElement `
24+ - [ An efficient prime for number-theoretic transforms] ( https://cp4space.hatsya.com/2021/09/01/an-efficient-prime-for-number-theoretic-transforms/ )
2525- NTT
26- - Number Theoretic Transform (discrete Fast Fourier Transform)
27- - [ Anatomy of a STARK, Part 6: Speeding Things Up] ( https://neptune.cash/learn/stark-anatomy/faster/ )
28- - Univariate and multivariate polynomials
26+ - Number Theoretic Transform (discrete Fast Fourier Transform)
27+ - [ Anatomy of a STARK, Part 6: Speeding Things Up] ( https://neptune.cash/learn/stark-anatomy/faster/ )
28+ - Univariate polynomials
2929- Merkle Trees
3030- Merkle Mountain Ranges
3131
32- ## Release protocol
32+ ## Wasm support
3333
34- While twenty-first's version is ` 0.x.y ` , releasing a new version:
35-
36- 1 . Is the release backwards-compatible?
37- Then the new version is ` 0.x.y+1 ` . Otherwise the new version is ` 0.x+1.0 ` .
38- 2 . Checkout the last commit on Mjolnir, and run ` make bench-publish ` . Save the benchmark's result
39- and verify that there is no performance degradation.
40- 3 . Create a commit that increases ` version = "0.x.y" ` in twenty-first/Cargo.toml.
41- The commit message should give a one-line summary of each release change. Include the benchmark
42- result at the bottom.
43- 4 . Have a ` v0.x.y ` [ git tag] [ tag ] on this commit created. (` git tag v0.x.y [sha] ` , ` git push upstream --tags ` )
44- 5 . Have this commit ` cargo publish ` ed on [ crates.io] [ crates ] and in GitHub [ tags] [ tags ] .
45-
46- [ tag ] : https://git-scm.com/book/en/v2/Git-Basics-Tagging
47- [ tags ] : https://github.com/Neptune-Crypto/twenty-first/tags
48- [ crates ] : https://crates.io/crates/twenty-first/versions
49-
50- If you do not have the privilege to create git tags or run ` cargo publish ` , submit a PR and the merger will take care of these.
34+ The ` twenty-first ` library can be built for WebAssembly. See the [ dedicated readme] ( twenty-first/README-wasm32.md ) for
35+ further information.
0 commit comments