Skip to content

Latest commit

 

History

History
24 lines (14 loc) · 693 Bytes

README.md

File metadata and controls

24 lines (14 loc) · 693 Bytes

[DEPRECATED] See https://github.com/JernKunpittaya/full_zk_regex instead

A repo to create circom circuit for zk regex

zk_regex_submatch

Working on explore.js file

Given DFA and state transition, reveal a corresponding state transitions that belong to each group

Previous regex reveals just characters that make it land in a certain state i, now we will reveal a character that makes state transition from state i to state j

Simple version first! assume text is already satisfied DFA

Todo:

  • Then, just edit it to run check first and && them.
  • Cli

Caution:

  • Edge can go back to start node!
  • N-1 is not necessarily accepted states
  • Not cover the case where first integer matches