Skip to content

Commit 091eac3

Browse files
Merge pull request #1136 from cryspen/frontend-upgrades-hash-fixes
chore: update hardcodeded hashes following cryspen/hax#1559
2 parents 825f4a6 + d511871 commit 091eac3

File tree

4 files changed

+14
-14
lines changed

4 files changed

+14
-14
lines changed

Cargo.toml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -51,7 +51,7 @@ readme = "Readme.md"
5151
allow-branch = ["main"]
5252

5353
[workspace.dependencies]
54-
hax-lib = { version = "0.3.4" }
54+
hax-lib = { version = "0.3.5" }
5555

5656
[package]
5757
name = "libcrux"

libcrux-ml-dsa/src/arithmetic.rs

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@ use crate::{
99
#[hax_lib::requires(fstar!(r#"v $bound > 0 /\
1010
(forall i. forall j. Spec.Utils.is_i32b_array_opaque
1111
(v ${crate::simd::traits::specs::FIELD_MAX})
12-
(i0._super_4202118595671791609.f_repr (Seq.index (Seq.index vector i).f_simd_units j)))"#))]
12+
(i0._super_4731626403787200903.f_repr (Seq.index (Seq.index vector i).f_simd_units j)))"#))]
1313
pub(crate) fn vector_infinity_norm_exceeds<SIMDUnit: Operations>(
1414
vector: &[PolynomialRingElement<SIMDUnit>],
1515
bound: i32,
@@ -25,8 +25,8 @@ pub(crate) fn vector_infinity_norm_exceeds<SIMDUnit: Operations>(
2525
#[hax_lib::fstar::before(r#"[@@ "opaque_to_smt"]"#)]
2626
#[hax_lib::requires(fstar!(r#"v $SHIFT_BY == 13 /\
2727
(forall i. forall j.
28-
v (Seq.index (i0._super_4202118595671791609.f_repr (Seq.index re.f_simd_units i)) j) >= 0 /\
29-
v (Seq.index (i0._super_4202118595671791609.f_repr (Seq.index re.f_simd_units i)) j) <= 261631)"#))]
28+
v (Seq.index (i0._super_4731626403787200903.f_repr (Seq.index re.f_simd_units i)) j) >= 0 /\
29+
v (Seq.index (i0._super_4731626403787200903.f_repr (Seq.index re.f_simd_units i)) j) <= 261631)"#))]
3030
pub(crate) fn shift_left_then_reduce<SIMDUnit: Operations, const SHIFT_BY: i32>(
3131
re: &mut PolynomialRingElement<SIMDUnit>,
3232
) {
@@ -49,7 +49,7 @@ pub(crate) fn shift_left_then_reduce<SIMDUnit: Operations, const SHIFT_BY: i32>(
4949
(forall i. forall j.
5050
Spec.Utils.is_i32b_array_opaque
5151
(v ${crate::simd::traits::specs::FIELD_MAX})
52-
(i0._super_4202118595671791609.f_repr (Seq.index (Seq.index t i).f_simd_units j)))"#))]
52+
(i0._super_4731626403787200903.f_repr (Seq.index (Seq.index t i).f_simd_units j)))"#))]
5353
pub(crate) fn power2round_vector<SIMDUnit: Operations>(
5454
t: &mut [PolynomialRingElement<SIMDUnit>],
5555
t1: &mut [PolynomialRingElement<SIMDUnit>],
@@ -100,7 +100,7 @@ pub(crate) fn power2round_vector<SIMDUnit: Operations>(
100100
(forall i. forall j.
101101
Spec.Utils.is_i32b_array_opaque
102102
(v ${crate::simd::traits::specs::FIELD_MAX})
103-
(i0._super_4202118595671791609.f_repr (Seq.index (Seq.index t i).f_simd_units j)))"#))]
103+
(i0._super_4731626403787200903.f_repr (Seq.index (Seq.index t i).f_simd_units j)))"#))]
104104
pub(crate) fn decompose_vector<SIMDUnit: Operations>(
105105
dimension: usize,
106106
gamma2: Gamma2,
@@ -176,7 +176,7 @@ pub(crate) fn make_hint<SIMDUnit: Operations>(
176176
(forall i. forall j.
177177
Spec.Utils.is_i32b_array_opaque
178178
(v ${crate::simd::traits::specs::FIELD_MAX})
179-
(i0._super_4202118595671791609.f_repr (Seq.index (Seq.index re_vector i).f_simd_units j)))"#))]
179+
(i0._super_4731626403787200903.f_repr (Seq.index (Seq.index re_vector i).f_simd_units j)))"#))]
180180
pub(crate) fn use_hint<SIMDUnit: Operations>(
181181
gamma2: Gamma2,
182182
hint: &[[i32; COEFFICIENTS_IN_RING_ELEMENT]],

libcrux-ml-dsa/src/polynomial.rs

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -52,7 +52,7 @@ impl<SIMDUnit: Operations> PolynomialRingElement<SIMDUnit> {
5252
#[hax_lib::requires(fstar!(r#"v $bound > 0 /\
5353
(forall i. Spec.Utils.is_i32b_array_opaque
5454
(v ${FIELD_MAX})
55-
(i0._super_4202118595671791609.f_repr (Seq.index self.f_simd_units i)))"#))]
55+
(i0._super_4731626403787200903.f_repr (Seq.index self.f_simd_units i)))"#))]
5656
pub(crate) fn infinity_norm_exceeds(&self, bound: i32) -> bool {
5757
let mut result = false;
5858
for i in 0..self.simd_units.len() {
@@ -64,8 +64,8 @@ impl<SIMDUnit: Operations> PolynomialRingElement<SIMDUnit> {
6464

6565
#[inline(always)]
6666
#[hax_lib::requires(fstar!(r#"forall i.
67-
add_pre (i0._super_4202118595671791609.f_repr (Seq.index self.f_simd_units i))
68-
(i0._super_4202118595671791609.f_repr (Seq.index rhs.f_simd_units i))"#))]
67+
add_pre (i0._super_4731626403787200903.f_repr (Seq.index self.f_simd_units i))
68+
(i0._super_4731626403787200903.f_repr (Seq.index rhs.f_simd_units i))"#))]
6969
pub(crate) fn add(&mut self, rhs: &Self) {
7070
#[cfg(hax)]
7171
let old_self = self.clone();
@@ -83,8 +83,8 @@ impl<SIMDUnit: Operations> PolynomialRingElement<SIMDUnit> {
8383

8484
#[inline(always)]
8585
#[hax_lib::requires(fstar!(r#"forall i.
86-
sub_pre (i0._super_4202118595671791609.f_repr (Seq.index self.f_simd_units i))
87-
(i0._super_4202118595671791609.f_repr (Seq.index rhs.f_simd_units i))"#))]
86+
sub_pre (i0._super_4731626403787200903.f_repr (Seq.index self.f_simd_units i))
87+
(i0._super_4731626403787200903.f_repr (Seq.index rhs.f_simd_units i))"#))]
8888
pub(crate) fn subtract(&mut self, rhs: &Self) {
8989
#[cfg(hax)]
9090
let old_self = self.clone();

libcrux-ml-kem/src/polynomial.rs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -34,7 +34,7 @@ pub(crate) const VECTORS_IN_RING_ELEMENT: usize = 16;
3434
{| i2: Libcrux_ml_kem.Vector.Traits.t_Operations v_Vector |}
3535
(p: t_PolynomialRingElement v_Vector) : Spec.MLKEM.polynomial =
3636
createi (sz 256) (fun i -> Spec.MLKEM.Math.to_spec_fe
37-
(Seq.index (i2._super_16084754032855797384.f_repr
37+
(Seq.index (i2._super_6081346371236564305.f_repr
3838
(Seq.index p.f_coefficients (v i / 16))) (v i % 16)))
3939
let to_spec_vector_t (#r:Spec.MLKEM.rank) (#v_Vector: Type0)
4040
{| i2: Libcrux_ml_kem.Vector.Traits.t_Operations v_Vector |}
@@ -186,7 +186,7 @@ fn add_to_ring_element<Vector: Operations, const K: usize>(
186186
let _myself = myself.coefficients;
187187
hax_lib::fstar!(
188188
r#"assert(forall (v: v_Vector).
189-
i0.f_to_i16_array v == i0._super_16084754032855797384.f_repr v)"#
189+
i0.f_to_i16_array v == i0._super_6081346371236564305.f_repr v)"#
190190
);
191191

192192
for i in 0..myself.coefficients.len() {

0 commit comments

Comments
 (0)