argumentcomputer
diff --git a/‎.github/workflows/benchmark.yml‎
Lines changed: 0 additions & 74 deletions b/‎.github/workflows/benchmark.yml‎
Lines changed: 0 additions & 74 deletions
diff --git a/‎.github/workflows/mirror.yml‎
Lines changed: 0 additions & 26 deletions b/‎.github/workflows/mirror.yml‎
Lines changed: 0 additions & 26 deletions
diff --git a/‎crates/circuits/src/vision.rs‎
Lines changed: 2 additions & 3 deletions b/‎crates/circuits/src/vision.rs‎
Lines changed: 2 additions & 3 deletions
diff --git a/‎crates/core/src/protocols/sumcheck/prove/regular_sumcheck.rs‎
Lines changed: 0 additions & 1 deletion b/‎crates/core/src/protocols/sumcheck/prove/regular_sumcheck.rs‎
Lines changed: 0 additions & 1 deletion
diff --git a/‎examples/Cargo.toml‎
Lines changed: 7 additions & 3 deletions b/‎examples/Cargo.toml‎
Lines changed: 7 additions & 3 deletions
diff --git a/‎examples/acc-constants.rs‎
Lines changed: 5 additions & 7 deletions b/‎examples/acc-constants.rs‎
Lines changed: 5 additions & 7 deletions
diff --git a/‎examples/acc-disjoint-product.rs‎
Lines changed: 2 additions & 6 deletions b/‎examples/acc-disjoint-product.rs‎
Lines changed: 2 additions & 6 deletions
diff --git a/‎examples/acc-eq-ind-partial-eval.rs‎
Lines changed: 4 additions & 4 deletions b/‎examples/acc-eq-ind-partial-eval.rs‎
Lines changed: 4 additions & 4 deletions
diff --git a/‎…es/acc-linear-combination-with-offset.rs‎ ‎…near-combination-with-offset.rs.disabled‎examples/acc-linear-combination-with-offset.rs renamed to examples/acc-linear-combination-with-offset.rs.disabled b/‎…es/acc-linear-combination-with-offset.rs‎ ‎…near-combination-with-offset.rs.disabled‎examples/acc-linear-combination-with-offset.rs renamed to examples/acc-linear-combination-with-offset.rs.disabled
diff --git a/‎examples/acc-linear-combination.rs‎
Lines changed: 5 additions & 8 deletions b/‎examples/acc-linear-combination.rs‎
Lines changed: 5 additions & 8 deletions
@@ -13,9 +13,8 @@ use anyhow::Result;
 use binius_core::{oracle::OracleId, transparent::constant::Constant};
 use binius_field::{
 	linear_transformation::Transformation, make_aes_to_binary_packed_transformer,
-	packed::get_packed_slice, AESTowerField32b, BinaryField1b, BinaryField32b, ExtensionField,
-	Field, PackedAESBinaryField8x32b, PackedBinaryField8x32b, PackedExtension, PackedField,
-	TowerField,
+	packed::get_packed_slice, BinaryField1b, BinaryField32b, ExtensionField, Field,
+	PackedAESBinaryField8x32b, PackedBinaryField8x32b, PackedExtension, PackedField, TowerField,
 };
 use binius_hash::{Vision32MDSTransform, INV_PACKED_TRANS_AES};
 use binius_macros::arith_expr;
 
@@ -142,7 +142,6 @@ where
 			.collect();
 
 		let nontrivial_evaluation_points = get_nontrivial_evaluation_points(&domains)?;
-
 		let state = ProverState::new(
 			evaluation_order,
 			multilinears,
 
@@ -81,9 +81,9 @@ path = "blake3_circuit.rs"
 name = "acc-linear-combination"
 path = "acc-linear-combination.rs"
 
-[[example]]
-name = "acc-linear-combination-with-offset"
-path = "acc-linear-combination-with-offset.rs"
+#[[example]]
+#name = "acc-linear-combination-with-offset"
+#path = "acc-linear-combination-with-offset.rs"
 
 [[example]]
 name = "acc-shifted"
@@ -145,6 +145,10 @@ path = "acc-step-up.rs"
 name = "acc-tower-basis"
 path = "acc-tower-basis.rs"
 
+[[example]]
+name = "acc-permutation-channels"
+path = "acc-permutation-channels.rs"
+
 [lints.clippy]
 needless_range_loop = "allow"
 
 
@@ -1,12 +1,9 @@
-use binius_circuits::{builder::ConstraintSystemBuilder, sha256::u32const_repeating};
+use binius_circuits::{arithmetic::u32::u32const_repeating, builder::ConstraintSystemBuilder};
 use binius_core::{
 	constraint_system::validate::validate_witness, oracle::OracleId,
 	transparent::constant::Constant,
 };
-use binius_field::{arch::OptimalUnderlier, BinaryField128b, BinaryField1b, BinaryField32b};
-
-type U = OptimalUnderlier;
-type F128 = BinaryField128b;
+use binius_field::{BinaryField1b, BinaryField32b};
 type F32 = BinaryField32b;
 type F1 = BinaryField1b;
 
@@ -17,7 +14,7 @@ const LOG_SIZE: usize = 4;
 fn constants_gadget(
 	name: impl ToString,
 	log_size: usize,
-	builder: &mut ConstraintSystemBuilder<U, F128>,
+	builder: &mut ConstraintSystemBuilder,
 	constant_value: u32,
 ) -> OracleId {
 	builder.push_namespace(name);
@@ -45,7 +42,8 @@ fn constants_gadget(
 // Transparent column.
 fn main() {
 	let allocator = bumpalo::Bump::new();
-	let mut builder = ConstraintSystemBuilder::<U, F128>::new_with_witness(&allocator);
+
+	let mut builder = ConstraintSystemBuilder::new_with_witness(&allocator);
 
 	pub const SHA256_INIT: [u32; 8] = [
 		0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab,
 
@@ -3,12 +3,8 @@ use binius_core::{
 	constraint_system::validate::validate_witness,
 	transparent::{constant::Constant, disjoint_product::DisjointProduct, powers::Powers},
 };
-use binius_field::{
-	arch::OptimalUnderlier, BinaryField, BinaryField128b, BinaryField8b, PackedField,
-};
+use binius_field::{BinaryField, BinaryField8b, PackedField};
 
-type U = OptimalUnderlier;
-type F128 = BinaryField128b;
 type F8 = BinaryField8b;
 
 const LOG_SIZE: usize = 4;
@@ -29,7 +25,7 @@ const LOG_SIZE: usize = 4;
 // of heights (n_vars) of Powers and Constant, so actual data could be repeated multiple times
 fn main() {
 	let allocator = bumpalo::Bump::new();
-	let mut builder = ConstraintSystemBuilder::<U, F128>::new_with_witness(&allocator);
+	let mut builder = ConstraintSystemBuilder::new_with_witness(&allocator);
 
 	let generator = F8::MULTIPLICATIVE_GENERATOR;
 	let powers = Powers::new(LOG_SIZE, generator.into());
 
@@ -2,9 +2,8 @@ use binius_circuits::builder::ConstraintSystemBuilder;
 use binius_core::{
 	constraint_system::validate::validate_witness, transparent::eq_ind::EqIndPartialEval,
 };
-use binius_field::{arch::OptimalUnderlier, BinaryField128b, PackedField};
+use binius_field::{BinaryField128b, PackedField};
 
-type U = OptimalUnderlier;
 type F128 = BinaryField128b;
 
 const LOG_SIZE: usize = 3;
@@ -21,7 +20,8 @@ const LOG_SIZE: usize = 3;
 //
 fn main() {
 	let allocator = bumpalo::Bump::new();
-	let mut builder = ConstraintSystemBuilder::<U, F128>::new_with_witness(&allocator);
+
+	let mut builder = ConstraintSystemBuilder::new_with_witness(&allocator);
 
 	// A truth table [000, 001, 010, 011 ... 111] where each row is in reversed order
 	let rev_basis = [
@@ -44,7 +44,7 @@ fn main() {
 	// challenges size correlates with LOG_SIZE
 	assert_eq!(challenges.len(), LOG_SIZE);
 
-	let eq_ind_partial_eval = EqIndPartialEval::new(LOG_SIZE, challenges.clone()).unwrap();
+	let eq_ind_partial_eval = EqIndPartialEval::new(challenges.clone());
 
 	let id = builder
 		.add_transparent("eq_ind_partial_eval", eq_ind_partial_eval)
 
@@ -1,20 +1,17 @@
 use binius_circuits::{builder::ConstraintSystemBuilder, unconstrained::unconstrained};
 use binius_core::{constraint_system::validate::validate_witness, oracle::OracleId};
 use binius_field::{
-	arch::OptimalUnderlier, packed::set_packed_slice, BinaryField128b, BinaryField1b,
-	BinaryField8b, ExtensionField, TowerField,
+	packed::set_packed_slice, BinaryField1b, BinaryField8b, ExtensionField, TowerField,
 };
 use binius_macros::arith_expr;
 
-type U = OptimalUnderlier;
-type F128 = BinaryField128b;
 type F8 = BinaryField8b;
 type F1 = BinaryField1b;
 
 // FIXME: Following gadgets are unconstrained. Only for demonstrative purpose, don't use in production
 
 fn bytes_decomposition_gadget(
-	builder: &mut ConstraintSystemBuilder<U, F128>,
+	builder: &mut ConstraintSystemBuilder,
 	name: impl ToString,
 	log_size: usize,
 	input: OracleId,
@@ -146,7 +143,7 @@ fn bytes_decomposition_gadget(
 }
 
 fn elder_4bits_masking_gadget(
-	builder: &mut ConstraintSystemBuilder<U, F128>,
+	builder: &mut ConstraintSystemBuilder,
 	name: impl ToString,
 	log_size: usize,
 	input: OracleId,
@@ -241,12 +238,12 @@ fn elder_4bits_masking_gadget(
 
 fn main() {
 	let allocator = bumpalo::Bump::new();
-	let mut builder = ConstraintSystemBuilder::<U, F128>::new_with_witness(&allocator);
+	let mut builder = ConstraintSystemBuilder::new_with_witness(&allocator);
 
 	let log_size = 1usize;
 
 	// Define set of bytes that we want to decompose
-	let p_in = unconstrained::<U, F128, F8>(&mut builder, "p_in".to_string(), log_size).unwrap();
+	let p_in = unconstrained::<F8>(&mut builder, "p_in".to_string(), log_size).unwrap();
 
 	let _ =
 		bytes_decomposition_gadget(&mut builder, "bytes decomposition", log_size, p_in).unwrap();