ceremonyclient/bedlam/circuit/computer.go
Cassandra Heart e51992f3e8
OT
2025-03-23 21:11:16 -05:00

92 lines
1.6 KiB
Go

//
// Copyright (c) 2020-2023 Markku Rossi
//
// All rights reserved.
//
package circuit
import (
"fmt"
"math/big"
)
// Compute evaluates the circuit with the given input values.
func (c *Circuit) Compute(inputs []*big.Int) ([]*big.Int, error) {
// Flatten circuit arguments.
var args IO
for _, io := range c.Inputs {
if len(io.Compound) > 0 {
args = append(args, io.Compound...)
} else {
args = append(args, io)
}
}
if len(inputs) != len(args) {
return nil, fmt.Errorf("invalid inputs: got %d, expected %d",
len(inputs), len(args))
}
// Flatten inputs and arguments.
wires := make([]byte, c.NumWires)
var w int
for idx, io := range args {
for bit := 0; bit < int(io.Type.Bits); bit++ {
wires[w] = byte(inputs[idx].Bit(bit))
w++
}
}
// Evaluate circuit.
for _, gate := range c.Gates {
var result byte
switch gate.Op {
case XOR:
result = wires[gate.Input0] ^ wires[gate.Input1]
case XNOR:
if wires[gate.Input0]^wires[gate.Input1] == 0 {
result = 1
} else {
result = 0
}
case AND:
result = wires[gate.Input0] & wires[gate.Input1]
case OR:
result = wires[gate.Input0] | wires[gate.Input1]
case INV:
if wires[gate.Input0] == 0 {
result = 1
} else {
result = 0
}
default:
return nil, fmt.Errorf("invalid gate %s", gate.Op)
}
wires[gate.Output] = result
}
// Construct outputs
w = c.NumWires - c.Outputs.Size()
var result []*big.Int
for _, io := range c.Outputs {
r := new(big.Int)
for bit := 0; bit < int(io.Type.Bits); bit++ {
if wires[w] != 0 {
r.SetBit(r, bit, 1)
}
w++
}
result = append(result, r)
}
return result, nil
}