1package plonky2_verifier
 2
 3import (
 4	"fmt"
 5	. "gnark-plonky2-verifier/field"
 6	"regexp"
 7	"strconv"
 8)
 9
10var mulExtensionGateRegex = regexp.MustCompile("MulExtensionGate { num_ops: (?P<numOps>[0-9]+) }")
11
12func deserializeMulExtensionGate(parameters map[string]string) gate {
13	// Has the format "MulExtensionGate { num_ops: 13 }"
14	numOps, hasNumOps := parameters["numOps"]
15	if !hasNumOps {
16		panic("Missing field num_ops in MulExtensionGate")
17	}
18
19	numOpsInt, err := strconv.Atoi(numOps)
20	if err != nil {
21		panic("Invalid num_ops field in MulExtensionGate")
22	}
23
24	return NewMultiplicationExtensionGate(uint64(numOpsInt))
25}
26
27type MultiplicationExtensionGate struct {
28	numOps uint64
29}
30
31func NewMultiplicationExtensionGate(numOps uint64) *MultiplicationExtensionGate {
32	return &MultiplicationExtensionGate{
33		numOps: numOps,
34	}
35}
36
37func (g *MultiplicationExtensionGate) Id() string {
38	return fmt.Sprintf("ArithmeticExtensionGate { num_ops: %d }", g.numOps)
39}
40
41func (g *MultiplicationExtensionGate) wiresIthMultiplicand0(i uint64) Range {
42	return Range{3 * D * i, 3*D*i + D}
43}
44
45func (g *MultiplicationExtensionGate) wiresIthMultiplicand1(i uint64) Range {
46	return Range{3*D*i + D, 3*D*i + 2*D}
47}
48
49func (g *MultiplicationExtensionGate) wiresIthOutput(i uint64) Range {
50	return Range{3*D*i + 2*D, 3*D*i + 3*D}
51}
52
53func (g *MultiplicationExtensionGate) EvalUnfiltered(p *PlonkChip, vars EvaluationVars) []QuadraticExtension {
54	const0 := vars.localConstants[0]
55
56	constraints := []QuadraticExtension{}
57	for i := uint64(0); i < g.numOps; i++ {
58		multiplicand0 := vars.GetLocalExtAlgebra(g.wiresIthMultiplicand0(i))
59		multiplicand1 := vars.GetLocalExtAlgebra(g.wiresIthMultiplicand1(i))
60		output := vars.GetLocalExtAlgebra(g.wiresIthOutput(i))
61
62		mul := p.qeAPI.MulExtensionAlgebra(multiplicand0, multiplicand1)
63		computed_output := p.qeAPI.ScalarMulExtensionAlgebra(const0, mul)
64
65		diff := p.qeAPI.SubExtensionAlgebra(output, computed_output)
66		for j := 0; j < D; j++ {
67			constraints = append(constraints, diff[j])
68		}
69	}
70
71	return constraints
72}