TSS Actions on Hash Failure
When the TSS encounters a failed hash, it begins a traversal of the database to determine the failed TFNs. Rather than traversing tens of millions of TFNs linearly, a more efficient algorithm is employed, where the TSS requests hashes of more specific, partial, TFNs. For example, the TSS can request the hash of a partialTfn of “80”, “81”, ... “89” to help narrow down its search. The TFT Router does not have to determine where the failure occurs, that is the responsibility of the TSS. The TFT Router only needs to be prepared to respond with any partialTfn requested by the TSS (i.e. the partialTfn could have any length from 1 to 10 printable digits).