mirror of
https://github.com/powdr-labs/powdr.git
synced 2026-04-20 03:03:25 -04:00
67 lines
1.8 KiB
Rust
67 lines
1.8 KiB
Rust
use std::convert::int;
|
|
use std::utils::cross_product;
|
|
use std::utils::unchanged_until;
|
|
|
|
// Binary for single bytes using an exhaustive table
|
|
machine ByteBinary with
|
|
latch: latch,
|
|
operation_id: operation_id
|
|
{
|
|
operation run<0> P_operation, P_A, P_B -> P_C;
|
|
|
|
col fixed latch = [1]*;
|
|
col fixed operation_id = [0]*;
|
|
|
|
let bit_counts = [256, 256, 3];
|
|
let min_degree = std::array::product(bit_counts);
|
|
std::check::assert(std::prover::degree() >= std::array::product(bit_counts), || "The binary machine needs at least 196608 rows to work.");
|
|
// TODO would be nice with destructuring assignment for arrays.
|
|
let inputs: (int -> int)[] = cross_product(bit_counts);
|
|
let a = inputs[0];
|
|
let b = inputs[1];
|
|
let op = inputs[2];
|
|
let P_A: col = a;
|
|
let P_B: col = b;
|
|
let P_operation: col = op;
|
|
col fixed P_C(i) {
|
|
match op(i) {
|
|
0 => a(i) & b(i),
|
|
1 => a(i) | b(i),
|
|
2 => a(i) ^ b(i),
|
|
}
|
|
};
|
|
}
|
|
|
|
machine Binary(byte_binary: ByteBinary) with
|
|
latch: latch,
|
|
operation_id: operation_id,
|
|
// Allow this machine to be connected via a permutation
|
|
call_selectors: sel,
|
|
{
|
|
operation and<0> A, B -> C;
|
|
|
|
operation or<1> A, B -> C;
|
|
|
|
operation xor<2> A, B -> C;
|
|
|
|
col witness operation_id;
|
|
unchanged_until(operation_id, latch);
|
|
|
|
col fixed latch(i) { if (i % 4) == 3 { 1 } else { 0 } };
|
|
col fixed FACTOR(i) { 1 << (((i + 1) % 4) * 8) };
|
|
|
|
col witness A_byte;
|
|
col witness B_byte;
|
|
col witness C_byte;
|
|
|
|
col witness A;
|
|
col witness B;
|
|
col witness C;
|
|
|
|
A' = A * (1 - latch) + A_byte * FACTOR;
|
|
B' = B * (1 - latch) + B_byte * FACTOR;
|
|
C' = C * (1 - latch) + C_byte * FACTOR;
|
|
|
|
link => C_byte = byte_binary.run(operation_id', A_byte, B_byte);
|
|
}
|