constraints/miden-vm/bitwise.air

@@ -6,8 +6,7 @@ ev check_binary(main: [a]):
 
 # Returns value aggregated from limbs
 fn aggregate(limb: vector[4]) -> scalar:
-    let result = sum([2^i * a for (i, a) in (0..4, limb)])
-    result
+    return sum([2^i * a for (i, a) in (0..4, limb)])
 
 
 public_inputs:
@@ -32,18 +31,16 @@ integrity_constraints:
     enf s' = s when k1
 
     # Enforce that the input is decomposed into valid bits
-    enf check_binary([a_limb[i]]) for i in 0..4
-    enf check_binary([b_limb[i]]) for i in 0..4  
+    enf check_binary([a]) for a in a_limb
+    enf check_binary([b]) for b in b_limb 
 
     # Enforce that the value in the first row of column `a` of the current 8-row cycle should be 
     # the aggregation of the decomposed bit columns `a_limb`.
-    let a_aggr = aggregate([a_limb])
-    enf a = a_aggr when k0
+    enf a = aggregate([a_limb]) when k0
 
     # Enforce that the value in the first row of column `b` of the current 8-row cycle should be 
     # the aggregation of the decomposed bit columns `b_limb`.
-    let b_aggr = aggregate([b_limb])
-    enf b = b_aggr when k0
+    enf b = aggregate([b_limb]) when k0
 
     # Enforce that for all rows in an 8-row cycle, except for the last one, the values in a and b
     # columns are increased by the values contained in the individual bit columns a_limb and