@@ -1820,8 +1820,8 @@ pub fn expand_deferred(params: ExpandDeferredParams) -> DeferredValues<Fp> {
18201820
18211821 let plonk0 = & proof_state. deferred_values . plonk ;
18221822
1823- let zeta = ScalarChallenge :: from ( plonk0. zeta_bytes ) . to_field ( & endo ) ;
1824- let alpha = ScalarChallenge :: from ( plonk0. alpha_bytes ) . to_field ( & endo ) ;
1823+ let zeta = ScalarChallenge :: limbs_to_field ( & plonk0. zeta_bytes ) ;
1824+ let alpha = ScalarChallenge :: limbs_to_field ( & plonk0. alpha_bytes ) ;
18251825 let step_domain: u8 = proof_state. deferred_values . branch_data . domain_log2 . as_u8 ( ) ;
18261826 let domain: Radix2EvaluationDomain < Fp > =
18271827 Radix2EvaluationDomain :: new ( 1 << step_domain as u64 ) . unwrap ( ) ;
@@ -1877,7 +1877,7 @@ pub fn expand_deferred(params: ExpandDeferredParams) -> DeferredValues<Fp> {
18771877
18781878 let old_bulletproof_challenges: Vec < _ > = old_bulletproof_challenges
18791879 . iter ( )
1880- . map ( |v| std :: array :: from_fn ( |i| ScalarChallenge :: from ( v [ i ] ) . to_field ( & endo ) ) )
1880+ . map ( ScalarChallenge :: array_to_fields )
18811881 . collect ( ) ;
18821882
18831883 let challenges_digest = {
@@ -1926,7 +1926,7 @@ pub fn expand_deferred(params: ExpandDeferredParams) -> DeferredValues<Fp> {
19261926 . deferred_values
19271927 . bulletproof_challenges
19281928 . iter ( )
1929- . map ( |v| ScalarChallenge :: from ( * v ) . to_field ( & endo ) )
1929+ . map ( ScalarChallenge :: limbs_to_field )
19301930 . collect ( ) ;
19311931
19321932 let b_actual = {
@@ -1950,11 +1950,9 @@ pub fn expand_deferred(params: ExpandDeferredParams) -> DeferredValues<Fp> {
19501950fn wrap_compute_sg ( challenges : & [ [ u64 ; 2 ] ] ) -> GroupAffine < Fp > {
19511951 use super :: public_input:: scalar_challenge:: ScalarChallenge ;
19521952
1953- let ( _, endo) = endos :: < Fp > ( ) ;
1954-
19551953 let challenges = challenges
19561954 . iter ( )
1957- . map ( |c| ScalarChallenge :: from ( * c ) . to_field ( & endo ) )
1955+ . map ( ScalarChallenge :: limbs_to_field )
19581956 . collect :: < Vec < _ > > ( ) ;
19591957
19601958 let coeffs = b_poly_coefficients ( & challenges) ;
@@ -2004,9 +2002,8 @@ fn expand_proof(params: ExpandProofParams) -> ExpandedProof {
20042002 . domain_log2
20052003 . as_u8 ( ) ;
20062004
2007- let ( _, endo) = endos :: < Fq > ( ) ;
2008- let alpha = ScalarChallenge :: from ( plonk0. alpha_bytes ) . to_field ( & endo) ;
2009- let zeta = ScalarChallenge :: from ( plonk0. zeta_bytes ) . to_field ( & endo) ;
2005+ let alpha = ScalarChallenge :: limbs_to_field ( & plonk0. alpha_bytes ) ;
2006+ let zeta = ScalarChallenge :: limbs_to_field ( & plonk0. zeta_bytes ) ;
20102007 // let w: Fp = Radix2EvaluationDomain::new(1 << dlog_vk.domain.log_size_of_group)
20112008 let w: Fp = Radix2EvaluationDomain :: new ( 1 << domain) . unwrap ( ) . group_gen ;
20122009 let zetaw = zeta * w;
@@ -2037,19 +2034,14 @@ fn expand_proof(params: ExpandProofParams) -> ExpandedProof {
20372034 let statement = & t. statement ;
20382035
20392036 let prev_challenges: Vec < [ Fq ; BACKEND_TOCK_ROUNDS_N ] > = {
2040- let ( _, endo) = endos :: < Fp > ( ) ;
2041-
20422037 let old_bulletproof_challenges = & statement
20432038 . proof_state
20442039 . messages_for_next_wrap_proof
20452040 . old_bulletproof_challenges ;
2046- extract_bulletproof (
2047- & [
2048- old_bulletproof_challenges. 0 [ 0 ] . 0 . clone ( ) ,
2049- old_bulletproof_challenges. 0 [ 1 ] . 0 . clone ( ) ,
2050- ] ,
2051- & endo,
2052- )
2041+ extract_bulletproof ( & [
2042+ old_bulletproof_challenges. 0 [ 0 ] . 0 . clone ( ) ,
2043+ old_bulletproof_challenges. 0 [ 1 ] . 0 . clone ( ) ,
2044+ ] )
20532045 } ;
20542046
20552047 let old_bulletproof_challenges: Vec < [ Fp ; 16 ] > = statement
@@ -2073,10 +2065,9 @@ fn expand_proof(params: ExpandProofParams) -> ExpandedProof {
20732065 } )
20742066 } ;
20752067
2076- let ( _, endo) = endos :: < Fq > ( ) ;
20772068 let old_bulletproof_challenges: Vec < _ > = old_bulletproof_challenges
20782069 . iter ( )
2079- . map ( |v| std :: array :: from_fn ( |i| ScalarChallenge :: from ( v [ i ] ) . to_field ( & endo ) ) )
2070+ . map ( ScalarChallenge :: array_to_fields )
20802071 . collect ( ) ;
20812072
20822073 let messages_for_next_step_proof = MessagesForNextStepProof {
@@ -2486,8 +2477,6 @@ pub fn extract_recursion_challenges<const N: usize>(
24862477) -> Vec < RecursionChallenge < GroupAffine < Fq > > > {
24872478 use poly_commitment:: PolyComm ;
24882479
2489- let ( _, endo) = endos :: < Fq > ( ) ;
2490-
24912480 let comms: [ ( Fq , Fq ) ; N ] = std:: array:: from_fn ( |i| {
24922481 let p = & proofs[ i] ;
24932482 let ( a, b) = & p
@@ -2508,7 +2497,7 @@ pub fn extract_recursion_challenges<const N: usize>(
25082497 . clone ( )
25092498 } )
25102499 . collect :: < Vec < _ > > ( ) ;
2511- let challs = extract_bulletproof ( & challs, & endo ) ;
2500+ let challs = extract_bulletproof ( & challs) ;
25122501
25132502 challs
25142503 . into_iter ( )
0 commit comments