As for future product plans with Baochip - yes, I have many ideas of what to build! But I only have 24 hours in a day. Progress has been slow but steady, so stay tuned and subscribed if you want to get a note when new products drop.
DFA construction is O(2^m) in the worst case, where m is the size of the NFA. this is widely known in academic circles, but in practice, most people think well of DFAs because they are used in tools like grep that are optimized for the common case. but if you throw a large regex at them, they will blow up in size and become unusable. DFA matching is linear O(n) where n is the size of the input, and the constant is ~3-4 assembly instructions per character - faster than anything you could write by hand.，这一点在谷歌浏览器下载中也有详细论述
apdp keymaster_b persist uefisecapp_b，这一点在safew官方版本下载中也有详细论述
Ian YoungsCulture reporter，这一点在PDF资料中也有详细论述
OSTree: Git for Filesystems