Recursion algorithm for processing layered Endorsements

[nedmsmith]

Conditional endorsements can be written such that the processing of Endorsement A depends on the acceptance of Endorsement B into the ACS. If A is processed before B, then the conditions in A will not be met.

A recursive algorithm may address this problem. If A is processed before B and A isn't accepted into the ACS, then B is processed. Once B completes, A resumes. This time it completes.

There may be other ways to solve this problem. The spec needs to describe at least one viable strategy to both document the potential for inconsistent results, but also to show a viable solution.

This probably belongs in "Ordering of Triple Processing" section (wherever it gets moved to).