-
Notifications
You must be signed in to change notification settings - Fork 207
Add SafeType #26
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
jonathanpwang
merged 7 commits into
axiom-crypto:community-edition
from
nyunyunyunyu:generic-types
May 23, 2023
Merged
Add SafeType #26
Changes from all commits
Commits
Show all changes
7 commits
Select commit
Hold shift + click to select a range
f8cda76
Add SafeType
nyunyunyunyu a8b1804
Refactor & add testing
nyunyunyunyu f62df09
Add doc comment
nyunyunyunyu 69f6df6
Refactor SafeChip
nyunyunyunyu f113da9
Move gen_proof/check_proof to utils
nyunyunyunyu 18b7306
Merge branch 'community-edition' into generic-types
jonathanpwang c72caa0
Fix merge issues
nyunyunyunyu File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,73 +1,9 @@ | ||
| #![allow(clippy::type_complexity)] | ||
| use crate::halo2_proofs::{ | ||
| halo2curves::bn256::{Bn256, Fr, G1Affine}, | ||
| plonk::{create_proof, verify_proof, Circuit, ProvingKey, VerifyingKey}, | ||
| poly::commitment::ParamsProver, | ||
| poly::kzg::{ | ||
| commitment::KZGCommitmentScheme, commitment::ParamsKZG, multiopen::ProverSHPLONK, | ||
| multiopen::VerifierSHPLONK, strategy::SingleStrategy, | ||
| }, | ||
| transcript::{ | ||
| Blake2bRead, Blake2bWrite, Challenge255, TranscriptReadBuffer, TranscriptWriterBuffer, | ||
| }, | ||
| }; | ||
| use rand::rngs::OsRng; | ||
| use crate::halo2_proofs::halo2curves::bn256::Fr; | ||
|
|
||
| #[cfg(test)] | ||
| mod flex_gate_tests; | ||
| #[cfg(test)] | ||
| mod general; | ||
| #[cfg(test)] | ||
| mod idx_to_indicator; | ||
| #[cfg(test)] | ||
| mod neg_prop_tests; | ||
| #[cfg(test)] | ||
| mod pos_prop_tests; | ||
| #[cfg(test)] | ||
| mod range_gate_tests; | ||
| #[cfg(test)] | ||
| mod test_ground_truths; | ||
|
|
||
| /// helper function to generate a proof with real prover | ||
| pub fn gen_proof( | ||
| params: &ParamsKZG<Bn256>, | ||
| pk: &ProvingKey<G1Affine>, | ||
| circuit: impl Circuit<Fr>, | ||
| ) -> Vec<u8> { | ||
| let mut transcript = Blake2bWrite::<_, _, Challenge255<_>>::init(vec![]); | ||
| create_proof::< | ||
| KZGCommitmentScheme<Bn256>, | ||
| ProverSHPLONK<'_, Bn256>, | ||
| Challenge255<_>, | ||
| _, | ||
| Blake2bWrite<Vec<u8>, G1Affine, _>, | ||
| _, | ||
| >(params, pk, &[circuit], &[&[]], OsRng, &mut transcript) | ||
| .expect("prover should not fail"); | ||
| transcript.finalize() | ||
| } | ||
|
|
||
| /// helper function to verify a proof | ||
| pub fn check_proof( | ||
| params: &ParamsKZG<Bn256>, | ||
| vk: &VerifyingKey<G1Affine>, | ||
| proof: &[u8], | ||
| expect_satisfied: bool, | ||
| ) { | ||
| let verifier_params = params.verifier_params(); | ||
| let strategy = SingleStrategy::new(params); | ||
| let mut transcript = Blake2bRead::<_, _, Challenge255<_>>::init(proof); | ||
| let res = verify_proof::< | ||
| KZGCommitmentScheme<Bn256>, | ||
| VerifierSHPLONK<'_, Bn256>, | ||
| Challenge255<G1Affine>, | ||
| Blake2bRead<&[u8], G1Affine, Challenge255<G1Affine>>, | ||
| SingleStrategy<'_, Bn256>, | ||
| >(verifier_params, vk, strategy, &[&[]], &mut transcript); | ||
|
|
||
| if expect_satisfied { | ||
| assert!(res.is_ok()); | ||
| } else { | ||
| assert!(res.is_err()); | ||
| } | ||
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,3 +1,4 @@ | ||
| #![allow(clippy::type_complexity)] | ||
| use num_integer::Integer; | ||
|
|
||
| use crate::utils::biguint_to_fe; | ||
|
|
||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,146 @@ | ||
| pub use crate::{ | ||
| gates::{ | ||
| flex_gate::GateInstructions, | ||
| range::{RangeChip, RangeInstructions}, | ||
| }, | ||
| utils::ScalarField, | ||
| AssignedValue, Context, | ||
| QuantumCell::{self, Constant, Existing, Witness}, | ||
| }; | ||
| use std::cmp::{max, min}; | ||
|
|
||
| #[cfg(test)] | ||
| pub mod tests; | ||
|
|
||
| type RawAssignedValues<F> = Vec<AssignedValue<F>>; | ||
|
|
||
| const BITS_PER_BYTE: usize = 8; | ||
|
|
||
| /// SafeType's goal is to avoid out-of-range undefined behavior. | ||
| /// When building circuits, it's common to use mulitple AssignedValue<F> to represent | ||
| /// a logical varaible. For example, we might want to represent a hash with 32 AssignedValue<F> | ||
| /// where each AssignedValue represents 1 byte. However, the range of AssignedValue<F> is much | ||
| /// larger than 1 byte(0~255). If a circuit takes 32 AssignedValue<F> as inputs and some of them | ||
| /// are actually greater than 255, there could be some undefined behaviors. | ||
| /// SafeType gurantees the value range of its owned AssignedValue<F>. So circuits don't need to | ||
| /// do any extra value checking if they take SafeType as inputs. | ||
| /// TOTAL_BITS is the number of total bits of this type. | ||
| /// BYTES_PER_ELE is the number of bytes of each element. | ||
| #[derive(Clone, Debug)] | ||
| pub struct SafeType<F: ScalarField, const BYTES_PER_ELE: usize, const TOTAL_BITS: usize> { | ||
| // value is stored in little-endian. | ||
| value: RawAssignedValues<F>, | ||
| } | ||
|
|
||
| impl<F: ScalarField, const BYTES_PER_ELE: usize, const TOTAL_BITS: usize> | ||
| SafeType<F, BYTES_PER_ELE, TOTAL_BITS> | ||
| { | ||
| /// Number of bytes of each element. | ||
| pub const BYTES_PER_ELE: usize = BYTES_PER_ELE; | ||
| /// Total bits of this type. | ||
| pub const TOTAL_BITS: usize = TOTAL_BITS; | ||
| /// Number of bits of each element. | ||
| pub const BITS_PER_ELE: usize = min(TOTAL_BITS, BYTES_PER_ELE * BITS_PER_BYTE); | ||
| /// Number of elements of this type. | ||
| pub const VALUE_LENGTH: usize = | ||
| (TOTAL_BITS + BYTES_PER_ELE * BITS_PER_BYTE - 1) / (BYTES_PER_ELE * BITS_PER_BYTE); | ||
|
|
||
| // new is private so Safetype can only be constructed by this crate. | ||
| fn new(raw_values: RawAssignedValues<F>) -> Self { | ||
| assert!(raw_values.len() == Self::VALUE_LENGTH, "Invalid raw values length"); | ||
| Self { value: raw_values } | ||
| } | ||
|
|
||
| /// Return values in littile-endian. | ||
| pub fn value(&self) -> &RawAssignedValues<F> { | ||
| &self.value | ||
| } | ||
| } | ||
|
|
||
| /// Represent TOTAL_BITS with the least number of AssignedValue<F>. | ||
| /// (2^(F::NUM_BITS) - 1) might not be a valid value for F. e.g. max value of F is a prime in [2^(F::NUM_BITS-1), 2^(F::NUM_BITS) - 1] | ||
| #[allow(type_alias_bounds)] | ||
| type CompactSafeType<F: ScalarField, const TOTAL_BITS: usize> = | ||
| SafeType<F, { ((F::NUM_BITS - 1) / 8) as usize }, TOTAL_BITS>; | ||
|
|
||
| /// SafeType for bool. | ||
| pub type SafeBool<F> = CompactSafeType<F, 1>; | ||
| /// SafeType for uint8. | ||
| pub type SafeUint8<F> = CompactSafeType<F, 8>; | ||
| /// SafeType for uint16. | ||
| pub type SafeUint16<F> = CompactSafeType<F, 16>; | ||
| /// SafeType for uint32. | ||
| pub type SafeUint32<F> = CompactSafeType<F, 32>; | ||
| /// SafeType for uint64. | ||
| pub type SafeUint64<F> = CompactSafeType<F, 64>; | ||
| /// SafeType for uint128. | ||
| pub type SafeUint128<F> = CompactSafeType<F, 128>; | ||
| /// SafeType for uint256. | ||
| pub type SafeUint256<F> = CompactSafeType<F, 256>; | ||
| /// SafeType for bytes32. | ||
| pub type SafeBytes32<F> = SafeType<F, 1, 256>; | ||
|
|
||
| /// Chip for SafeType | ||
| pub struct SafeTypeChip<'a, F: ScalarField> { | ||
| range_chip: &'a RangeChip<F>, | ||
| } | ||
|
|
||
| impl<'a, F: ScalarField> SafeTypeChip<'a, F> { | ||
| /// Construct a SafeTypeChip. | ||
| pub fn new(range_chip: &'a RangeChip<F>) -> Self { | ||
| Self { range_chip } | ||
| } | ||
|
|
||
| /// Convert a vector of AssignedValue(treated as little-endian) to a SafeType. | ||
| /// The number of bytes of inputs must equal to the number of bytes of outputs. | ||
| /// This function also add contraints that a AssignedValue in inputs must be in the range of a byte. | ||
|
nyunyunyunyu marked this conversation as resolved.
|
||
| pub fn raw_bytes_to<const BYTES_PER_ELE: usize, const TOTAL_BITS: usize>( | ||
| &self, | ||
| ctx: &mut Context<F>, | ||
| inputs: RawAssignedValues<F>, | ||
| ) -> SafeType<F, BYTES_PER_ELE, TOTAL_BITS> { | ||
| let element_bits = SafeType::<F, BYTES_PER_ELE, TOTAL_BITS>::BITS_PER_ELE; | ||
| let bits = TOTAL_BITS; | ||
| assert!( | ||
| inputs.len() * BITS_PER_BYTE == max(bits, BITS_PER_BYTE), | ||
| "number of bits doesn't match" | ||
| ); | ||
| self.add_bytes_constraints(ctx, &inputs, bits); | ||
| // inputs is a bool or uint8. | ||
| if bits == 1 || element_bits == BITS_PER_BYTE { | ||
| return SafeType::<F, BYTES_PER_ELE, TOTAL_BITS>::new(inputs); | ||
| }; | ||
|
|
||
| let byte_base = (0..BYTES_PER_ELE) | ||
| .map(|i| Witness(self.range_chip.gate.pow_of_two[i * BITS_PER_BYTE])) | ||
| .collect::<Vec<_>>(); | ||
| let value = inputs | ||
| .chunks(BYTES_PER_ELE) | ||
| .map(|chunk| { | ||
| self.range_chip.gate.inner_product( | ||
| ctx, | ||
| chunk.to_vec(), | ||
| byte_base[..chunk.len()].to_vec(), | ||
| ) | ||
| }) | ||
| .collect::<Vec<_>>(); | ||
| SafeType::<F, BYTES_PER_ELE, TOTAL_BITS>::new(value) | ||
| } | ||
|
|
||
| fn add_bytes_constraints( | ||
| &self, | ||
| ctx: &mut Context<F>, | ||
| inputs: &RawAssignedValues<F>, | ||
| bits: usize, | ||
| ) { | ||
| let mut bits_left = bits; | ||
| for input in inputs { | ||
| let num_bit = min(bits_left, BITS_PER_BYTE); | ||
| self.range_chip.range_check(ctx, *input, num_bit); | ||
| bits_left -= num_bit; | ||
| } | ||
| } | ||
|
|
||
| // TODO: Add comprasion. e.g. is_less_than(SafeUint8, SafeUint8) -> SafeBool | ||
| // TODO: Add type castings. e.g. uint256 -> bytes32/uint32 -> uint64 | ||
| } | ||
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.