String searching o_n

O(n) in time, O(1) in space substr-search algorithm, using O(1)-updatable hash derived using Group Theory. Hash function is greyed out, to prevent IP-theft. Algorithm is far simpler than trie or Knuth-Morris-Pratt. Very surprised it has not been discovered by others.