Merge pull request #12 from reclaimprotocol/oprf

OPRF support

Author: adiwajshing

.github/workflows/test.yaml

@@ -20,7 +20,7 @@ jobs:
         uses: actions/checkout@v4
 
       - name: Setup Node.js
-        uses: actions/setup-node@v3
+        uses: actions/setup-node@v4
         with:
           node-version: ${{ matrix.node-version }}
 
@@ -51,7 +51,7 @@ jobs:
         uses: actions/checkout@v4
 
       - name: Setup Node.js
-        uses: actions/setup-node@v3
+        uses: actions/setup-node@v4
         with:
           node-version: ${{ matrix.node-version }}
 
@@ -75,16 +75,18 @@ jobs:
     runs-on: ubuntu-latest
     strategy:
       matrix:
-        go-version: [1.23] # Specify the Go versions you want to test with
+        go-version: ['stable'] # Specify the Go versions you want to test with
 
     steps:
       - name: Checkout code
-        uses: actions/checkout@v3
+        uses: actions/checkout@v4
 
       - name: Setup Go
-        uses: actions/setup-go@v4
+        uses: actions/setup-go@v5
         with:
           go-version: ${{ matrix.go-version }}
+          check-latest: true
+          cache-dependency-path: "**/go.sum"
 
       - name: Install dependencies
         working-directory: ./gnark

bin/gnark/darwin-arm64-libprove.so

@@ -51,12 +51,24 @@ template ChaCha20(N, BITS_PER_WORD) {
 		counter,
 		nonce[0], nonce[1], nonce[2]
 	];
+
+	// 1 in 32-bit words
+	signal one[BITS_PER_WORD];
+	one <== [
+		0, 0, 0, 0, 0, 0, 0, 0,
+		0, 0, 0, 0, 0, 0, 0, 0,
+		0, 0, 0, 0, 0, 0, 0, 0,
+		0, 0, 0, 0, 0, 0, 0, 1
+	];
+
 	var i = 0;
 	var j = 0;
 
 	// do the ChaCha20 rounds
 	component rounds[N/16];
 	component xors[N];
+	component counter_adder[N/16 - 1];
+
 	for(i = 0; i < N/16; i++) {
 		rounds[i] = Round(BITS_PER_WORD);
 		rounds[i].in <== tmp;
@@ -67,9 +79,14 @@ template ChaCha20(N, BITS_PER_WORD) {
 			xors[i*16 + j].b <== rounds[i].out[j];
 			out[i*16 + j] <== xors[i*16 + j].out;
 		}
-		// increment the counter
-		// TODO: we only use one block
-		// at a time, so isn't required
-		// tmp[12] = tmp[12] + 1;
+
+		if(i < N/16 - 1) {
+			counter_adder[i] = AddBits(BITS_PER_WORD);
+			counter_adder[i].a <== tmp[12];
+			counter_adder[i].b <== one;
+
+			// increment the counter
+			tmp[12] = counter_adder[i].out;
+		}
 	}
 }

bin/gnark/darwin-arm64-libverify.so

@@ -2,4 +2,4 @@ pragma circom 2.0.0;
 
 include "./chacha20-bits.circom";
 
-component main{public [in, nonce, counter]} = ChaCha20(16, 32);
+component main{public [in, nonce, counter]} = ChaCha20(32, 32);

bin/gnark/linux-arm64-libprove.so

@@ -0,0 +1,5 @@
+pragma circom 2.0.0;
+
+include "../chacha20/chacha20-bits.circom";
+
+component main = ChaCha20(32, 32);