Proof of Edit Distance
Edit distances are a class of algorithms that score how close two strings are to each other. For instance the an Edit Distance for “ETH” and “ETC” is “0.8222” where two identical strings would score a “1”. There are many algorithms also in the string similarity space including the Levenshtein Distance, Smith-Waterman Gotoh Distance, and the Ratcliff-Obershelp Distance.
Miners compete to find a string that when hashed in a normalization process is above a minimum distance threshold. This string could then be the hash of an intermediary-blockchain and the header hash for the next block.
Let Minimum Distance Threshold by “t”, String to find “B”, and Edit Distance Function “ED”. Such that for each blockchain header hash “h” satisfies:
ED( H(h), H(B) ) < t
Or in the case of merging two blockchains:
ED(H(h1),H(B)) < t && ED(H(h2),H(B)) < t === true
To find the new block in an intermediary-blockchain, the miner would iterate through a random charset or number, hashing strings until it finds a hash that is above the threshold for all of the blocks.
Proof of Edit Distance is mining algorithm agnostic.
Any hash or string structure can be provided as an input which means that as long as the blockchain has unique hashes it can be easily added to the Proof of Edit challenge.