Fastest Prefix Search and Regex search in Lex Order

Hi! According to my benchmark tests I've just built the fastest free-text search engine in the world [0]. However, providing proof of that as well as making people care has proven to be a near impossible task. I could use some help from fellow programmers to both work on the formal proof but also to test this code against the Big5's offerings of full-text search. Would you care to go fetch an amount of common crawl data to test the abilities of ResinDB? If not, then do you perhaps have another strategy to convince people when you have invented something big? Is writing papers and formally…

A full-text, horse-speed search engine library in Rust