Inspecting compiled semantics
No matching nodes
Choose up to two semantic kinds. One reveals its real traffic; two compare only direct authored relationships.
Choose a kind to inspect its nodes and touching relationships.
Semantic radar needs more MAP space.
How does a clean check become something the runtime will load?
Between a check and a run there is a gap in which files can change and a person can be impersonated. Admission closes it with digests and signatures, so the runtime needs no trust in the process that did the checking.
Admission begins by running the pipeline again over the project and refusing if any machine or policy has a check not run or a vacuous property. The architecture document says such a stage is recorded in the certificate as notRun; the code refuses instead (PT12.5).
Findings can be accepted, but only by a person: Admission reads signed acceptances from Signed records and refuses a record signed with an agent key. It also reads back every promotion, proposal and refit record in the project and compares each with its source or map (PL6513, PL6520, PL6521). A build with policies is admitted only if the Polyaxion engine is the pinned one.
The Certificate format then binds the source and artefact digests, the checked instances, the toolchain versions and the handler closure, and the issuer signs the digest. The certificate sits beside the Certified build.
At load, the runtime verifies signatures, re-hashes the artefacts and checks the toolchain. Any difference refuses the load with a diagnostic.