Skip to content

Commit

Permalink
fix: add required files
Browse files Browse the repository at this point in the history
  • Loading branch information
@Bisht13
Bisht13 committed Jun 8, 2024
1 parent d71f435 commit 0a799e1
Show file tree
Hide file tree
Showing 29 changed files with 6,672 additions and 15 deletions.
4,369 changes: 4,369 additions & 0 deletions Cargo.lock
View file

Large diffs are not rendered by default.

12 changes: 12 additions & 0 deletions regexes/invitation_code.json
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
{
"parts": [
{
"is_public": false,
"regex_def": "( )?(c|C)ode( )?"
},
{
"is_public": true,
"regex_def": "(0|1|2|3|4|5|6|7|8|9|a|b|c|d|e|f)+"
}
]
}
185 changes: 185 additions & 0 deletions regexes/invitation_code_regex.circom
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,185 @@
pragma circom 2.1.5;

include "@zk-email/zk-regex-circom/circuits/regex_helpers.circom";

// regex: ( )?(c|C)ode( )?(0|1|2|3|4|5|6|7|8|9|a|b|c|d|e|f)+
template InvitationCodeRegex(msg_bytes) {
signal input msg[msg_bytes];
signal output out;

var num_bytes = msg_bytes+1;
signal in[num_bytes];
in[0]<==255;
for (var i = 0; i < msg_bytes; i++) {
in[i+1] <== msg[i];
}

component eq[19][num_bytes];
component and[10][num_bytes];
component multi_or[4][num_bytes];
signal states[num_bytes+1][8];
component state_changed[num_bytes];

states[0][0] <== 1;
for (var i = 1; i < 8; i++) {
states[0][i] <== 0;
}

for (var i = 0; i < num_bytes; i++) {
state_changed[i] = MultiOR(7);
eq[0][i] = IsEqual();
eq[0][i].in[0] <== in[i];
eq[0][i].in[1] <== 48;
eq[1][i] = IsEqual();
eq[1][i].in[0] <== in[i];
eq[1][i].in[1] <== 49;
eq[2][i] = IsEqual();
eq[2][i].in[0] <== in[i];
eq[2][i].in[1] <== 50;
eq[3][i] = IsEqual();
eq[3][i].in[0] <== in[i];
eq[3][i].in[1] <== 51;
eq[4][i] = IsEqual();
eq[4][i].in[0] <== in[i];
eq[4][i].in[1] <== 52;
eq[5][i] = IsEqual();
eq[5][i].in[0] <== in[i];
eq[5][i].in[1] <== 53;
eq[6][i] = IsEqual();
eq[6][i].in[0] <== in[i];
eq[6][i].in[1] <== 54;
eq[7][i] = IsEqual();
eq[7][i].in[0] <== in[i];
eq[7][i].in[1] <== 55;
eq[8][i] = IsEqual();
eq[8][i].in[0] <== in[i];
eq[8][i].in[1] <== 56;
eq[9][i] = IsEqual();
eq[9][i].in[0] <== in[i];
eq[9][i].in[1] <== 57;
eq[10][i] = IsEqual();
eq[10][i].in[0] <== in[i];
eq[10][i].in[1] <== 97;
eq[11][i] = IsEqual();
eq[11][i].in[0] <== in[i];
eq[11][i].in[1] <== 98;
eq[12][i] = IsEqual();
eq[12][i].in[0] <== in[i];
eq[12][i].in[1] <== 99;
eq[13][i] = IsEqual();
eq[13][i].in[0] <== in[i];
eq[13][i].in[1] <== 100;
eq[14][i] = IsEqual();
eq[14][i].in[0] <== in[i];
eq[14][i].in[1] <== 101;
eq[15][i] = IsEqual();
eq[15][i].in[0] <== in[i];
eq[15][i].in[1] <== 102;
and[0][i] = AND();
and[0][i].a <== states[i][1];
multi_or[0][i] = MultiOR(16);
multi_or[0][i].in[0] <== eq[0][i].out;
multi_or[0][i].in[1] <== eq[1][i].out;
multi_or[0][i].in[2] <== eq[2][i].out;
multi_or[0][i].in[3] <== eq[3][i].out;
multi_or[0][i].in[4] <== eq[4][i].out;
multi_or[0][i].in[5] <== eq[5][i].out;
multi_or[0][i].in[6] <== eq[6][i].out;
multi_or[0][i].in[7] <== eq[7][i].out;
multi_or[0][i].in[8] <== eq[8][i].out;
multi_or[0][i].in[9] <== eq[9][i].out;
multi_or[0][i].in[10] <== eq[10][i].out;
multi_or[0][i].in[11] <== eq[11][i].out;
multi_or[0][i].in[12] <== eq[12][i].out;
multi_or[0][i].in[13] <== eq[13][i].out;
multi_or[0][i].in[14] <== eq[14][i].out;
multi_or[0][i].in[15] <== eq[15][i].out;
and[0][i].b <== multi_or[0][i].out;
and[1][i] = AND();
and[1][i].a <== states[i][6];
and[1][i].b <== multi_or[0][i].out;
and[2][i] = AND();
and[2][i].a <== states[i][7];
and[2][i].b <== multi_or[0][i].out;
multi_or[1][i] = MultiOR(3);
multi_or[1][i].in[0] <== and[0][i].out;
multi_or[1][i].in[1] <== and[1][i].out;
multi_or[1][i].in[2] <== and[2][i].out;
states[i+1][1] <== multi_or[1][i].out;
state_changed[i].in[0] <== states[i+1][1];
eq[16][i] = IsEqual();
eq[16][i].in[0] <== in[i];
eq[16][i].in[1] <== 32;
and[3][i] = AND();
and[3][i].a <== states[i][0];
and[3][i].b <== eq[16][i].out;
states[i+1][2] <== and[3][i].out;
state_changed[i].in[1] <== states[i+1][2];
eq[17][i] = IsEqual();
eq[17][i].in[0] <== in[i];
eq[17][i].in[1] <== 67;
and[4][i] = AND();
and[4][i].a <== states[i][0];
multi_or[2][i] = MultiOR(2);
multi_or[2][i].in[0] <== eq[17][i].out;
multi_or[2][i].in[1] <== eq[12][i].out;
and[4][i].b <== multi_or[2][i].out;
and[5][i] = AND();
and[5][i].a <== states[i][2];
and[5][i].b <== multi_or[2][i].out;
multi_or[3][i] = MultiOR(2);
multi_or[3][i].in[0] <== and[4][i].out;
multi_or[3][i].in[1] <== and[5][i].out;
states[i+1][3] <== multi_or[3][i].out;
state_changed[i].in[2] <== states[i+1][3];
eq[18][i] = IsEqual();
eq[18][i].in[0] <== in[i];
eq[18][i].in[1] <== 111;
and[6][i] = AND();
and[6][i].a <== states[i][3];
and[6][i].b <== eq[18][i].out;
states[i+1][4] <== and[6][i].out;
state_changed[i].in[3] <== states[i+1][4];
and[7][i] = AND();
and[7][i].a <== states[i][4];
and[7][i].b <== eq[13][i].out;
states[i+1][5] <== and[7][i].out;
state_changed[i].in[4] <== states[i+1][5];
and[8][i] = AND();
and[8][i].a <== states[i][5];
and[8][i].b <== eq[14][i].out;
states[i+1][6] <== and[8][i].out;
state_changed[i].in[5] <== states[i+1][6];
and[9][i] = AND();
and[9][i].a <== states[i][6];
and[9][i].b <== eq[16][i].out;
states[i+1][7] <== and[9][i].out;
state_changed[i].in[6] <== states[i+1][7];
states[i+1][0] <== 1 - state_changed[i].out;
}

component final_state_result = MultiOR(num_bytes+1);
for (var i = 0; i <= num_bytes; i++) {
final_state_result.in[i] <== states[i][1];
}
out <== final_state_result.out;

signal is_consecutive[msg_bytes+1][2];
is_consecutive[msg_bytes][1] <== 1;
for (var i = 0; i < msg_bytes; i++) {
is_consecutive[msg_bytes-1-i][0] <== states[num_bytes-i][1] * (1 - is_consecutive[msg_bytes-i][1]) + is_consecutive[msg_bytes-i][1];
is_consecutive[msg_bytes-1-i][1] <== state_changed[msg_bytes-i].out * is_consecutive[msg_bytes-1-i][0];
}
signal is_substr0[msg_bytes][4];
signal is_reveal0[msg_bytes];
signal output reveal0[msg_bytes];
for (var i = 0; i < msg_bytes; i++) {
is_substr0[i][0] <== 0;
// the 0-th substring transitions: [(1, 1), (6, 1), (7, 1)]
is_substr0[i][1] <== is_substr0[i][0] + states[i+1][1] * states[i+2][1];
is_substr0[i][2] <== is_substr0[i][1] + states[i+1][6] * states[i+2][1];
is_substr0[i][3] <== is_substr0[i][2] + states[i+1][7] * states[i+2][1];
is_reveal0[i] <== is_substr0[i][3] * is_consecutive[i][1];
reveal0[i] <== in[i+1] * is_reveal0[i];
}
}
8 changes: 8 additions & 0 deletions regexes/invitation_code_with_prefix.json
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
{
"parts": [
{
"is_public": true,
"regex_def": "( )?(c|C)ode( )?(0|1|2|3|4|5|6|7|8|9|a|b|c|d|e|f)+"
}
]
}
Loading

0 comments on commit 0a799e1

Please sign in to comment.