Theorem. Finite trace growth under recursive wrapping [ftip-00EN]
Theorem. Finite trace growth under recursive wrapping [ftip-00EN]
Suppose each wrapper emits one finite trace record per task and there are \(N\) tasks and depths \(2,\ldots ,d\). The audit log contains at most \(N(d-1)\) depth-tagged records, in addition to the base records. This is a counting fact; it says nothing about trace quality or score improvement.
Proof. There are \(d-1\) wrapped depths and \(N\) records at each depth, so the product counts all records.