Negotiated Realization

Abstract Authorized realization is not always a single act. Candidate channels may be acquired sequentially under portfolio restrictions, and different lawful acquisition orders may expose different information or produce different supported verdicts. This paper develops a finite dynamics of realization over the static attainable-resolution framework. An acquisition run consists only of productive machine acquisitions. It terminates either with the original demand realized or with a typed stall and a computed least supported narrowing; adoption and refusal remain downstream owner decisions. Under restricted permissions, lawful runs can end with incomparable offers, and one route may realize a demand that another route cannot. Under unrestricted permission, however, every maximal acquisition run has the same terminal demand label, given in closed form by the join of the demanded-verdict kernel with the full-pool kernel. This demand confluence does not imply revelation confluence: two runs can support the same verdict while acquiring different portfolios and revealing different distinctions. More generally, the terminal demand label is a function of the terminal revelation label, so revelation confluence implies demand confluence, while the converse fails. For a declared revelation-audit demand, the paper computes the exact target-relative confluence gap and the coarsest history record sufficient to preserve both verdict and audit. This identifies which path distinctions provenance must retain without imposing universal retention. Results are proved for finite static acquisition systems and machine-mirrored by a 35-check battery.