mdnt_support/
lib.rs

1//! Support crate for integrating the extractor.
2
3#![deny(rustdoc::broken_intra_doc_links)]
4#![deny(missing_debug_implementations)]
5#![deny(missing_docs)]
6
7use ff::{Field, PrimeField};
8
9use num_bigint::{BigInt, BigUint};
10use num_traits::{Num as _, Signed as _};
11
12use crate::error::Error;
13
14pub mod cells;
15pub mod circuit;
16pub mod error;
17pub mod macros;
18
19pub use haloumi_ir as ir;
20
21/// This trait defines the halo2 types required by this crate.
22/// An implementation of halo2 compatible with this crate must have
23/// some type that implements this trait s.t. it can be passed to traits
24/// and types in this crate.
25pub trait Halo2Types<F: Field> {
26    /// Type for instance columns.
27    type InstanceCol: std::fmt::Debug + Copy + Clone;
28    /// Type for advice columns.
29    type AdviceCol: std::fmt::Debug + Copy + Clone;
30    /// Type for a cell.
31    type Cell: std::fmt::Debug + Copy + Clone;
32    /// Type for an assigned cell.
33    type AssignedCell<V>;
34    /// Region type.
35    type Region<'a>;
36    /// Error type.
37    type Error: Into<crate::error::Error> + From<crate::error::Error>;
38    /// Region index type
39    type RegionIndex: std::hash::Hash + Copy + Eq;
40    /// Expression type
41    type Expression;
42    /// Associated type for Rational.
43    type Rational;
44}
45
46/// Parses a value of F from the given string.
47pub fn parse_field<F: PrimeField>(s: &str) -> Result<F, Error> {
48    if s.is_empty() {
49        return Err(Error::FieldParsingError);
50    }
51    let ten = F::from(10);
52    s.chars()
53        .map(|c| c.to_digit(10).ok_or(Error::FieldParsingError))
54        .map(|r| r.map(u64::from))
55        .map(|r| r.map(F::from))
56        .fold(Ok(F::ZERO), |acc, c| Ok(acc? * ten + c?))
57}
58
59/// Returns the modulus of the field as a [`BigUint`].
60fn modulus<F: PrimeField>() -> BigUint {
61    BigUint::from_str_radix(&F::MODULUS[2..], 16).unwrap()
62}
63
64/// Returns the modulus of the field as a [`BigInt`].
65fn modulus_signed<F: PrimeField>() -> BigInt {
66    BigInt::from_str_radix(&F::MODULUS[2..], 16).unwrap()
67}
68
69/// Converts a big unsigned integer into a prime field element.
70pub fn big_to_fe<F: PrimeField>(e: BigUint) -> F {
71    let modulus = modulus::<F>();
72    let e = e % modulus;
73    F::from_str_vartime(&e.to_str_radix(10)[..]).unwrap()
74}
75
76/// Converts a big signed integer into a prime field element.
77/// If the value is negative it wraps around the field's modulus.
78pub fn sbig_to_fe<F: PrimeField>(mut e: BigInt) -> F {
79    let modulus = modulus_signed::<F>();
80    e = (e % modulus).abs();
81    F::from_str_vartime(&e.to_str_radix(10)[..]).unwrap()
82}
83
84/// Converts a prime field element into a big unsigned integer.
85pub fn fe_to_big<F: PrimeField>(fe: F) -> BigUint {
86    BigUint::from_bytes_le(fe.to_repr().as_ref())
87}
88
89/// Creates an [`Expression`] that queries the given cell relative to the
90/// beginning of the cell's region.
91#[macro_export]
92macro_rules! cell_to_expr {
93    ($x:expr, $F:ty) => {{
94        let c = $x.cell();
95        i32::try_from(c.row_offset)
96            .map(midnight_proofs::poly::Rotation)
97            .map(|r| c.column.query_cell::<$F>(r))
98            .map_err($crate::error::Error::from)
99    }};
100}
mdnt_support/lib.rs

mdnt_support/
lib.rs
