binius_core/transparent/
step_up.rs

1// Copyright 2024-2025 Irreducible Inc.
2
3use binius_field::{BinaryField128b, Field, PackedField};
4use binius_macros::{DeserializeBytes, SerializeBytes, erased_serialize_bytes};
5use binius_math::MultilinearExtension;
6use binius_utils::{DeserializeBytes, bail};
7
8use crate::polynomial::{Error, MultivariatePoly};
9
10/// Represents a multilinear F2-polynomial whose evaluations over the hypercube are
11/// 0 until a specified index where they change to 1.
12///
13/// If the index is the length of the multilinear, then all coefficients are 0.
14///
15/// ```txt
16///     (1 << n_vars)
17/// <-------------------->
18/// 0,0 .. 0,0,1,1, .. 1,1
19///            ^
20///            index of first 1
21/// ```
22///
23/// This is useful for making constraints that are not enforced at the first rows of the trace
24#[derive(Debug, Clone, SerializeBytes, DeserializeBytes)]
25pub struct StepUp {
26	n_vars: usize,
27	index: usize,
28}
29
30inventory::submit! {
31	<dyn MultivariatePoly<BinaryField128b>>::register_deserializer(
32		"StepUp",
33		|buf, mode| Ok(Box::new(StepUp::deserialize(&mut *buf, mode)?))
34	)
35}
36
37impl StepUp {
38	pub fn new(n_vars: usize, index: usize) -> Result<Self, Error> {
39		if index > 1 << n_vars {
40			bail!(Error::ArgumentRangeError {
41				arg: "index".into(),
42				range: 0..(1 << n_vars) + 1,
43			})
44		}
45		Ok(Self { n_vars, index })
46	}
47
48	pub const fn n_vars(&self) -> usize {
49		self.n_vars
50	}
51
52	pub fn multilinear_extension<P: PackedField>(&self) -> Result<MultilinearExtension<P>, Error> {
53		let log_packed_length = self.n_vars.saturating_sub(P::LOG_WIDTH);
54		let mut data = vec![P::one(); 1 << log_packed_length];
55		self.populate(&mut data);
56		Ok(MultilinearExtension::new(self.n_vars, data)?)
57	}
58
59	pub fn populate<P: PackedField>(&self, data: &mut [P]) {
60		let packed_index = self.index / P::WIDTH;
61		data[..packed_index].fill(P::zero());
62		data[packed_index..].fill(P::one());
63		for i in 0..(self.index % P::WIDTH) {
64			data[packed_index].set(i, P::Scalar::ZERO);
65		}
66	}
67}
68
69#[erased_serialize_bytes]
70impl<F: Field> MultivariatePoly<F> for StepUp {
71	fn degree(&self) -> usize {
72		self.n_vars
73	}
74
75	fn n_vars(&self) -> usize {
76		self.n_vars
77	}
78
79	fn evaluate(&self, query: &[F]) -> Result<F, Error> {
80		let n_vars = MultivariatePoly::<F>::n_vars(self);
81		if query.len() != n_vars {
82			bail!(Error::IncorrectQuerySize {
83				expected: n_vars,
84				actual: query.len()
85			});
86		}
87		let mut k = self.index;
88
89		if k == 1 << n_vars {
90			return Ok(F::ZERO);
91		}
92
93		let mut result = F::ONE;
94		for q in query {
95			if k & 1 == 1 {
96				// interpolate a line that is 0 at 0 and `result` at 1, at the point q
97				result *= q;
98			} else {
99				// interpolate a line that is `result` at 0 and 1 at 1, and evaluate at q
100				result = result * (F::ONE - q) + q;
101			}
102			k >>= 1;
103		}
104
105		Ok(result)
106	}
107
108	fn binary_tower_level(&self) -> usize {
109		0
110	}
111}
112
113#[cfg(test)]
114mod tests {
115	use binius_field::{
116		BinaryField1b, PackedBinaryField128x1b, PackedBinaryField256x1b, PackedField,
117	};
118	use binius_utils::felts;
119
120	use super::StepUp;
121	use crate::polynomial::test_utils::{hypercube_evals_from_oracle, packed_slice};
122
123	#[test]
124	fn test_step_up_trace_without_packing_simple_cases() {
125		assert_eq!(stepup_evals::<BinaryField1b>(2, 0), felts!(BinaryField1b[1, 1, 1, 1]));
126		assert_eq!(stepup_evals::<BinaryField1b>(2, 1), felts!(BinaryField1b[0, 1, 1, 1]));
127		assert_eq!(stepup_evals::<BinaryField1b>(2, 2), felts!(BinaryField1b[0, 0, 1, 1]));
128		assert_eq!(stepup_evals::<BinaryField1b>(2, 3), felts!(BinaryField1b[0, 0, 0, 1]));
129		assert_eq!(stepup_evals::<BinaryField1b>(2, 4), felts!(BinaryField1b[0, 0, 0, 0]));
130		assert_eq!(
131			stepup_evals::<BinaryField1b>(3, 0),
132			felts!(BinaryField1b[1, 1, 1, 1, 1, 1, 1, 1])
133		);
134		assert_eq!(
135			stepup_evals::<BinaryField1b>(3, 1),
136			felts!(BinaryField1b[0, 1, 1, 1, 1, 1, 1, 1])
137		);
138		assert_eq!(
139			stepup_evals::<BinaryField1b>(3, 2),
140			felts!(BinaryField1b[0, 0, 1, 1, 1, 1, 1, 1])
141		);
142		assert_eq!(
143			stepup_evals::<BinaryField1b>(3, 3),
144			felts!(BinaryField1b[0, 0, 0, 1, 1, 1, 1, 1])
145		);
146		assert_eq!(
147			stepup_evals::<BinaryField1b>(3, 4),
148			felts!(BinaryField1b[0, 0, 0, 0, 1, 1, 1, 1])
149		);
150		assert_eq!(
151			stepup_evals::<BinaryField1b>(3, 5),
152			felts!(BinaryField1b[0, 0, 0, 0, 0, 1, 1, 1])
153		);
154		assert_eq!(
155			stepup_evals::<BinaryField1b>(3, 6),
156			felts!(BinaryField1b[0, 0, 0, 0, 0, 0, 1, 1])
157		);
158		assert_eq!(
159			stepup_evals::<BinaryField1b>(3, 7),
160			felts!(BinaryField1b[0, 0, 0, 0, 0, 0, 0, 1])
161		);
162		assert_eq!(
163			stepup_evals::<BinaryField1b>(3, 8),
164			felts!(BinaryField1b[0, 0, 0, 0, 0, 0, 0, 0])
165		);
166	}
167
168	#[test]
169	fn test_step_up_trace_without_packing() {
170		assert_eq!(
171			stepup_evals::<BinaryField1b>(9, 314),
172			packed_slice::<BinaryField1b>(&[(0..314, 0), (314..512, 1)])
173		);
174		assert_eq!(
175			stepup_evals::<BinaryField1b>(10, 555),
176			packed_slice::<BinaryField1b>(&[(0..555, 0), (555..1024, 1)])
177		);
178		assert_eq!(
179			stepup_evals::<BinaryField1b>(11, 0),
180			packed_slice::<BinaryField1b>(&[(0..2048, 1)])
181		);
182		assert_eq!(
183			stepup_evals::<BinaryField1b>(11, 1),
184			packed_slice::<BinaryField1b>(&[(0..1, 0), (1..2048, 1)])
185		);
186		assert_eq!(
187			stepup_evals::<BinaryField1b>(11, 2048),
188			packed_slice::<BinaryField1b>(&[(0..2048, 0)])
189		);
190	}
191
192	#[test]
193	fn test_step_up_trace_with_packing_128() {
194		assert_eq!(
195			stepup_evals::<PackedBinaryField128x1b>(9, 314),
196			packed_slice::<PackedBinaryField128x1b>(&[(0..314, 0), (314..512, 1)])
197		);
198		assert_eq!(
199			stepup_evals::<PackedBinaryField128x1b>(10, 555),
200			packed_slice::<PackedBinaryField128x1b>(&[(0..555, 0), (555..1024, 1)])
201		);
202		assert_eq!(
203			stepup_evals::<PackedBinaryField128x1b>(11, 0),
204			packed_slice::<PackedBinaryField128x1b>(&[(0..2048, 1)])
205		);
206		assert_eq!(
207			stepup_evals::<PackedBinaryField128x1b>(11, 1),
208			packed_slice::<PackedBinaryField128x1b>(&[(0..1, 0), (1..2048, 1)])
209		);
210		assert_eq!(
211			stepup_evals::<PackedBinaryField128x1b>(11, 2048),
212			packed_slice::<PackedBinaryField128x1b>(&[(0..2048, 0)])
213		);
214	}
215
216	#[test]
217	fn test_step_up_trace_with_packing_256() {
218		assert_eq!(
219			stepup_evals::<PackedBinaryField256x1b>(9, 314),
220			packed_slice::<PackedBinaryField256x1b>(&[(0..314, 0), (314..512, 1)])
221		);
222		assert_eq!(
223			stepup_evals::<PackedBinaryField256x1b>(10, 555),
224			packed_slice::<PackedBinaryField256x1b>(&[(0..555, 0), (555..1024, 1)])
225		);
226		assert_eq!(
227			stepup_evals::<PackedBinaryField256x1b>(11, 0),
228			packed_slice::<PackedBinaryField256x1b>(&[(0..2048, 1)])
229		);
230		assert_eq!(
231			stepup_evals::<PackedBinaryField256x1b>(11, 1),
232			packed_slice::<PackedBinaryField256x1b>(&[(0..1, 0), (1..2048, 1)])
233		);
234		assert_eq!(
235			stepup_evals::<PackedBinaryField256x1b>(11, 2048),
236			packed_slice::<PackedBinaryField256x1b>(&[(0..2048, 0)])
237		);
238	}
239
240	#[test]
241	fn test_consistency_between_multilinear_extension_and_multilinear_poly_oracle() {
242		for n_vars in 1..6 {
243			for index in 0..=(1 << n_vars) {
244				let step_up = StepUp::new(n_vars, index).unwrap();
245				assert_eq!(
246					hypercube_evals_from_oracle::<BinaryField1b>(&step_up),
247					step_up
248						.multilinear_extension::<BinaryField1b>()
249						.unwrap()
250						.evals()
251				);
252			}
253		}
254	}
255
256	fn stepup_evals<P>(n_vars: usize, index: usize) -> Vec<P>
257	where
258		P: PackedField<Scalar = BinaryField1b>,
259	{
260		StepUp::new(n_vars, index)
261			.unwrap()
262			.multilinear_extension::<P>()
263			.unwrap()
264			.evals()
265			.to_vec()
266	}
267}