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 running program's history become a checked rule, workflow or calibration?
A program that runs teaches its owner things the checker could not know. The loop lets that knowledge in without letting a tool or an agent decide: every step has a key, a floor and a check.
The Feedback commands read the Ledger through a journal reader and write a trace corpus: values for declared domains, a salted token for everything else, erased steps left out and counted.
poly-mine runs polyx on that corpus, or polyness on copied transcripts. Each is started by path with a fixed argument vector, a fresh environment and a pin checked first; polyness runs in a temporary home that is removed afterwards. poly reads polyness's rules by four fixed text templates and never runs its code.
Nothing the tools say is binding. A person signs a verdict on each candidate with a key that is not an agent key, and Signed records keeps it as a file. A rule judged real is promoted into the source under a marker, the pipeline checks the project, and the change is undone if the check refuses it. Admission reads every promotion back and compares it with the source, and the certificate lists them.