saymrwulf/pasta_curves-source
1
0
Fork 0
mirror of https://github.com/saymrwulf/pasta_curves-source.git synced 2026-09-03 19:53:40 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Change absorb_ to read_ in subprotocols.

Browse source
This commit is contained in:
Sean Bowe 2021-01-13 15:47:35 -07:00
parent 9a26ef1acd
commit 775151a67d
No known key found for this signature in database
GPG key ID: 95684257D8F8B031
4 changed files with 8 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
src/plonk/lookup/verifier.rs
View file

@ -30,7 +30,7 @@ pub struct Evaluated<C: CurveAffine> {
}
impl Argument {
pub(in crate::plonk) fn absorb_permuted_commitments<C: CurveAffine, T: TranscriptRead<C>>(
pub(in crate::plonk) fn read_permuted_commitments<C: CurveAffine, T: TranscriptRead<C>>(
&self,
transcript: &mut T,
) -> Result<PermutationCommitments<C>, Error> {
@ -49,7 +49,7 @@ impl Argument {
}
impl<C: CurveAffine> PermutationCommitments<C> {
pub(in crate::plonk) fn absorb_product_commitment<T: TranscriptRead<C>>(
pub(in crate::plonk) fn read_product_commitment<T: TranscriptRead<C>>(
self,
transcript: &mut T,
) -> Result<Committed<C>, Error> {

2
src/plonk/permutation/verifier.rs
View file

@ -21,7 +21,7 @@ pub struct Evaluated<C: CurveAffine> {
}
impl Argument {
pub(crate) fn absorb_product_commitment<C: CurveAffine, T: TranscriptRead<C>>(
pub(crate) fn read_product_commitment<C: CurveAffine, T: TranscriptRead<C>>(
&self,
transcript: &mut T,
) -> Result<Committed<C>, Error> {

2
src/plonk/vanishing/verifier.rs
View file

@ -19,7 +19,7 @@ pub struct Evaluated<C: CurveAffine> {
}
impl<C: CurveAffine> Argument<C> {
pub(in crate::plonk) fn absorb_commitments<T: TranscriptRead<C>>(
pub(in crate::plonk) fn read_commitments<T: TranscriptRead<C>>(
vk: &VerifyingKey<C>,
transcript: &mut T,
) -> Result<Committed<C>, Error> {

8
src/plonk/verifier.rs
View file

@ -44,7 +44,7 @@ pub fn verify_proof<'a, C: CurveAffine, T: TranscriptRead<C>>(
.cs
.lookups
.iter()
.map(|argument| argument.absorb_permuted_commitments(transcript))
.map(|argument| argument.read_permuted_commitments(transcript))
.collect::<Result<Vec<_>, _>>()?;
// Sample beta challenge
@ -58,19 +58,19 @@ pub fn verify_proof<'a, C: CurveAffine, T: TranscriptRead<C>>(
.cs
.permutations
.iter()
.map(|argument| argument.absorb_product_commitment(transcript))
.map(|argument| argument.read_product_commitment(transcript))
.collect::<Result<Vec<_>, _>>()?;
// Hash each lookup product commitment
let lookups = lookups
.into_iter()
.map(|lookup| lookup.absorb_product_commitment(transcript))
.map(|lookup| lookup.read_product_commitment(transcript))
.collect::<Result<Vec<_>, _>>()?;
// Sample y challenge, which keeps the gates linearly independent.
let y = ChallengeY::get(transcript);
let vanishing = vanishing::Argument::absorb_commitments(vk, transcript)?;
let vanishing = vanishing::Argument::read_commitments(vk, transcript)?;
// Sample x challenge, which is used to ensure the circuit is
// satisfied with high probability.