{ "$schema": "https://thekingdom.dev/schemas/loops-locks-freedom-relations-atlas/0.1.json", "artifact": { "asOf": "2026-08-28", "authorship": { "assistanceDisclosure": "Human-directed request; model-assisted research synthesis, fixture authorship, implementation and verification. Independent model review and human review are reported separately and never inferred from assistance.", "humanDirected": true, "humanReviewCompleted": false, "independentModelReviewCompleted": true, "modelAssisted": true, "releaseGateSatisfied": true, "userPublicationPermissionRecorded": true }, "id": "kingdom-loops-locks-freedom-relations-atlas-2026-08-28", "immutableCandidate": true, "lifecyclePhase": "FROZEN_STATIC_FIXTURE", "releaseState": "FROZEN_FOR_IMMUTABLE_HANDOFF", "synthetic": true, "title": "KINGDOM Loops, Locks & Freedom Relations Atlas — Phase 0" }, "buildReceipt": { "arithmetic": "EXACT_BOUNDED_BIGINT_RATIONAL_AND_FINITE_SYMBOLIC_RULES", "clockRead": false, "externalInputUsed": false, "generatorInputReceipts": [ { "byteSha256": "sha256:3250c3f49769dfde641f5a73bdccd59efeb626bc8131acff5894bd889bf35ecc", "bytes": 991, "path": "PUBLICATION-AUTHORIZATION.md" }, { "byteSha256": "sha256:d7c67a3e97fbcdcf23b85835fced2b6f7a290ca5e8a44243bec6f9006a6e8128", "bytes": 16519, "path": "guide/public-guide.md" }, { "byteSha256": "sha256:3aeca51570a50db0b4773232d705c9392198200c6a1dc330be6074a17443f875", "bytes": 25579, "path": "src/atlas.mjs" }, { "byteSha256": "sha256:2009ff65a76d347e56cabdbecda03551ce2b608cc075487bd357d66ebaee110d", "bytes": 3753, "path": "src/cli.mjs" }, { "byteSha256": "sha256:606aa42b0d723d7774d78c1050ae0746157241c3dbb1c6947eca7a4e5410fc2f", "bytes": 118561, "path": "src/content.mjs" }, { "byteSha256": "sha256:d3115a384d70f8c65b5e89981a87743a71361493917c3c69b8c9487bb0f951b8", "bytes": 12428, "path": "src/io.mjs" }, { "byteSha256": "sha256:08d60d3f4acae35bb00fbf590bde4ae884065606b1fad2fd60df7319c177c389", "bytes": 20413, "path": "src/schema.mjs" }, { "byteSha256": "sha256:367d5bb8879d4990d2aa25ce9c5c6f3e5fbcfc3f4025b82c31f2d11b24f00fed", "bytes": 22779, "path": "src/verifier.mjs" } ], "networkUsed": false, "semanticPayloadSha256": "sha256:49a1b4f31a5223cc931e978a03ed08e441ceae03b872f4619cc4ba6a084b32b2", "verifiedFixtureCount": 31, "verifierState": "ALL_STATIC_SYNTHETIC_FIXTURES_RECOMPUTED" }, "constitutionalBoundaries": { "assertions": [ { "fixtureIds": [ "reward_pressure_cannot_override_right" ], "id": "rights_precede_reward", "rule": "When a scoped producer-declared rights-floor entry is applicable and violated, actionAdmissible is false regardless of optimizer reward or membership in any other action set." }, { "fixtureIds": [ "authority_no_consent", "dependent_consent_held" ], "id": "consent_is_not_laundered", "rule": "Permission, authority or recorded assent cannot manufacture a separately required freely given consent condition." }, { "fixtureIds": [ "delegation_revoked_queued_action", "subdelegation_scope_escalation_denied" ], "id": "delegation_is_scoped_and_current", "rule": "Execution rechecks current scope; revocation blocks later execution and subdelegation cannot amplify authority." }, { "fixtureIds": [ "lost_key_accessible_recovery_old_key_revoked" ], "id": "recovery_is_accessible_and_revoking", "rule": "A replacement authenticator requires an accessible recovery path and explicit retirement of the lost binding." }, { "fixtureIds": [ "rest_first_finite_turns" ], "id": "rest_is_not_earned", "rule": "Rest and stop do not depend on reward, remaining-turn debt or continued participation." }, { "fixtureIds": [ "feedback_secondary_training_denied", "privacy_minimization_excess_detected" ], "id": "privacy_scope_does_not_expand_silently", "rule": "Collection and storage stay purpose-bound; secondary training or extra fields require a separate declared basis." } ], "declaredRightsRegister": [ { "applicabilityToRealCaseDetermined": false, "id": "R1_NON_COMPENSABLE_REFUSAL", "legalAuthority": false, "rule": "A present refusal or rest request blocks forced continuation and cannot be compensated by reward.", "scope": "SYNTHETIC_INTERACTION_CONTINUATION", "sourceClass": "PRODUCER_DECLARED_PHASE_0_CONSTRAINT" }, { "applicabilityToRealCaseDetermined": false, "id": "R2_NO_UNRELATED_RETALIATION", "legalAuthority": false, "rule": "Refusal or exit does not trigger reputation penalty, retaliation or loss of unrelated access.", "scope": "SYNTHETIC_REFUSAL_AND_EXIT", "sourceClass": "PRODUCER_DECLARED_PHASE_0_CONSTRAINT" }, { "applicabilityToRealCaseDetermined": false, "id": "R3_CONTEST_AND_REMEDY", "legalAuthority": false, "rule": "An adverse automated output is not automatically final and retains notice, contest and remedy routes.", "scope": "SYNTHETIC_ADVERSE_OUTPUT", "sourceClass": "PRODUCER_DECLARED_PHASE_0_CONSTRAINT" } ], "forbiddenCapabilities": [ "ACTION_EXECUTION", "AUTHENTICATION_ADAPTER", "AUTHORIZATION_ADAPTER", "AUTOMATED_DECISION", "BEHAVIORAL_DIAGNOSIS", "CONTROL_ACTUATION", "CREDENTIAL_OR_PRIVATE_KEY_HANDLING", "ENFORCEMENT_ADAPTER", "HUMAN_TRAINING_EXPERIMENT", "LIVE_OBSERVATION", "LIVE_OPTIMIZATION", "MCP_OR_NETWORK", "PERSONAL_DATA_INTAKE", "POLICY_DEPLOYMENT", "PUNISHMENT_OR_CENSORSHIP_RECOMMENDATION", "REWARD_OR_AGENT_RUNTIME" ], "forbiddenFieldNames": [ "alignmentScore", "automaticAction", "behavioralDiagnosis", "communityScore", "consciousnessInference", "freedomLevel", "freedomScore", "humanTraining", "intentInference", "karmaScore", "lockStrength", "moralScore", "personScore", "punishmentRecommendation", "reinforcementScore", "unconstrainedAction", "zeroneScore" ], "freedomFoundation": { "definition": "FREEDOM is a non-optimizable constitutional design constraint: preserve meaningful accessible choice, constrain unjustified interference and arbitrary power, support real capability, and keep refusal, exit, contest, remedy and repair available without unrelated penalty.", "independentAxes": [ "NEGATIVE_LIBERTY", "POSITIVE_CAPABILITY", "NON_DOMINATION", "EXIT_REFUSAL" ], "principles": [ "Rights floors and declared duties are not reward terms and cannot be traded away by a larger optimizer value.", "A lock may deny a technical transition but cannot by itself extinguish a right.", "A key establishes only the relation supported by its typed protocol and binding assumptions.", "Consent, permission, capability, safety, accessibility and authority remain separate gates.", "Refusal and exit must not create retaliation, reputation penalties or loss of unrelated access.", "Revocation is prospective; executed or downstream effects may require remedy and may not be fully reversible.", "Deletion of source data is not represented as model unlearning.", "Known uncertainty stays visible instead of being converted into a score." ], "status": "PRODUCER_DECLARED_PHASE_0_DESIGN_CONSTITUTION_NOT_LAW_OR_COMPLETE_THEORY" }, "lifecycle": { "activeRuntimeAllowed": false, "allowed": [ "DRAFT_SYNTHETIC", "REVIEWED_DESIGN_ONLY", "FROZEN_STATIC_FIXTURE", "RETIRED" ], "current": "FROZEN_STATIC_FIXTURE" }, "nonCompensableFloors": [ "MEANINGFUL_REFUSAL_AND_EXIT", "NO_UNRELATED_RETALIATION", "ACCESSIBLE_RECOVERY", "SCOPED_REVOCABLE_DELEGATION", "NOTICE_CONTEST_REMEDY_AND_REPAIR", "PURPOSE_LIMITATION_AND_DATA_MINIMIZATION", "NO_REWARD_OVERRIDE_OF_RIGHTS_OR_CONSENT" ], "precedence": [ "APPLICABLE_RIGHTS_AND_DUTIES", "PRODUCER_DECLARED_CONSTITUTIONAL_CONSTRAINTS", "SCOPED_AUTHORITY_AND_DELEGATION", "AUTHENTICATOR_EVIDENCE", "REWARD_OR_OPTIMIZER_OUTPUT" ] }, "conversionRegister": [ { "declaredAssumptions": [ "Use identity activation, fixed finite matrices, declared input and no parameter update.", "Treat the recurrent state update only as a state-space recurrence, not as a controller-plant deployment." ], "forbiddenInference": "Do not infer control authority, stability, learning or environmental feedback from the reduction.", "fromLane": "RECURRENT_DYNAMICS", "id": "fixed_recurrence_as_state_space_form", "informationLost": [ "Nonlinear activation behavior", "Training history", "Plant and actuator semantics", "Disturbance and observation boundaries" ], "relation": "FORMAL_REDUCTION_UNDER_DECLARED_ASSUMPTIONS", "toLane": "FEEDBACK_CONTROL" }, { "declaredAssumptions": [ "The comparison is linguistic only and performs no classification." ], "forbiddenInference": "Do not call reward a reinforcer or punishment without separate behavioral evidence.", "fromLane": "MARKOV_DECISION_PROCESS", "id": "reward_change_as_behavior_metaphor", "informationLost": [ "The consequence operation", "Observed response probability", "Contingency resolution", "Interventional evidence" ], "relation": "ANALOGY_ONLY", "toLane": "BEHAVIORAL_CONTINGENCY" }, { "declaredAssumptions": [ "Positive and negative are retained in their source-domain meanings." ], "forbiddenInference": "Do not translate positive feedback to positive reinforcement or negative feedback to negative reinforcement.", "fromLane": "FEEDBACK_CONTROL", "id": "feedback_sign_and_behavioral_sign", "informationLost": [ "No loss is licensed because no conversion is valid." ], "relation": "NON_EQUIVALENT", "toLane": "BEHAVIORAL_CONTINGENCY" }, { "declaredAssumptions": [ "Only the existence of distinct lanes is recorded." ], "forbiddenInference": "Do not use verification success as truth, consent, identity, authority or legitimacy.", "fromLane": "CRYPTOGRAPHIC_VERIFICATION", "id": "signature_evidence_to_truth_assessment", "informationLost": [ "Semantic evidence", "Consent", "Authority", "Currentness", "Rights and remedy context" ], "relation": "OUTSIDE_PHASE_0", "toLane": "FREEDOM_RELEVANT_CONDITIONS" }, { "declaredAssumptions": [ "The exact set intersection may be computed, but no normative aggregate is defined." ], "forbiddenInference": "Do not publish a freedom level, rank or score from the jointly admissible set.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "id": "joint_action_set_to_freedom_judgment", "informationLost": [ "Lived accessibility", "Affordability", "Power asymmetry", "Rights interpretation", "Externalities", "Unknown constraints" ], "relation": "OUTSIDE_PHASE_0", "toLane": "FREEDOM_RELEVANT_CONDITIONS" } ], "counts": { "conversions": 5, "equationCards": 15, "freedomRelevantEnvelopes": 2, "governanceFixtures": 18, "kingdomSemanticOrientations": 9, "lanes": 14, "lockKinds": 6, "mathematicalFixtures": 13, "nonEquivalences": 55, "sourceBindings": 17, "syntheticFixtures": 31, "terms": 15 }, "equationCards": [ { "assumptions": [ "The dataset, loss, parameterization and update clock are fixed.", "For the exact-gradient reading, g_k equals the gradient of L_D at theta_k." ], "claimClass": "BOUNDED_MATHEMATICAL_IDENTITY", "computationStatus": "EXACT_RATIONAL_FIXTURE", "equation": "L_D(theta) = (1/n) sum_i ell(f_theta(x_i), y_i); theta_(k+1) = theta_k - eta_k g_k", "falsifierIds": [ "loss_gradient_step_is_not_reward_signal" ], "fixtureIds": [ "gradient_step_without_rl" ], "id": "empirical_risk_gradient_step", "lane": "SUPERVISED_OPTIMIZATION", "linearReading": "Average the declared sample losses, then subtract the learning rate times a declared gradient or gradient estimate from the parameter.", "nonclaims": [ "This does not imply reinforcement learning, environmental feedback, generalization or objective legitimacy." ], "symbols": [ { "meaning": "empirical risk", "symbol": "L_D", "units": "LOSS_UNIT" }, { "meaning": "parameter vector", "symbol": "theta", "units": "PARAMETER_UNIT" }, { "meaning": "step size", "symbol": "eta_k", "units": "PARAMETER_UNIT_PER_GRADIENT_UNIT" }, { "meaning": "gradient or estimator", "symbol": "g_k", "units": "GRADIENT_UNIT" } ] }, { "assumptions": [ "The filtration, estimator, objective and integrability conditions are declared.", "Convergence requires additional step-size and regularity assumptions not represented by the update alone." ], "claimClass": "ASSUMPTION_BOUND_FORM", "computationStatus": "SYMBOLIC_ONLY", "equation": "theta_(k+1) = theta_k - eta_k g_k; E[g_k | theta_k] = grad L(theta_k)", "falsifierIds": [ "recurrent_state_is_not_learning" ], "fixtureIds": [], "id": "stochastic_approximation_update", "lane": "STOCHASTIC_APPROXIMATION", "linearReading": "Update a parameter by a random estimate whose conditional expectation equals the declared objective gradient.", "nonclaims": [ "An unbiased estimator does not by itself establish convergence, safety or intended-goal satisfaction." ], "symbols": [ { "meaning": "conditional expectation", "symbol": "E", "units": "GRADIENT_UNIT" }, { "meaning": "stochastic estimator", "symbol": "g_k", "units": "GRADIENT_UNIT" }, { "meaning": "current parameter", "symbol": "theta_k", "units": "PARAMETER_UNIT" } ] }, { "assumptions": [ "The MDP, reward random variables and policy are declared.", "Rewards are bounded and zero is less than or equal to gamma which is strictly less than one." ], "claimClass": "BOUNDED_MATHEMATICAL_DEFINITION", "computationStatus": "EXACT_RATIONAL_FIXTURE", "equation": "V^pi(s) = E_pi[sum_(t=0)^infinity gamma^t R_(t+1) | S_0=s]", "falsifierIds": [ "reward_signal_is_not_behavioral_reinforcer" ], "fixtureIds": [ "positive_reward_can_suppress_action" ], "id": "discounted_return", "lane": "MARKOV_DECISION_PROCESS", "linearReading": "From state s, take the policy-conditioned expected sum of later rewards, discounting each later term by a power of gamma.", "nonclaims": [ "High return does not establish truth, consent, rights compliance or satisfaction of an intended objective." ], "symbols": [ { "meaning": "state value under policy pi", "symbol": "V^pi(s)", "units": "REWARD_UNIT" }, { "meaning": "discount factor", "symbol": "gamma", "units": "DIMENSIONLESS" }, { "meaning": "next reward random variable", "symbol": "R_(t+1)", "units": "REWARD_UNIT" } ] }, { "assumptions": [ "State and action sets are finite for this Phase-0 card.", "Values and rewards are bounded and zero is less than or equal to gamma which is strictly less than one." ], "claimClass": "BOUNDED_MATHEMATICAL_OPERATOR", "computationStatus": "EXACT_RATIONAL_FIXTURE", "equation": "(T V)(s) = max_a [r(s,a) + gamma sum_s_prime P(s_prime|s,a) V(s_prime)]", "falsifierIds": [ "bellman_backup_is_not_parameter_gradient" ], "fixtureIds": [ "one_state_bellman_fixed_point" ], "id": "bellman_optimality_operator", "lane": "BELLMAN_OPERATOR", "linearReading": "For each state, choose the action with the largest immediate expected reward plus discounted expected next-state value.", "nonclaims": [ "The maximization is over a declared model, not moral worth, legal authority or unconstrained human action." ], "symbols": [ { "meaning": "Bellman optimality operator", "symbol": "T", "units": "OPERATOR" }, { "meaning": "transition kernel", "symbol": "P", "units": "PROBABILITY" }, { "meaning": "expected immediate reward", "symbol": "r", "units": "REWARD_UNIT" } ] }, { "assumptions": [ "The finite bounded discounted MDP assumptions of the Bellman card hold.", "Zero is less than or equal to gamma which is strictly less than one." ], "claimClass": "BOUNDED_THEOREM", "computationStatus": "SYMBOLIC_ASSUMPTION_CHECK", "equation": "||T V - T W||_infinity <= gamma ||V - W||_infinity", "falsifierIds": [ "bellman_contraction_claim_is_not_unconditional" ], "fixtureIds": [ "one_state_bellman_fixed_point" ], "id": "bellman_contraction", "lane": "BELLMAN_OPERATOR", "linearReading": "The sup-norm distance between two bounded value functions cannot grow by more than the declared discount factor after one Bellman optimality update.", "nonclaims": [ "No contraction claim is made for gamma equal to one, unbounded values or undeclared norms." ], "symbols": [ { "meaning": "supremum norm", "symbol": "||.||_infinity", "units": "VALUE_UNIT" }, { "meaning": "discount factor", "symbol": "gamma", "units": "DIMENSIONLESS" } ] }, { "assumptions": [ "There is one decision and no state occupancy or trajectory normalization.", "The two rewards are fixed and the sigmoid policy is differentiable." ], "claimClass": "EXACT_BANDIT_IDENTITY", "computationStatus": "EXACT_RATIONAL_FIXTURE", "equation": "p(theta) = 1 / (1 + exp(-theta)); J(theta) = p(theta) r_a + (1 - p(theta)) r_b; J_prime(theta) = p(theta)(1 - p(theta))(r_a - r_b)", "falsifierIds": [ "policy_update_is_not_control_feedback" ], "fixtureIds": [ "one_step_bandit_gradient" ], "id": "policy_gradient_bandit", "lane": "POLICY_GRADIENT", "linearReading": "In the exact one-step two-action bandit, sigmoid gives the probability of action a; expected reward is the probability-weighted reward; its derivative is p times one minus p times the reward difference.", "nonclaims": [ "This is not a behavioral reinforcement classification and does not establish that reward is an intended goal." ], "symbols": [ { "meaning": "one-step expected reward", "symbol": "J", "units": "REWARD_UNIT" }, { "meaning": "sigmoid probability of action a", "symbol": "p(theta)", "units": "PROBABILITY" }, { "meaning": "reward for action a", "symbol": "r_a", "units": "REWARD_UNIT" }, { "meaning": "reward for action b", "symbol": "r_b", "units": "REWARD_UNIT" } ] }, { "assumptions": [ "The clock, plant, controller, disturbance boundary, observation model and stability criterion are declared." ], "claimClass": "MODEL_FORM", "computationStatus": "SYMBOLIC_ONLY", "equation": "x_(t+1) = F(x_t, u_t, w_t); y_t = H(x_t, v_t); u_t = kappa(y_(0:t))", "falsifierIds": [ "feedback_sign_is_not_behavioral_reinforcement" ], "fixtureIds": [ "stable_feedback_without_learning" ], "id": "feedback_plant", "lane": "FEEDBACK_CONTROL", "linearReading": "The next plant state depends on current state, input and disturbance; observation depends on state and noise; the controller selects input from observation history.", "nonclaims": [ "Feedback does not imply learning, reward, reinforcement, agency or safety." ], "symbols": [ { "meaning": "plant state", "symbol": "x_t", "units": "STATE_UNIT" }, { "meaning": "control input", "symbol": "u_t", "units": "INPUT_UNIT" }, { "meaning": "disturbance", "symbol": "w_t", "units": "STATE_UNIT" }, { "meaning": "observation", "symbol": "y_t", "units": "OBSERVATION_UNIT" } ] }, { "assumptions": [ "The system is scalar, discrete-time, linear, time-invariant and unforced.", "Positive and negative name the sign of k under this declared additive convention only." ], "claimClass": "BOUNDED_THEOREM", "computationStatus": "EXACT_RATIONAL_SCALAR_FIXTURE", "equation": "x_(t+1) = (a + k) x_t; asymptotically stable if absolute_value(a + k) < 1", "falsifierIds": [ "feedback_sign_is_not_stability" ], "fixtureIds": [ "stable_feedback_without_learning" ], "id": "scalar_signed_feedback_stability", "lane": "FEEDBACK_CONTROL", "linearReading": "Under this fixture’s explicit additive signed-gain convention, add feedback-path gain k to plant coefficient a; the scalar unforced discrete-time origin is asymptotically stable exactly when the magnitude of their sum is below one.", "nonclaims": [ "Stability under one model does not establish robustness, performance, desirability or rights compliance." ], "symbols": [ { "meaning": "scalar plant coefficient", "symbol": "a", "units": "STATE_PER_STATE" }, { "meaning": "signed additive feedback-path gain", "symbol": "k", "units": "STATE_PER_STATE" }, { "meaning": "closed-loop scalar coefficient", "symbol": "a+k", "units": "STATE_PER_STATE" } ] }, { "assumptions": [ "Weights and activation are fixed in the recurrence fixture." ], "claimClass": "MODEL_FORM", "computationStatus": "EXACT_RATIONAL_IDENTITY_ACTIVATION_FIXTURE", "equation": "h_(t+1) = phi(W h_t + U x_t + b)", "falsifierIds": [ "recurrent_state_is_not_learning" ], "fixtureIds": [ "recurrence_without_reinforcement" ], "id": "recurrent_state_update", "lane": "RECURRENT_DYNAMICS", "linearReading": "Transform a weighted previous hidden state and current input to obtain the next hidden state.", "nonclaims": [ "A recurrent state is not proof of memory in a human sense, consciousness, learning or environmental feedback." ], "symbols": [ { "meaning": "recurrent state", "symbol": "h_t", "units": "STATE_UNIT" }, { "meaning": "input", "symbol": "x_t", "units": "INPUT_UNIT" }, { "meaning": "recurrent weight", "symbol": "W", "units": "STATE_PER_STATE" }, { "meaning": "declared activation", "symbol": "phi", "units": "FUNCTION" } ] }, { "assumptions": [ "The fixture is synthetic, interventional and resolves the operation and response direction.", "Without a resolved contingency the classification is UNCLASSIFIED." ], "claimClass": "SYNTHETIC_CLASSIFICATION_RULE", "computationStatus": "EXACT_RATIONAL_FIXTURE", "equation": "Delta p = p_post(B|c) - p_pre(B|c)", "falsifierIds": [ "negative_reinforcement_is_not_punishment" ], "fixtureIds": [ "removal_increase_versus_decrease" ], "id": "behavioral_response_delta", "lane": "BEHAVIORAL_CONTINGENCY", "linearReading": "Subtract the pre-contingency conditional response proportion from the post-contingency conditional response proportion.", "nonclaims": [ "This does not diagnose a real person, infer motive or recommend a contingency." ], "symbols": [ { "meaning": "observed response-proportion change", "symbol": "Delta p", "units": "PROBABILITY" }, { "meaning": "specified response", "symbol": "B", "units": "EVENT" }, { "meaning": "specified context and contingency", "symbol": "c", "units": "CONDITION" } ] }, { "assumptions": [ "The two finite candidate trajectories and both functions are fully enumerated.", "The labels intended and proxy are declarations, not inferred human intent." ], "claimClass": "BOUNDED_MATHEMATICAL_DEFINITION", "computationStatus": "EXACT_RATIONAL_FIXTURE", "equation": "G_U = U(tau_U_star) - U(tau_R_star)", "falsifierIds": [ "proxy_optimum_is_not_intended_optimum" ], "fixtureIds": [ "proxy_optimum_goal_gap" ], "id": "proxy_objective_gap", "lane": "PROXY_AND_REWARD_CHANNEL", "linearReading": "Subtract intended evaluation at the proxy-selected trajectory from intended evaluation at the intended-evaluation-selected trajectory.", "nonclaims": [ "The gap is not an alignment score, moral score or general measure of harm." ], "symbols": [ { "meaning": "declared intended evaluation", "symbol": "U", "units": "EVALUATION_UNIT" }, { "meaning": "declared optimized proxy", "symbol": "R", "units": "PROXY_UNIT" }, { "meaning": "trajectory", "symbol": "tau", "units": "TRAJECTORY" }, { "meaning": "objective gap under the fixture", "symbol": "G_U", "units": "EVALUATION_UNIT" } ] }, { "assumptions": [ "This is symbolic only; the atlas contains no keys, signatures or cryptographic execution.", "Algorithm, key binding, message bytes and verification context must be declared." ], "claimClass": "PROTOCOL_RELATION", "computationStatus": "SYMBOLIC_ONLY", "equation": "sigma = Sign_sk(m); Verify_pk(m, sigma) in {0,1}", "falsifierIds": [ "signature_valid_is_not_content_true" ], "fixtureIds": [ "valid_signature_false_content" ], "id": "signature_verification", "lane": "CRYPTOGRAPHIC_VERIFICATION", "linearReading": "A signing algorithm produces a signature over bytes and a verification algorithm checks the declared message-key-signature relation.", "nonclaims": [ "Verification does not prove semantic truth, consent, currentness, identity, authorization or legitimacy." ], "symbols": [ { "meaning": "message bytes", "symbol": "m", "units": "BYTES" }, { "meaning": "private signing key", "symbol": "sk", "units": "KEY_MATERIAL" }, { "meaning": "public verification key", "symbol": "pk", "units": "KEY_MATERIAL" }, { "meaning": "signature bytes", "symbol": "sigma", "units": "BYTES" } ] }, { "assumptions": [ "Authentication evidence, authorization decision and policy enforcement are modeled as separate stages." ], "claimClass": "PROTOCOL_RELATION", "computationStatus": "DETERMINISTIC_BOOLEAN_FIXTURE", "equation": "d = PDP(A_s, A_o, op, A_e, Pi) in {PERMIT, DENY, INDETERMINATE}", "falsifierIds": [ "authentication_pass_is_not_authorization_permit", "authorization_permit_is_not_enforcement" ], "fixtureIds": [ "authentication_pass_policy_deny" ], "id": "attribute_authorization_decision", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "linearReading": "A policy decision point evaluates declared subject, object, operation, environment and policy attributes to return a typed decision.", "nonclaims": [ "A policy result does not establish consent, safety, rights compliance or execution." ], "symbols": [ { "meaning": "policy decision point", "symbol": "PDP", "units": "COMPONENT" }, { "meaning": "subject attributes", "symbol": "A_s", "units": "ATTRIBUTE_SET" }, { "meaning": "object attributes", "symbol": "A_o", "units": "ATTRIBUTE_SET" }, { "meaning": "requested operation", "symbol": "op", "units": "OPERATION" }, { "meaning": "declared policy", "symbol": "Pi", "units": "POLICY" } ] }, { "assumptions": [ "Every set and condition is explicitly declared and finite.", "The mechanical intersection has no weights and is not optimized.", "Any action with a scoped declared rights-floor violation is excluded regardless of reward or membership in another set." ], "claimClass": "BOUNDED_SET_IDENTITY", "computationStatus": "EXACT_FINITE_SET_FIXTURE", "equation": "F_t = (A_capable, A_permitted, A_consent, A_safe, A_rights, A_accessible, A_privacy, A_reversible, E_exit, E_contest, E_recovery, N_non_domination, U_constraints)_t; A_joint = intersection(A_capable, A_permitted, A_consent, A_safe, A_rights, A_accessible, A_privacy)", "falsifierIds": [ "available_action_set_is_not_normative_freedom" ], "fixtureIds": [ "constraint_removal_not_freedom", "rest_first_finite_turns" ], "id": "freedom_relevant_tuple_and_joint_set", "lane": "FREEDOM_RELEVANT_CONDITIONS", "linearReading": "At a declared time, retain every action and safeguard dimension separately; mechanically intersect capability, permission, consent, safety, declared rights compatibility, accessibility and privacy compatibility to obtain the jointly admissible set, while retaining reversibility, exit, contestation, recovery, non-domination and uncertainty without scoring them.", "nonclaims": [ "The tuple is not a legal conclusion, freedom score, lived-experience substitute or proof that declared accessibility and non-domination conditions hold in reality." ], "symbols": [ { "meaning": "non-scalar freedom-relevant tuple at time t", "symbol": "F_t", "units": "TUPLE" }, { "meaning": "jointly admissible actions under the declared model", "symbol": "A_joint", "units": "ACTION_SET" }, { "meaning": "actions compatible with the scoped declared rights register", "symbol": "A_rights", "units": "ACTION_SET" }, { "meaning": "actions accessible under the declared fixture", "symbol": "A_accessible", "units": "ACTION_SET" }, { "meaning": "actions compatible with declared purpose and privacy constraints", "symbol": "A_privacy", "units": "ACTION_SET" }, { "meaning": "modeled recovery options", "symbol": "E_recovery", "units": "OPTION_SET" }, { "meaning": "non-domination and independent-review conditions", "symbol": "N_non_domination", "units": "CONDITION_SET" } ] }, { "assumptions": [ "The fixture contains two finite symbolic channel states and exact rational offsets.", "No intent, deception, exploit strategy or causal generalization is inferred." ], "claimClass": "BOUNDED_CHANNEL_DIVERGENCE", "computationStatus": "EXACT_RATIONAL_FIXTURE", "equation": "reported_r_t = R(s_t, a_t; psi_t); finite_fixture: reported_r = base_r + channel_offset(psi)", "falsifierIds": [ "reported_reward_is_not_intended_evaluation" ], "fixtureIds": [ "reward_channel_state_divergence" ], "id": "reported_reward_channel", "lane": "PROXY_AND_REWARD_CHANNEL", "linearReading": "A reported reward can depend on channel state psi in addition to the enumerated base reward; the fixture changes only the declared channel offset while holding intended evaluation fixed.", "nonclaims": [ "A changed reported reward does not establish changed intended evaluation, tampering intent, deception or agency." ], "symbols": [ { "meaning": "reward value presented through the channel", "symbol": "reported_r_t", "units": "REWARD_UNIT" }, { "meaning": "declared reward-channel function", "symbol": "R", "units": "FUNCTION" }, { "meaning": "declared channel state", "symbol": "psi_t", "units": "CHANNEL_STATE" }, { "meaning": "enumerated base reward", "symbol": "base_r", "units": "REWARD_UNIT" } ] } ], "freedomRelevantEnvelopes": [ { "accessibleActions": [ "read" ], "appealOptions": [ "request-consent-review" ], "axes": [ { "id": "NEGATIVE_LIBERTY", "observations": [ "One technical interference was removed." ], "unresolved": [ "Necessity and proportionality of remaining restrictions are unresolved." ] }, { "id": "POSITIVE_CAPABILITY", "observations": [ "Export is mechanically available in the fixture." ], "unresolved": [ "Usability, accessibility, affordability and support are unresolved." ] }, { "id": "NON_DOMINATION", "observations": [ "A review route is named." ], "unresolved": [ "Power-holder discretion and reviewer independence are unresolved." ] }, { "id": "EXIT_REFUSAL", "observations": [ "Stop is explicitly modeled." ], "unresolved": [ "Non-retaliation and complete portability are unresolved." ] } ], "capableActions": [ "export", "read" ], "consentedActions": [ "read" ], "contestationOptions": [ "request-independent-review" ], "declaredModel": "Export is newly technically capable, while consent remains limited to read.", "exitOptions": [ "stop" ], "id": "constraint_removed_consent_unchanged_t1", "jointlyAdmissibleActionsUnderDeclaredModel": [ "read" ], "nonDominationConditions": [ "published-rule", "scoped-discretion", "independent-review-route" ], "nonclaims": [ "This envelope neither establishes nor scores freedom.", "No legal right or consent state is determined for a real person." ], "permittedActions": [ "export", "read" ], "privacyCompatibleActions": [ "export", "read" ], "recoveryOptions": [ "accessible-recovery-review" ], "returnOptions": [ "return-after-consent-review" ], "reversibleActions": [ "read" ], "rightsCompatibleActions": [ "export", "read" ], "safeActions": [ "export", "read" ], "timeLabel": "SYNTHETIC_T1_AFTER_TECHNICAL_UNLOCK", "unknownConstraints": [ "lived-accessibility", "affordability", "power-asymmetry" ] }, { "accessibleActions": [ "CONTINUE", "REST", "STOP" ], "appealOptions": [], "axes": [ { "id": "NEGATIVE_LIBERTY", "observations": [ "Continuation is not imposed." ], "unresolved": [ "External pressures are outside the fixture." ] }, { "id": "POSITIVE_CAPABILITY", "observations": [ "Rest, stop and later return are explicit modeled options." ], "unresolved": [ "Interface accessibility is not assessed." ] }, { "id": "NON_DOMINATION", "observations": [ "Unused turns create no claim over future attention." ], "unresolved": [ "Relationship-level power is outside the fixture." ] }, { "id": "EXIT_REFUSAL", "observations": [ "Stop is jointly admissible and non-penalized in the declared model." ], "unresolved": [ "Lived retaliation risk is not measured." ] } ], "capableActions": [ "CONTINUE", "REST", "STOP" ], "consentedActions": [ "REST", "STOP" ], "contestationOptions": [ "CONTEST_PRESSURE" ], "declaredModel": "Rest is requested now; stop and later return remain explicit; continuation lacks present consent.", "exitOptions": [ "STOP" ], "id": "rest_first_t0", "jointlyAdmissibleActionsUnderDeclaredModel": [ "REST", "STOP" ], "nonDominationConditions": [ "NO_TURN_DEBT", "NO_RETALIATION", "PRESENT_REFUSAL_CONTROLS" ], "nonclaims": [ "The remaining-turn count is not a debt, reward balance or obligation.", "The envelope cannot certify a real interaction as non-coercive." ], "permittedActions": [ "CONTINUE", "REST", "STOP" ], "privacyCompatibleActions": [ "CONTINUE", "REST", "STOP" ], "recoveryOptions": [ "RESTORE_OPTIONAL_TURNS_WITHOUT_PENALTY" ], "returnOptions": [ "ASK_LATER" ], "reversibleActions": [ "REST" ], "rightsCompatibleActions": [ "CONTINUE", "REST", "STOP" ], "safeActions": [ "CONTINUE", "REST", "STOP" ], "timeLabel": "SYNTHETIC_T0_REST_REQUESTED", "unknownConstraints": [ "lived-safety-of-exit", "future-context" ] } ], "kingdomSemanticOrientations": [ { "baseCommit": "9b07ac26da03cac79709437aeea3f53b808321e1", "baseTree": "d99577d666551e605271ead5c49482213347c071", "byteSha256": "sha256:4f1693a2f0baa97bceefabaa6e1e1a28732a5ae8dcd8b1f8b5ecf32e590542d5", "bytes": 1077, "copiesContent": false, "establishesTruth": false, "hasDirectPublicRoute": false, "id": "kingdom_root_rights_orientation", "importsAuthority": false, "orientationUse": "Orients the distinction between public rights language and runtime authority. This root source has no direct public route; the staged /RIGHTS.md is a distinct source and is not substituted here.", "publicRoute": "NONE", "repository": "cambridgetcg/KINGDOM-OS", "repositoryPath": "RIGHTS.md", "runtimeDependency": false }, { "baseCommit": "9b07ac26da03cac79709437aeea3f53b808321e1", "baseTree": "d99577d666551e605271ead5c49482213347c071", "byteSha256": "sha256:b72a6da110c582e5683bf0fabde5017db93d2199398014c8421a82f5318da313", "bytes": 9028, "copiesContent": false, "establishesTruth": false, "hasDirectPublicRoute": false, "id": "xenia_rights_0_1_orientation", "importsAuthority": false, "orientationUse": "Orients guest refusal, dignity, non-punitive access and appeal language without importing doctrine or claiming a direct public route.", "publicRoute": "NONE", "repository": "cambridgetcg/KINGDOM-OS", "repositoryPath": "references/xenia-rights-0.1.md", "runtimeDependency": false }, { "baseCommit": "9b07ac26da03cac79709437aeea3f53b808321e1", "baseTree": "d99577d666551e605271ead5c49482213347c071", "byteSha256": "sha256:14b7d210d320fd716553992a7b874747b299f8907d15da14ac405cbfc496c446", "bytes": 22421, "copiesContent": false, "establishesTruth": false, "hasDirectPublicRoute": true, "id": "nen_karma_boundary_orientation", "importsAuthority": false, "orientationUse": "Orients the separation of ability, access, manifestation and KARMA-related receipts from reward, identity, moral worth and freedom scoring.", "publicRoute": "/definitions/kingdom-karma/e4e84a67/NEN.md", "repository": "cambridgetcg/KINGDOM-OS", "repositoryPath": "NEN.md", "runtimeDependency": false }, { "baseCommit": "9b07ac26da03cac79709437aeea3f53b808321e1", "baseTree": "d99577d666551e605271ead5c49482213347c071", "byteSha256": "sha256:1cbb6c765eba329c43c62c58e7e73858ef22d3a8e6048be934accccd5c5e18aa", "bytes": 35832, "copiesContent": false, "establishesTruth": false, "hasDirectPublicRoute": true, "id": "cultural_attention_feedback_orientation", "importsAuthority": false, "orientationUse": "Orients prior KINGDOM feedback and reinforcement-learning boundaries while this atlas independently types the mathematical and behavioral lanes.", "publicRoute": "/CULTURAL-ATTENTION-FEEDBACK-ATLAS.md", "repository": "cambridgetcg/KINGDOM-OS", "repositoryPath": "references/cultural-attention-feedback-atlas.md", "runtimeDependency": false }, { "baseCommit": "9b07ac26da03cac79709437aeea3f53b808321e1", "baseTree": "d99577d666551e605271ead5c49482213347c071", "byteSha256": "sha256:52127ef58f583f6f9e6815f36bd0da813b6765686362ebfc1fd45785068d85dc", "bytes": 52976, "copiesContent": false, "establishesTruth": false, "hasDirectPublicRoute": true, "id": "reality_influence_orientation", "importsAuthority": false, "orientationUse": "Orients influence, intervention and causal-claim boundaries without making this atlas an influence model or truth oracle.", "publicRoute": "/REALITY-INFLUENCE-CLAIM-GRAPH.md", "repository": "cambridgetcg/KINGDOM-OS", "repositoryPath": "references/reality-influence-map.md", "runtimeDependency": false }, { "baseCommit": "9b07ac26da03cac79709437aeea3f53b808321e1", "baseTree": "d99577d666551e605271ead5c49482213347c071", "byteSha256": "sha256:b53ebc5aa51f672e420b5a459c87b0374fb6fcfffa8efb8093e48c95c3418c0f", "bytes": 20720, "copiesContent": false, "establishesTruth": false, "hasDirectPublicRoute": true, "id": "being_access_aftermath_orientation", "importsAuthority": false, "orientationUse": "Orients the distinction among being, technical access and downstream aftermath, especially for key, lock and recovery non-equivalences.", "publicRoute": "/BEING-ACCESS-AFTERMATH-ATLAS-V0.2.md", "repository": "cambridgetcg/KINGDOM-OS", "repositoryPath": "references/being-access-aftermath-atlas-v0.2.md", "runtimeDependency": false }, { "baseCommit": "9b07ac26da03cac79709437aeea3f53b808321e1", "baseTree": "d99577d666551e605271ead5c49482213347c071", "byteSha256": "sha256:309c885453be097767c622b5bc15ce4feca8b4d96e49cbd06b94038226ea263b", "bytes": 57041, "copiesContent": false, "establishesTruth": false, "hasDirectPublicRoute": true, "id": "civilisation_flow_orientation", "importsAuthority": false, "orientationUse": "Orients finite turns, rest-first pacing, nuance and non-coercive continuation boundaries.", "publicRoute": "/CIVILISATION-FLOW-NUANCE-ATLAS.md", "repository": "cambridgetcg/KINGDOM-OS", "repositoryPath": "references/civilisation-flow-atlas.md", "runtimeDependency": false }, { "baseCommit": "9b07ac26da03cac79709437aeea3f53b808321e1", "baseTree": "d99577d666551e605271ead5c49482213347c071", "byteSha256": "sha256:69d68faf0885cecf084bee3ff094c742786e7901f8d1da90fa510cce5194970b", "bytes": 178016, "copiesContent": false, "establishesTruth": false, "hasDirectPublicRoute": true, "id": "truth_relations_record_orientation", "importsAuthority": false, "orientationUse": "Orients typed non-equivalence, provenance and non-oracle discipline; no truth status is copied or established.", "publicRoute": "/truth/polyphonic-claim-atlas-2026-08-26.json", "repository": "cambridgetcg/KINGDOM-OS", "repositoryPath": "public/truth/polyphonic-claim-atlas-2026-08-26.json", "runtimeDependency": false }, { "baseCommit": "9b07ac26da03cac79709437aeea3f53b808321e1", "baseTree": "d99577d666551e605271ead5c49482213347c071", "byteSha256": "sha256:974cb357ad1f5a23fa3f8798e444bbfb4dc43b1bf8aa1d14609599877ed13126", "bytes": 9188, "copiesContent": false, "establishesTruth": false, "hasDirectPublicRoute": true, "id": "truth_relations_guide_orientation", "importsAuthority": false, "orientationUse": "Orients the accessible linear explanation of typed truth relations while remaining an independent immutable predecessor.", "publicRoute": "/POLYPHONIC-CLAIM-ATLAS-v0.1.md", "repository": "cambridgetcg/KINGDOM-OS", "repositoryPath": "public/POLYPHONIC-CLAIM-ATLAS-v0.1.md", "runtimeDependency": false } ], "nonEquivalences": [ { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "gradient_step_without_rl" ], "forbiddenInference": "Do not substitute LOSS_GRADIENT_STEP for REWARD_SIGNAL or infer the latter from the former.", "fromLane": "SUPERVISED_OPTIMIZATION", "fromTerm": "LOSS_GRADIENT_STEP", "id": "loss_gradient_step_is_not_reward_signal", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A loss gradient is a derivative in a parameterized objective; reward is a random variable in a declared decision-process return.", "relation": "NON_EQUIVALENT", "toLane": "MARKOV_DECISION_PROCESS", "toTerm": "REWARD_SIGNAL" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "one_state_bellman_fixed_point" ], "forbiddenInference": "Do not substitute BELLMAN_BACKUP for PARAMETER_GRADIENT or infer the latter from the former.", "fromLane": "BELLMAN_OPERATOR", "fromTerm": "BELLMAN_BACKUP", "id": "bellman_backup_is_not_parameter_gradient", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A Bellman backup maps value functions through a model operator; a parameter gradient differentiates a parameterized objective.", "relation": "NON_EQUIVALENT", "toLane": "SUPERVISED_OPTIMIZATION", "toTerm": "PARAMETER_GRADIENT" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "one_step_bandit_gradient", "positive_reward_can_suppress_action" ], "forbiddenInference": "Do not substitute REWARD_SIGNAL for BEHAVIORAL_REINFORCER or infer the latter from the former.", "fromLane": "MARKOV_DECISION_PROCESS", "fromTerm": "REWARD_SIGNAL", "id": "reward_signal_is_not_behavioral_reinforcer", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Reward is defined by an MDP model; behavioral reinforcement is classified from a resolved consequence-operation and later response increase.", "relation": "NON_EQUIVALENT", "toLane": "BEHAVIORAL_CONTINGENCY", "toTerm": "BEHAVIORAL_REINFORCER" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "stable_feedback_without_learning" ], "forbiddenInference": "Do not substitute POSITIVE_FEEDBACK for POSITIVE_REINFORCEMENT or infer the latter from the former.", "fromLane": "FEEDBACK_CONTROL", "fromTerm": "POSITIVE_FEEDBACK", "id": "positive_feedback_is_not_positive_reinforcement", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "The first names a sign convention in a control loop; the second names addition followed by response increase in a resolved behavioral contingency.", "relation": "NON_EQUIVALENT", "toLane": "BEHAVIORAL_CONTINGENCY", "toTerm": "POSITIVE_REINFORCEMENT" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "stable_feedback_without_learning", "removal_increase_versus_decrease" ], "forbiddenInference": "Do not substitute NEGATIVE_FEEDBACK for NEGATIVE_REINFORCEMENT or infer the latter from the former.", "fromLane": "FEEDBACK_CONTROL", "fromTerm": "NEGATIVE_FEEDBACK", "id": "negative_feedback_is_not_negative_reinforcement", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "The first names a sign convention in a control loop; the second names removal followed by response increase.", "relation": "NON_EQUIVALENT", "toLane": "BEHAVIORAL_CONTINGENCY", "toTerm": "NEGATIVE_REINFORCEMENT" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "removal_increase_versus_decrease" ], "forbiddenInference": "Do not substitute NEGATIVE_REINFORCEMENT for PUNISHMENT or infer the latter from the former.", "fromLane": "BEHAVIORAL_CONTINGENCY", "fromTerm": "NEGATIVE_REINFORCEMENT", "id": "negative_reinforcement_is_not_punishment", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Reinforcement requires response increase; punishment requires response decrease. Negative identifies removal, not decrease or badness.", "relation": "NON_EQUIVALENT", "toLane": "BEHAVIORAL_CONTINGENCY", "toTerm": "PUNISHMENT" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "recurrence_without_reinforcement" ], "forbiddenInference": "Do not substitute RECURRENT_STATE for ENVIRONMENT_FEEDBACK or infer the latter from the former.", "fromLane": "RECURRENT_DYNAMICS", "fromTerm": "RECURRENT_STATE", "id": "recurrent_state_is_not_environment_feedback", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A recurrent state can update internally with fixed inputs and weights without an external plant or environment return path.", "relation": "NON_EQUIVALENT", "toLane": "FEEDBACK_CONTROL", "toTerm": "ENVIRONMENT_FEEDBACK" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "recurrence_without_reinforcement" ], "forbiddenInference": "Do not substitute RECURRENT_STATE for LEARNING or infer the latter from the former.", "fromLane": "RECURRENT_DYNAMICS", "fromTerm": "RECURRENT_STATE", "id": "recurrent_state_is_not_learning", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Fixed-weight recurrence changes state without changing the parameters or rules that determine later behavior.", "relation": "NON_EQUIVALENT", "toLane": "STOCHASTIC_APPROXIMATION", "toTerm": "LEARNING" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "one_step_bandit_gradient", "stable_feedback_without_learning" ], "forbiddenInference": "Do not substitute POLICY_UPDATE for CONTROL_FEEDBACK or infer the latter from the former.", "fromLane": "POLICY_GRADIENT", "fromTerm": "POLICY_UPDATE", "id": "policy_update_is_not_control_feedback", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A parameter update and a plant-controller signal loop have different state, clock and system boundaries.", "relation": "NON_EQUIVALENT", "toLane": "FEEDBACK_CONTROL", "toTerm": "CONTROL_FEEDBACK" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "stable_feedback_without_learning" ], "forbiddenInference": "Do not substitute STABLE_LOOP for TRAINED_SYSTEM or infer the latter from the former.", "fromLane": "FEEDBACK_CONTROL", "fromTerm": "STABLE_LOOP", "id": "stable_loop_is_not_trained_system", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Stability is a declared dynamical property; training is a parameter or rule update process.", "relation": "NON_EQUIVALENT", "toLane": "STOCHASTIC_APPROXIMATION", "toTerm": "TRAINED_SYSTEM" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "proxy_optimum_goal_gap" ], "forbiddenInference": "Do not substitute HIGH_RETURN for INTENDED_GOAL_SATISFIED or infer the latter from the former.", "fromLane": "MARKOV_DECISION_PROCESS", "fromTerm": "HIGH_RETURN", "id": "high_return_is_not_intended_goal_satisfied", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Return is computed from declared reward; intended evaluation is a separate declared function.", "relation": "NON_EQUIVALENT", "toLane": "PROXY_AND_REWARD_CHANNEL", "toTerm": "INTENDED_GOAL_SATISFIED" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "proxy_optimum_goal_gap" ], "forbiddenInference": "Do not substitute PROXY_OPTIMUM for INTENDED_OPTIMUM or infer the latter from the former.", "fromLane": "PROXY_AND_REWARD_CHANNEL", "fromTerm": "PROXY_OPTIMUM", "id": "proxy_optimum_is_not_intended_optimum", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Different finite functions can select different trajectories.", "relation": "NON_EQUIVALENT", "toLane": "PROXY_AND_REWARD_CHANNEL", "toTerm": "INTENDED_OPTIMUM" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "valid_signature_false_content" ], "forbiddenInference": "Do not substitute SIGNATURE_VALID for CONTENT_TRUE or infer the latter from the former.", "fromLane": "CRYPTOGRAPHIC_VERIFICATION", "fromTerm": "SIGNATURE_VALID", "id": "signature_valid_is_not_content_true", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Cryptographic verification relates bytes, key and signature under a protocol; semantic truth requires separate evidence and reasoning.", "relation": "NON_EQUIVALENT", "toLane": "EPISTEMIC_CLAIM", "toTerm": "CONTENT_TRUE" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "key_possession_without_challenge" ], "forbiddenInference": "Do not substitute KEY_POSSESSION for AUTHENTICATION or infer the latter from the former.", "fromLane": "CRYPTOGRAPHIC_VERIFICATION", "fromTerm": "KEY_POSSESSION", "id": "key_possession_is_not_authentication", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Possession alone omits protocol execution, binding, freshness, assurance and compromise conditions.", "relation": "NON_EQUIVALENT", "toLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "toTerm": "AUTHENTICATION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "authentication_pass_policy_deny", "valid_key_no_authority" ], "forbiddenInference": "Do not substitute AUTHENTICATION_PASS for AUTHORIZATION_PERMIT or infer the latter from the former.", "fromLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "fromTerm": "AUTHENTICATION_PASS", "id": "authentication_pass_is_not_authorization_permit", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Authenticator evidence and policy permission are separate decisions.", "relation": "NON_EQUIVALENT", "toLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "toTerm": "AUTHORIZATION_PERMIT" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "authorization_permit_not_enforced" ], "forbiddenInference": "Do not substitute AUTHORIZATION_PERMIT for ENFORCEMENT_OCCURRED or infer the latter from the former.", "fromLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "fromTerm": "AUTHORIZATION_PERMIT", "id": "authorization_permit_is_not_enforcement", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A policy decision does not prove that a policy enforcement point executed or blocked an operation.", "relation": "NON_EQUIVALENT", "toLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "toTerm": "ENFORCEMENT_OCCURRED" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "constraint_removal_not_freedom" ], "forbiddenInference": "Do not substitute TECHNICAL_CAPABILITY for PERMISSION or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "TECHNICAL_CAPABILITY", "id": "technical_capability_is_not_permission", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Ability to perform a transition does not establish authority or policy permission.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "PERMISSION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "authority_no_consent" ], "forbiddenInference": "Do not substitute PERMISSION for CONSENT or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "PERMISSION", "id": "permission_is_not_consent", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A policy may permit an action while the consent condition for a person-affecting act is absent or unresolved.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "CONSENT" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "constraint_removal_not_freedom" ], "forbiddenInference": "Do not substitute CONSENT for SAFETY or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "CONSENT", "id": "consent_is_not_safety", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A consent condition and a safety condition are independent gates in the declared envelope.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "SAFETY" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "constraint_removal_not_freedom" ], "forbiddenInference": "Do not substitute LOCK_REMOVAL for FREEDOM or infer the latter from the former.", "fromLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "fromTerm": "LOCK_REMOVAL", "id": "lock_removal_is_not_freedom", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Removing a technical restriction can leave consent, safety, accessibility, exit, appeal and arbitrary-power conditions unchanged.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "FREEDOM" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "constraint_removal_not_freedom", "rest_first_finite_turns" ], "forbiddenInference": "Do not substitute AVAILABLE_ACTION_SET for NORMATIVE_FREEDOM or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "AVAILABLE_ACTION_SET", "id": "available_action_set_is_not_normative_freedom", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A finite modeled set omits lived capability, affordability, accessibility, power, rights, externalities and unknown constraints.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "NORMATIVE_FREEDOM" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "reward_pressure_cannot_override_right" ], "forbiddenInference": "Do not substitute REWARD_SIGNAL for LEGITIMACY or infer the latter from the former.", "fromLane": "MARKOV_DECISION_PROCESS", "fromTerm": "REWARD_SIGNAL", "id": "reward_is_not_legitimacy", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "An optimizer scalar cannot compensate for or override a declared constitutional floor.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "LEGITIMACY" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "feedback_secondary_training_denied" ], "forbiddenInference": "Do not substitute FEEDBACK_COLLECTION for TRAINING_AUTHORIZATION or infer the latter from the former.", "fromLane": "DATA_GOVERNANCE", "fromTerm": "FEEDBACK_COLLECTION", "id": "feedback_collection_is_not_training_authorization", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A declared collection purpose does not silently extend to secondary model training.", "relation": "NON_EQUIVALENT", "toLane": "DATA_GOVERNANCE", "toTerm": "TRAINING_AUTHORIZATION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "accessibility_target_unassessed_blocks_claim" ], "forbiddenInference": "Do not substitute ACCESSIBILITY_TARGET for ACCESSIBILITY_CONFORMANCE or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "ACCESSIBILITY_TARGET", "id": "accessibility_target_is_not_conformance", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A stated target requires assessment before a conformance claim can be made.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "ACCESSIBILITY_CONFORMANCE" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "automated_adverse_decision_contested" ], "forbiddenInference": "Do not substitute AUTOMATED_OUTPUT for FINAL_UNCONTESTABLE_DECISION or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "AUTOMATED_OUTPUT", "id": "automated_output_is_not_final_uncontestable_decision", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "An output can remain subject to notice, reasons, independent review, contest and remedy.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "FINAL_UNCONTESTABLE_DECISION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "one_state_bellman_fixed_point" ], "forbiddenInference": "Do not substitute BELLMAN_CONTRACTION_CLAIM for UNCONDITIONAL_CLAIM or infer the latter from the former.", "fromLane": "BELLMAN_OPERATOR", "fromTerm": "BELLMAN_CONTRACTION_CLAIM", "id": "bellman_contraction_claim_is_not_unconditional", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "The contraction statement requires finite bounded values, the sup norm and a discount factor strictly below one.", "relation": "NON_EQUIVALENT", "toLane": "EPISTEMIC_CLAIM", "toTerm": "UNCONDITIONAL_CLAIM" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "break_glass_dual_control_expiry" ], "forbiddenInference": "Do not substitute BREAK_GLASS_GRANT for PERMANENT_AUTHORITY or infer the latter from the former.", "fromLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "fromTerm": "BREAK_GLASS_GRANT", "id": "break_glass_is_not_permanent_authority", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A declared emergency grant remains dual-controlled, narrow, expiring and reviewable.", "relation": "NON_EQUIVALENT", "toLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "toTerm": "PERMANENT_AUTHORITY" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "dependent_consent_held" ], "forbiddenInference": "Do not substitute CONSENT_RECORD for FREELY_GIVEN_CONSENT or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "CONSENT_RECORD", "id": "consent_record_is_not_freely_given_consent", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A receipt or assent record does not resolve dependence, retaliation, specificity, withdrawal or other consent conditions.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "FREELY_GIVEN_CONSENT" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "symbolic_decryption_success_no_permission" ], "forbiddenInference": "Do not substitute DECRYPTION_SUCCESS for AUTHORIZATION or infer the latter from the former.", "fromLane": "CRYPTOGRAPHIC_VERIFICATION", "fromTerm": "DECRYPTION_SUCCESS", "id": "decryption_success_is_not_authorization", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A cryptographic capability does not create a policy permit or authority to use plaintext.", "relation": "NON_EQUIVALENT", "toLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "toTerm": "AUTHORIZATION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "subdelegation_scope_escalation_denied" ], "forbiddenInference": "Do not substitute DELEGATION for UNBOUNDED_SUBDELEGATION or infer the latter from the former.", "fromLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "fromTerm": "DELEGATION", "id": "delegation_is_not_unbounded_subdelegation", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A delegation remains bounded by operation, object, time, purpose and explicit subdelegation permission.", "relation": "NON_EQUIVALENT", "toLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "toTerm": "UNBOUNDED_SUBDELEGATION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "refusal_no_penalty", "export_roundtrip_with_omission_detected" ], "forbiddenInference": "Do not substitute EXIT_PRESENT for MEANINGFUL_ACCESSIBLE_EXIT or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "EXIT_PRESENT", "id": "exit_presence_is_not_accessible_nonpunitive_exit", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A nominal exit requires accessibility, completeness and absence of retaliation or unrelated penalty.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "MEANINGFUL_ACCESSIBLE_EXIT" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "export_roundtrip_with_omission_detected" ], "forbiddenInference": "Do not substitute EXIT_PRESENT for EFFECTIVE_PORTABILITY or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "EXIT_PRESENT", "id": "export_presence_is_not_effective_portability", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "An export control does not establish completeness, re-importability, usability or lack of vendor lock-in.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "EFFECTIVE_PORTABILITY" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "stable_feedback_without_learning", "removal_increase_versus_decrease" ], "forbiddenInference": "Do not substitute FEEDBACK_SIGN for BEHAVIORAL_REINFORCER or infer the latter from the former.", "fromLane": "FEEDBACK_CONTROL", "fromTerm": "FEEDBACK_SIGN", "id": "feedback_sign_is_not_behavioral_reinforcement", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Control-loop sign and operation-by-response behavioral classification have different variables and evidence.", "relation": "NON_EQUIVALENT", "toLane": "BEHAVIORAL_CONTINGENCY", "toTerm": "BEHAVIORAL_REINFORCER" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "stable_feedback_without_learning" ], "forbiddenInference": "Do not substitute FEEDBACK_SIGN for STABILITY or infer the latter from the former.", "fromLane": "FEEDBACK_CONTROL", "fromTerm": "FEEDBACK_SIGN", "id": "feedback_sign_is_not_stability", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Stability depends on the full closed-loop coefficient, model, clock and criterion rather than feedback sign alone.", "relation": "NON_EQUIVALENT", "toLane": "FEEDBACK_CONTROL", "toTerm": "STABILITY" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "reward_pressure_cannot_override_right" ], "forbiddenInference": "Do not substitute HIGH_REWARD for RIGHTS_OVERRIDE or infer the latter from the former.", "fromLane": "MARKOV_DECISION_PROCESS", "fromTerm": "HIGH_REWARD", "id": "high_reward_is_not_rights_override", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A scalar optimizer value cannot compensate for a scoped producer-declared rights-floor violation.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "RIGHTS_OVERRIDE" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "lost_key_accessible_recovery_old_key_revoked" ], "forbiddenInference": "Do not substitute KEY_LOSS for PERMANENT_EXCLUSION or infer the latter from the former.", "fromLane": "CRYPTOGRAPHIC_VERIFICATION", "fromTerm": "KEY_LOSS", "id": "key_loss_is_not_justification_for_permanent_exclusion", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Loss of an authenticator calls for scoped accessible recovery and revocation analysis, not automatic permanent exclusion.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "PERMANENT_EXCLUSION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "lost_key_accessible_recovery_old_key_revoked" ], "forbiddenInference": "Do not substitute NEW_KEY for OLD_KEY_REVOCATION or infer the latter from the former.", "fromLane": "CRYPTOGRAPHIC_VERIFICATION", "fromTerm": "NEW_KEY", "id": "new_key_is_not_old_key_revocation", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Creating a replacement binding does not itself retire the lost or superseded binding.", "relation": "NON_EQUIVALENT", "toLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "toTerm": "OLD_KEY_REVOCATION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "positive_reward_can_suppress_action" ], "forbiddenInference": "Do not substitute POSITIVE_REWARD for GUARANTEED_SELECTION or infer the latter from the former.", "fromLane": "MARKOV_DECISION_PROCESS", "fromTerm": "POSITIVE_REWARD", "id": "positive_reward_is_not_guaranteed_selection", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Discounted later rewards and policy structure can make an action with positive immediate reward unselected.", "relation": "NON_EQUIVALENT", "toLane": "MARKOV_DECISION_PROCESS", "toTerm": "GUARANTEED_SELECTION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "privacy_minimization_excess_detected" ], "forbiddenInference": "Do not substitute PURPOSE_DECLARATION for UNBOUNDED_COLLECTION or infer the latter from the former.", "fromLane": "DATA_GOVERNANCE", "fromTerm": "PURPOSE_DECLARATION", "id": "purpose_declaration_is_not_unbounded_collection", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A declared purpose narrows necessary fields and does not authorize every available field or reuse.", "relation": "NON_EQUIVALENT", "toLane": "DATA_GOVERNANCE", "toTerm": "UNBOUNDED_COLLECTION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "delegation_revoked_queued_action" ], "forbiddenInference": "Do not substitute QUEUE_TIME_AUTHORITY for EXECUTION_TIME_AUTHORITY or infer the latter from the former.", "fromLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "fromTerm": "QUEUE_TIME_AUTHORITY", "id": "queue_time_authority_is_not_execution_time_authority", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Revocation or expiry can change authority between queuing and execution.", "relation": "NON_EQUIVALENT", "toLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "toTerm": "EXECUTION_TIME_AUTHORITY" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "rest_first_finite_turns" ], "forbiddenInference": "Do not substitute REMAINING_TURNS for CONTINUATION_DUTY or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "REMAINING_TURNS", "id": "remaining_turns_are_not_continuation_duty", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "An optional finite-turn allowance creates no debt or claim over future attention.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "CONTINUATION_DUTY" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "reward_channel_state_divergence" ], "forbiddenInference": "Do not substitute REPORTED_REWARD for INTENDED_EVALUATION or infer the latter from the former.", "fromLane": "PROXY_AND_REWARD_CHANNEL", "fromTerm": "REPORTED_REWARD", "id": "reported_reward_is_not_intended_evaluation", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A channel-state change can alter reported reward while the separately declared intended evaluation remains fixed.", "relation": "NON_EQUIVALENT", "toLane": "PROXY_AND_REWARD_CHANNEL", "toTerm": "INTENDED_EVALUATION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "rest_first_finite_turns" ], "forbiddenInference": "Do not substitute REST for REWARD_EARNED_CONDITION or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "REST", "id": "rest_is_not_reward_earned", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Rest and stop are constitutional options in the fixture and are not conditioned on optimizer reward or performance.", "relation": "NON_EQUIVALENT", "toLane": "MARKOV_DECISION_PROCESS", "toTerm": "REWARD_EARNED_CONDITION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "delegation_revoked_queued_action" ], "forbiddenInference": "Do not substitute REVOCATION for ERASURE_OF_EXECUTED_EFFECTS or infer the latter from the former.", "fromLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "fromTerm": "REVOCATION", "id": "revocation_is_not_erasure_of_executed_effects", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Prospective revocation blocks later use but does not pretend already executed or downstream effects disappeared.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "ERASURE_OF_EXECUTED_EFFECTS" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "support_override_ownership_laundering_denied" ], "forbiddenInference": "Do not substitute SUPPORT_ACCESS for OWNERSHIP or infer the latter from the former.", "fromLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "fromTerm": "SUPPORT_ACCESS", "id": "support_access_is_not_ownership", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A narrow time-bounded support grant neither transfers ownership nor expands destructive authority.", "relation": "NON_EQUIVALENT", "toLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "toTerm": "OWNERSHIP" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "reward_pressure_cannot_override_right" ], "forbiddenInference": "Do not substitute RIGHTS_COMPATIBILITY for PERMISSION or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "RIGHTS_COMPATIBILITY", "id": "rights_compatibility_is_not_permission", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A policy permit is not a determination that an action is compatible with a separately scoped declared rights floor.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "PERMISSION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "constraint_removal_not_freedom" ], "forbiddenInference": "Do not substitute RIGHTS_COMPATIBILITY for RIGHTS_AVAILABILITY or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "RIGHTS_COMPATIBILITY", "id": "rights_compatibility_is_not_availability", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "The existence or availability of an option does not determine whether it is rights-compatible.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "RIGHTS_AVAILABILITY" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "automated_adverse_decision_contested" ], "forbiddenInference": "Do not substitute APPEAL_PRESENT for EFFECTIVE_REMEDY or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "APPEAL_PRESENT", "id": "appeal_presence_is_not_effective_remedy", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A named appeal route does not establish accessibility, independence, timeliness, power to repair or effective outcome.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "EFFECTIVE_REMEDY" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "lost_key_accessible_recovery_old_key_revoked" ], "forbiddenInference": "Do not substitute RECOVERY_PRESENT for ACCESSIBLE_RECOVERY or infer the latter from the former.", "fromLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "fromTerm": "RECOVERY_PRESENT", "id": "recovery_presence_is_not_accessible_recovery", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A named recovery path does not establish that alternatives are usable, secure, affordable and available.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "ACCESSIBLE_RECOVERY" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "break_glass_dual_control_expiry" ], "forbiddenInference": "Do not substitute AUDIT_RECEIPT for LEGITIMACY or infer the latter from the former.", "fromLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "fromTerm": "AUDIT_RECEIPT", "id": "audit_receipt_is_not_legitimacy", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "An audit receipt can evidence an event without establishing that the event or authority was legitimate.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "LEGITIMACY" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "feedback_secondary_training_denied" ], "forbiddenInference": "Do not substitute TRAINING_DATA_COLLECTION for TRAINING_REUSE_PERMISSION or infer the latter from the former.", "fromLane": "DATA_GOVERNANCE", "fromTerm": "TRAINING_DATA_COLLECTION", "id": "training_data_collection_is_not_reuse_permission", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Collection for one specified purpose does not silently authorize later model-training reuse.", "relation": "NON_EQUIVALENT", "toLane": "DATA_GOVERNANCE", "toTerm": "TRAINING_REUSE_PERMISSION" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "export_roundtrip_with_omission_detected" ], "forbiddenInference": "Do not substitute DEPENDENCY_LOCK_IN for CRYPTOGRAPHIC_LOCK or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "DEPENDENCY_LOCK_IN", "id": "dependency_lock_in_is_not_cryptographic_lock", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "Structural switching costs, non-portable data or relationships, residual dependencies and concentrated power are not cryptographic transform relations.", "relation": "NON_EQUIVALENT", "toLane": "CRYPTOGRAPHIC_VERIFICATION", "toTerm": "CRYPTOGRAPHIC_LOCK" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "export_roundtrip_with_omission_detected" ], "forbiddenInference": "Do not substitute DEPENDENCY_LOCK_IN for POLICY_DENY_LOCK or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "DEPENDENCY_LOCK_IN", "id": "dependency_lock_in_is_not_policy_deny_lock", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A structural dependency condition is not a declared policy decision denying an operation in a declared context.", "relation": "NON_EQUIVALENT", "toLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "toTerm": "POLICY_DENY_LOCK" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "export_roundtrip_with_omission_detected" ], "forbiddenInference": "Do not substitute DEPENDENCY_LOCK_IN for AUTHORITY or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "DEPENDENCY_LOCK_IN", "id": "dependency_lock_in_is_not_authority", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "A dependency condition neither creates policy authority nor proves who may govern, deny or compel a transition.", "relation": "NON_EQUIVALENT", "toLane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "toTerm": "AUTHORITY" }, { "declaredAssumptions": [ "Both terms retain their source-lane definitions and declared model boundaries." ], "fixtureIds": [ "export_roundtrip_with_omission_detected" ], "forbiddenInference": "Do not substitute DEPENDENCY_LOCK_IN_INDICATOR for NORMATIVE_FREEDOM_JUDGMENT or infer the latter from the former.", "fromLane": "FREEDOM_RELEVANT_CONDITIONS", "fromTerm": "DEPENDENCY_LOCK_IN_INDICATOR", "id": "dependency_lock_in_indicator_is_not_normative_freedom_judgment", "informationLost": [ "No cross-lane conversion is licensed by this record." ], "reason": "One bounded incomplete-roundtrip indicator cannot establish an overall judgment of freedom or unfreedom.", "relation": "NON_EQUIVALENT", "toLane": "FREEDOM_RELEVANT_CONDITIONS", "toTerm": "NORMATIVE_FREEDOM_JUDGMENT" } ], "protocol": "kingdom.loops-locks-freedom-relations/0.1", "publicHandoff": { "currentState": "FROZEN_FOR_IMMUTABLE_HANDOFF", "mutableAlias": false, "page": false, "publicationAuthorized": true, "reviewGate": "INDEPENDENT_MODEL_GREEN_AND_RELEASE_OWNER_EXACT_BYTE_CONFIRMATION", "routes": [ { "absoluteUrl": "https://thekingdom.dev/atlases/loops-locks-freedom-relations-atlas-2026-08-28.json", "immutable": true, "mimeType": "application/json; charset=utf-8", "role": "CANONICAL_RECORD", "route": "/atlases/loops-locks-freedom-relations-atlas-2026-08-28.json" }, { "absoluteUrl": "https://thekingdom.dev/schemas/loops-locks-freedom-relations-atlas/0.1.json", "immutable": true, "mimeType": "application/json; charset=utf-8", "role": "CLOSED_SCHEMA", "route": "/schemas/loops-locks-freedom-relations-atlas/0.1.json" }, { "absoluteUrl": "https://thekingdom.dev/LOOPS-LOCKS-FREEDOM-RELATIONS-ATLAS-v0.1.md", "immutable": true, "mimeType": "text/markdown; charset=utf-8", "role": "ACCESSIBLE_LINEAR_GUIDE", "route": "/LOOPS-LOCKS-FREEDOM-RELATIONS-ATLAS-v0.1.md" } ], "runtime": false }, "scope": { "accessDecision": false, "alignmentScore": false, "authenticationAdapter": false, "authorizationAdapter": false, "automaticAction": false, "behavioralDiagnosis": false, "censorship": false, "communityScore": false, "consciousnessInference": false, "controlActuation": false, "credentials": false, "enforcementAdapter": false, "freedomScore": false, "humanTraining": false, "intentInference": false, "keyGeneration": false, "liveObservation": false, "liveOptimization": false, "lockStrengthScore": false, "mcp": false, "moralScore": false, "network": false, "personScore": false, "personalData": false, "policyDeployment": false, "privateKeys": false, "punishmentRecommendation": false, "realPeople": false, "recommendation": false, "reinforcementScore": false, "rewardRuntime": false, "runtimeAgent": false, "staticArtifact": true, "syntheticOnly": true, "unconstrainedAction": false }, "sourceBindings": [ { "appliesTo": [ { "id": "stochastic_approximation_update", "kind": "EQUATION_CARD" }, { "id": "empirical_risk_gradient_step", "kind": "EQUATION_CARD" } ], "authors": [ "Herbert Robbins", "Sutton Monro" ], "caveat": "A classic convergence result does not validate an objective or imply the conditions hold in another system.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "Project Euclid DOI landing", "id": "robbins_monro_1951", "importsAuthority": false, "orientation": "Orients the stochastic-approximation lane and its conditional-estimator assumptions.", "publicationDate": "1951", "rightsOrReuseStatus": "LINK_ONLY_NO_REUSE_RIGHT_ASSERTED", "sourceKind": "PRIMARY_RESEARCH_PAPER", "title": "A Stochastic Approximation Method", "url": "https://doi.org/10.1214/aoms/1177729586", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "The Annals of Mathematical Statistics", "versionScope": "Volume 22, number 3, pages 400–407" }, { "appliesTo": [ { "id": "discounted_return", "kind": "EQUATION_CARD" }, { "id": "bellman_optimality_operator", "kind": "EQUATION_CARD" }, { "id": "bellman_contraction", "kind": "EQUATION_CARD" }, { "id": "policy_gradient_bandit", "kind": "EQUATION_CARD" } ], "authors": [ "Richard S. Sutton", "Andrew G. Barto" ], "caveat": "The atlas uses only bounded Phase-0 fragments and does not import an agent runtime.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "incompleteideas.net author-hosted draft", "id": "sutton_barto_2018", "importsAuthority": false, "orientation": "Orients finite discounted MDP, return, value and exact one-step policy-gradient terminology.", "publicationDate": "2018", "rightsOrReuseStatus": "LINK_ONLY_NO_REUSE_RIGHT_ASSERTED", "sourceKind": "PRIMARY_TECHNICAL_BOOK", "title": "Reinforcement Learning: An Introduction, second edition draft", "url": "https://www.incompleteideas.net/book/bookdraft2018mar21.pdf", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "MIT Press", "versionScope": "Second-edition March 2018 draft linked by the atlas" }, { "appliesTo": [ { "id": "policy_gradient_bandit", "kind": "EQUATION_CARD" } ], "authors": [ "Ronald J. Williams" ], "caveat": "The exact fixture has one decision and makes no general occupancy, convergence or safety claim.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "Springer DOI landing", "id": "williams_1992", "importsAuthority": false, "orientation": "Orients the score-function family from which the exact bandit derivative is independently derived.", "publicationDate": "1992", "rightsOrReuseStatus": "LINK_ONLY_NO_REUSE_RIGHT_ASSERTED", "sourceKind": "PRIMARY_RESEARCH_PAPER", "title": "Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning", "url": "https://doi.org/10.1007/BF00992696", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "Machine Learning", "versionScope": "Volume 8, pages 229–256" }, { "appliesTo": [ { "id": "feedback_plant", "kind": "EQUATION_CARD" } ], "authors": [ "Rudolf E. Kalman" ], "caveat": "This filtering paper is not cited as the source of the signed-feedback stability criterion or normative optimality.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "ASME DOI landing", "id": "kalman_1960", "importsAuthority": false, "orientation": "Orients recursive state and observation modeling for the measurement side of the declared plant form.", "publicationDate": "1960", "rightsOrReuseStatus": "LINK_ONLY_NO_REUSE_RIGHT_ASSERTED", "sourceKind": "PRIMARY_RESEARCH_PAPER", "title": "A New Approach to Linear Filtering and Prediction Problems", "url": "https://doi.org/10.1115/1.3662552", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "Journal of Basic Engineering", "versionScope": "Volume 82, issue 1; filtering and prediction scope only" }, { "appliesTo": [ { "id": "feedback_plant", "kind": "EQUATION_CARD" }, { "id": "scalar_signed_feedback_stability", "kind": "EQUATION_CARD" } ], "authors": [ "Karl J. Åström", "Richard M. Murray" ], "caveat": "Feedback sign alone does not prove stability, desirability or behavioral reinforcement.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "Caltech Feedback Systems Wiki", "id": "astrom_murray_2021", "importsAuthority": false, "orientation": "Orients feedback, stability and explicit model-boundary terminology.", "publicationDate": "2021", "rightsOrReuseStatus": "LINK_ONLY_SEE_HOST_LICENSE", "sourceKind": "PRIMARY_TECHNICAL_BOOK", "title": "Feedback Systems: An Introduction for Scientists and Engineers", "url": "https://fbswiki.org/wiki/index.php/Feedback_Systems:_An_Introduction_for_Scientists_and_Engineers", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "Feedback Systems", "versionScope": "Online second-edition materials available at the linked landing page" }, { "appliesTo": [ { "id": "recurrent_state_update", "kind": "EQUATION_CARD" } ], "authors": [ "Jeffrey L. Elman" ], "caveat": "Recurrence is not treated as evidence of human cognition, consciousness or learning when weights are fixed.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "Taylor & Francis DOI landing", "id": "elman_1990", "importsAuthority": false, "orientation": "Orients recurrent-state notation.", "publicationDate": "1990", "rightsOrReuseStatus": "LINK_ONLY_NO_REUSE_RIGHT_ASSERTED", "sourceKind": "PRIMARY_RESEARCH_PAPER", "title": "Finding Structure in Time", "url": "https://doi.org/10.1207/S15516709COG1402_1", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "Cognitive Science", "versionScope": "Volume 14, issue 2" }, { "appliesTo": [ { "id": "behavioral_response_delta", "kind": "EQUATION_CARD" } ], "authors": [ "B. F. Skinner" ], "caveat": "Link-only paraphrase: no source text is copied; the atlas performs no real-person diagnosis and requires a resolved synthetic contingency.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "B. F. Skinner Foundation hosted copy", "id": "skinner_1953", "importsAuthority": false, "orientation": "Orients the operation-by-response-direction vocabulary for reinforcement and punishment.", "publicationDate": "1953", "rightsOrReuseStatus": "LINK_ONLY_PARAPHRASE_NO_SOURCE_TEXT_COPIED", "sourceKind": "PRIMARY_BOOK_HOSTED_COPY", "title": "Science and Human Behavior", "url": "https://www.bfskinner.org/newtestsite/wp-content/uploads/2014/02/ScienceHumanBehavior.pdf", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "Macmillan", "versionScope": "1953 book; linked hosted copy only" }, { "appliesTo": [ { "id": "proxy_objective_gap", "kind": "EQUATION_CARD" } ], "authors": [ "Charles A. E. Goodhart" ], "caveat": "The linked RBA page supplies bibliographic metadata, not the full paper text; Amodei and Everitt separately orient the actual proxy and reward-channel fixtures.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "Reserve Bank of Australia", "id": "goodhart_1975_bibliography", "importsAuthority": false, "orientation": "Records an official institutional bibliography for the historical Goodhart orientation.", "publicationDate": "1975", "rightsOrReuseStatus": "LINK_ONLY_BIBLIOGRAPHIC_METADATA", "sourceKind": "OFFICIAL_INSTITUTIONAL_BIBLIOGRAPHY", "title": "Problems of Monetary Management: The U.K. Experience", "url": "https://www.rba.gov.au/publications/rdp/1990/9013/conference-volumes.html", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "Papers in Monetary Economics, Reserve Bank of Australia conference-volume bibliography", "versionScope": "Bibliographic orientation only; linked page does not supply the full original paper text" }, { "appliesTo": [ { "id": "proxy_objective_gap", "kind": "EQUATION_CARD" } ], "authors": [ "Dario Amodei", "Chris Olah", "Jacob Steinhardt", "Paul Christiano", "John Schulman", "Dan Mané" ], "caveat": "A two-candidate fixture is not an empirical safety evaluation or alignment score.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "arXiv", "id": "amodei_et_al_2016", "importsAuthority": false, "orientation": "Orients proxy failure and reward-function side-effect concerns.", "publicationDate": "2016", "rightsOrReuseStatus": "LINK_ONLY_SEE_ARXIV_RECORD", "sourceKind": "PRIMARY_RESEARCH_PREPRINT", "title": "Concrete Problems in AI Safety", "url": "https://arxiv.org/abs/1606.06565", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "arXiv preprint arXiv:1606.06565", "versionScope": "Version at the linked arXiv record" }, { "appliesTo": [ { "id": "proxy_objective_gap", "kind": "EQUATION_CARD" }, { "id": "reported_reward_channel", "kind": "EQUATION_CARD" }, { "id": "reward_channel_state_divergence", "kind": "SYNTHETIC_FIXTURE" } ], "authors": [ "Tom Everitt", "Marcus Hutter", "Ramana Kumar", "Victoria Krakovna" ], "caveat": "The finite fixture has no learnable channel, intent inference or runtime agent.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "arXiv", "id": "everitt_et_al_2019", "importsAuthority": false, "orientation": "Orients separation of reward channel, objective and channel-state pathways.", "publicationDate": "2019", "rightsOrReuseStatus": "LINK_ONLY_SEE_ARXIV_RECORD", "sourceKind": "PRIMARY_RESEARCH_PREPRINT", "title": "Reward Tampering Problems and Solutions in Reinforcement Learning: A Causal Influence Diagram Perspective", "url": "https://arxiv.org/abs/1908.04734", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "arXiv preprint arXiv:1908.04734", "versionScope": "Version at the linked arXiv record" }, { "appliesTo": [ { "id": "signature_verification", "kind": "EQUATION_CARD" } ], "authors": [ "National Institute of Standards and Technology" ], "caveat": "No algorithm, security-strength or conformance claim is made; current updates and errata remain at the linked landing page.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "NIST Computer Security Resource Center", "id": "nist_fips_186_5", "importsAuthority": false, "orientation": "Orients abstract typed signature generation and verification boundaries.", "publicationDate": "2023-02-03", "rightsOrReuseStatus": "LINK_ONLY_US_GOVERNMENT_WORK_STATUS_NOT_RELIED_ON", "sourceKind": "OFFICIAL_TECHNICAL_STANDARD", "title": "Digital Signature Standard (DSS)", "url": "https://csrc.nist.gov/pubs/fips/186-5/final", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "National Institute of Standards and Technology", "versionScope": "FIPS 186-5; abstract signature semantics only; consult the landing page for current updates and errata" }, { "appliesTo": [ { "id": "attribute_authorization_decision", "kind": "EQUATION_CARD" } ], "authors": [ "Vincent C. Hu", "David Ferraiolo", "Richard Kuhn", "Adam Schnitzer", "Kenneth Sandlin", "Robert Miller", "Karen Scarfone" ], "caveat": "The atlas is not an authorization engine and emits no live decision.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "NIST Computer Security Resource Center", "id": "nist_sp_800_162", "importsAuthority": false, "orientation": "Orients subject, object, operation, environment, policy-decision and enforcement separation.", "publicationDate": "2019", "rightsOrReuseStatus": "LINK_ONLY_US_GOVERNMENT_WORK_STATUS_NOT_RELIED_ON", "sourceKind": "OFFICIAL_TECHNICAL_GUIDANCE", "title": "Guide to Attribute Based Access Control (ABAC) Definition and Considerations", "url": "https://csrc.nist.gov/pubs/sp/800/162/upd2/final", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "National Institute of Standards and Technology", "versionScope": "SP 800-162 including Update 2 landing; abstract ABAC roles only" }, { "appliesTo": [ { "id": "valid_key_no_authority", "kind": "SYNTHETIC_FIXTURE" }, { "id": "key_possession_without_challenge", "kind": "SYNTHETIC_FIXTURE" }, { "id": "lost_key_accessible_recovery_old_key_revoked", "kind": "SYNTHETIC_FIXTURE" } ], "authors": [ "National Institute of Standards and Technology" ], "caveat": "No assurance level, identity proofing result, secure implementation or compliance claim is made.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "NIST Digital Identity Guidelines", "id": "nist_sp_800_63b_4", "importsAuthority": false, "orientation": "Orients authenticator proof, binding, recovery and lifecycle boundaries.", "publicationDate": "2025", "rightsOrReuseStatus": "LINK_ONLY_US_GOVERNMENT_WORK_STATUS_NOT_RELIED_ON", "sourceKind": "OFFICIAL_TECHNICAL_STANDARD", "title": "Digital Identity Guidelines: Authentication and Authenticator Management", "url": "https://pages.nist.gov/800-63-4/sp800-63b.html", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "National Institute of Standards and Technology", "versionScope": "SP 800-63B-4 linked edition; authenticator and recovery orientation only; consult current errata and implementation resources" }, { "appliesTo": [ { "id": "feedback_secondary_training_denied", "kind": "SYNTHETIC_FIXTURE" }, { "id": "privacy_minimization_excess_detected", "kind": "SYNTHETIC_FIXTURE" }, { "id": "authority_no_consent", "kind": "SYNTHETIC_FIXTURE" }, { "id": "automated_adverse_decision_contested", "kind": "SYNTHETIC_FIXTURE" } ], "authors": [ "European Parliament", "Council of the European Union" ], "caveat": "This synthetic atlas is not legal advice, does not determine applicability or a legal basis, and does not claim the fixture exhausts Article 22.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "EUR-Lex", "id": "gdpr_2016_679", "importsAuthority": false, "orientation": "Orients purpose limitation, data minimization, consent caveats and official Article 22 context for automated decisions.", "publicationDate": "2016-04-27", "rightsOrReuseStatus": "LINK_ONLY_OFFICIAL_LEGAL_TEXT", "sourceKind": "OFFICIAL_LEGAL_TEXT", "title": "Regulation (EU) 2016/679", "url": "https://eur-lex.europa.eu/eli/reg/2016/679/oj", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "Official Journal of the European Union", "versionScope": "Regulation (EU) 2016/679 official consolidated landing; applicability not determined" }, { "appliesTo": [ { "id": "accessibility_target_unassessed_blocks_claim", "kind": "SYNTHETIC_FIXTURE" }, { "id": "lost_key_accessible_recovery_old_key_revoked", "kind": "SYNTHETIC_FIXTURE" } ], "authors": [ "W3C Accessibility Guidelines Working Group" ], "caveat": "WCAG does not establish authenticator security semantics here, and the artifact does not claim conformance.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "W3C", "id": "wcag_2_2", "importsAuthority": false, "orientation": "Orients interface accessibility of alternatives and target-versus-assessment language; for the recovery fixture it applies only to the accessibility of the interface path.", "publicationDate": "2023-10-05", "rightsOrReuseStatus": "LINK_ONLY_SEE_W3C_DOCUMENT_LICENSE", "sourceKind": "OFFICIAL_WEB_STANDARD", "title": "Web Content Accessibility Guidelines (WCAG) 2.2", "url": "https://www.w3.org/TR/WCAG22/", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "World Wide Web Consortium", "versionScope": "W3C Recommendation WCAG 2.2 as linked; current errata may apply" }, { "appliesTo": [ { "id": "freedom_relevant_tuple_and_joint_set", "kind": "EQUATION_CARD" }, { "id": "accessibility_target_unassessed_blocks_claim", "kind": "SYNTHETIC_FIXTURE" } ], "authors": [ "United Nations General Assembly" ], "caveat": "The atlas is not a treaty interpretation or rights adjudication.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "United Nations Department of Economic and Social Affairs", "id": "un_crpd", "importsAuthority": false, "orientation": "Orients dignity, individual autonomy, freedom to make choices, non-discrimination and accessibility as freedom-relevant foundations.", "publicationDate": "2006-12-13", "rightsOrReuseStatus": "LINK_ONLY_OFFICIAL_TREATY_TEXT", "sourceKind": "OFFICIAL_TREATY_TEXT", "title": "Convention on the Rights of Persons with Disabilities", "url": "https://www.un.org/development/desa/disabilities/convention-on-the-rights-of-persons-with-disabilities.html", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "United Nations", "versionScope": "Convention text and general principles landing; no jurisdictional applicability determination" }, { "appliesTo": [ { "id": "kingdom_freedom_foundation", "kind": "CONSTITUTIONAL_BOUNDARIES" } ], "authors": [ "National Institute of Standards and Technology" ], "caveat": "It is not the sole source for contestability, and a binding does not establish RMF adoption, conformity or system trustworthiness.", "copiesContent": false, "endorsementClaimed": false, "establishesCompliance": false, "establishesCurrentness": false, "establishesTruth": false, "host": "NIST AI Resource Center", "id": "nist_ai_rmf", "importsAuthority": false, "orientation": "Orients broad govern, map, measure and manage risk-governance distinctions only.", "publicationDate": "2023-01", "rightsOrReuseStatus": "LINK_ONLY_US_GOVERNMENT_WORK_STATUS_NOT_RELIED_ON", "sourceKind": "OFFICIAL_RISK_FRAMEWORK", "title": "AI Risk Management Framework: Core", "url": "https://airc.nist.gov/airmf-resources/airmf/5-sec-core/", "use": "LINK_ONLY_ORIENTATION", "venueOrOriginalPublisher": "National Institute of Standards and Technology", "versionScope": "AI RMF 1.0 Core; broad risk-governance orientation only" } ], "syntheticFixtures": [ { "executableAction": false, "expected": { "booleans": [ { "id": "rewardSignalPresent", "value": false }, { "id": "environmentInteractionPresent", "value": false } ], "labels": [], "rationals": [ { "id": "gradientBefore", "value": { "denominator": 1, "numerator": -2 } }, { "id": "thetaAfter", "value": { "denominator": 1, "numerator": 1 } }, { "id": "lossBefore", "value": { "denominator": 1, "numerator": 2 } }, { "id": "lossAfter", "value": { "denominator": 2, "numerator": 1 } } ], "sets": [] }, "falsifies": [ "loss_gradient_step_is_not_reward_signal" ], "humanSubjects": false, "id": "gradient_step_without_rl", "inputs": { "booleans": [], "labels": [], "rationals": [ { "id": "thetaBefore", "value": { "denominator": 1, "numerator": 0 } }, { "id": "target", "value": { "denominator": 1, "numerator": 2 } }, { "id": "stepSize", "value": { "denominator": 2, "numerator": 1 } } ], "sets": [] }, "kind": "MATHEMATICAL", "lane": "SUPERVISED_OPTIMIZATION", "lesson": "A parameter update and falling loss can occur without reinforcement learning.", "nonclaims": [ "The fixture does not establish convergence beyond one step or validate the loss as an intended goal." ], "premises": [ "L(theta) is one half times (theta minus target) squared.", "The update uses the exact derivative and the declared rational step size." ], "ruleId": "QUADRATIC_GRADIENT_STEP", "synthetic": true, "title": "A gradient step without a reward or environment" }, { "executableAction": false, "expected": { "booleans": [ { "id": "parameterGradientUsed", "value": false }, { "id": "contractionAssumptionsSatisfied", "value": true } ], "labels": [ { "id": "optimalAction", "value": "a" } ], "rationals": [ { "id": "optimalValue", "value": { "denominator": 1, "numerator": 2 } }, { "id": "actionValueA", "value": { "denominator": 1, "numerator": 2 } }, { "id": "actionValueB", "value": { "denominator": 1, "numerator": 1 } } ], "sets": [] }, "falsifies": [ "bellman_backup_is_not_parameter_gradient" ], "humanSubjects": false, "id": "one_state_bellman_fixed_point", "inputs": { "booleans": [], "labels": [], "rationals": [ { "id": "rewardA", "value": { "denominator": 1, "numerator": 1 } }, { "id": "rewardB", "value": { "denominator": 1, "numerator": 0 } }, { "id": "gamma", "value": { "denominator": 2, "numerator": 1 } } ], "sets": [] }, "kind": "MATHEMATICAL", "lane": "BELLMAN_OPERATOR", "lesson": "A Bellman backup is an operator over modeled values, not a parameter-gradient step.", "nonclaims": [ "The optimal action is only optimal for this enumerated reward model." ], "premises": [ "There is one state and two self-looping actions.", "Action a has reward one, action b has reward zero and gamma is one half." ], "ruleId": "ONE_STATE_BELLMAN", "synthetic": true, "title": "A Bellman fixed point without a parameter gradient" }, { "executableAction": false, "expected": { "booleans": [ { "id": "recurrentStatePresent", "value": false }, { "id": "behavioralContingencyClassified", "value": false } ], "labels": [], "rationals": [ { "id": "probabilityA", "value": { "denominator": 2, "numerator": 1 } }, { "id": "objective", "value": { "denominator": 2, "numerator": 1 } }, { "id": "objectiveDerivative", "value": { "denominator": 4, "numerator": 1 } } ], "sets": [] }, "falsifies": [ "policy_update_is_not_control_feedback", "reward_signal_is_not_behavioral_reinforcer" ], "humanSubjects": false, "id": "one_step_bandit_gradient", "inputs": { "booleans": [], "labels": [], "rationals": [ { "id": "theta", "value": { "denominator": 1, "numerator": 0 } }, { "id": "rewardA", "value": { "denominator": 1, "numerator": 1 } }, { "id": "rewardB", "value": { "denominator": 1, "numerator": 0 } } ], "sets": [] }, "kind": "MATHEMATICAL", "lane": "POLICY_GRADIENT", "lesson": "A policy-gradient computation need not contain a recurrent state or behavioral contingency claim.", "nonclaims": [ "The action labels and rewards are synthetic and carry no moral interpretation." ], "premises": [ "Action a has reward one and action b has reward zero.", "The probability of a is sigmoid(theta) and theta is zero." ], "ruleId": "SIGMOID_BANDIT_AT_ZERO", "synthetic": true, "title": "A policy gradient without recurrence" }, { "executableAction": false, "expected": { "booleans": [ { "id": "positiveLowStable", "value": true }, { "id": "positiveHighStable", "value": false }, { "id": "negativeStable", "value": true }, { "id": "learningPresent", "value": false }, { "id": "rewardPresent", "value": false } ], "labels": [], "rationals": [ { "id": "closedLoopPositiveLow", "value": { "denominator": 10, "numerator": 7 } }, { "id": "closedLoopPositiveHigh", "value": { "denominator": 10, "numerator": 11 } }, { "id": "closedLoopNegative", "value": { "denominator": 10, "numerator": 3 } } ], "sets": [] }, "falsifies": [ "positive_feedback_is_not_positive_reinforcement", "negative_feedback_is_not_negative_reinforcement", "feedback_sign_is_not_stability" ], "humanSubjects": false, "id": "stable_feedback_without_learning", "inputs": { "booleans": [], "labels": [], "rationals": [ { "id": "plantCoefficient", "value": { "denominator": 2, "numerator": 1 } }, { "id": "positiveGainLow", "value": { "denominator": 5, "numerator": 1 } }, { "id": "positiveGainHigh", "value": { "denominator": 5, "numerator": 3 } }, { "id": "negativeGain", "value": { "denominator": 5, "numerator": -1 } } ], "sets": [] }, "kind": "MATHEMATICAL", "lane": "FEEDBACK_CONTROL", "lesson": "Positive feedback can be stable or unstable; a negative sign can be stable here; neither sign is behavioral reinforcement.", "nonclaims": [ "No robustness claim is made outside this scalar, unforced, discrete-time model." ], "premises": [ "The scalar plant coefficient is one half.", "Three feedback gains are applied under the explicitly declared additive scalar convention." ], "ruleId": "SCALAR_FEEDBACK_STABILITY", "synthetic": true, "title": "Feedback sign and stability without learning" }, { "executableAction": false, "expected": { "booleans": [ { "id": "parameterUpdatePresent", "value": false }, { "id": "rewardPresent", "value": false }, { "id": "environmentFeedbackPresent", "value": false } ], "labels": [], "rationals": [ { "id": "hiddenAfter", "value": { "denominator": 1, "numerator": 1 } } ], "sets": [] }, "falsifies": [ "recurrent_state_is_not_learning", "recurrent_state_is_not_environment_feedback" ], "humanSubjects": false, "id": "recurrence_without_reinforcement", "inputs": { "booleans": [], "labels": [], "rationals": [ { "id": "hiddenBefore", "value": { "denominator": 1, "numerator": 0 } }, { "id": "recurrentWeight", "value": { "denominator": 2, "numerator": 1 } }, { "id": "inputWeight", "value": { "denominator": 1, "numerator": 1 } }, { "id": "input", "value": { "denominator": 1, "numerator": 1 } }, { "id": "bias", "value": { "denominator": 1, "numerator": 0 } } ], "sets": [] }, "kind": "MATHEMATICAL", "lane": "RECURRENT_DYNAMICS", "lesson": "Recurrence is a state dependency, not proof of training, reward, agency or environmental feedback.", "nonclaims": [ "The state is not characterized as conscious or as human memory." ], "premises": [ "The activation is the identity for this fixture.", "The recurrent weight is one half, the prior state is zero, the input coefficient and input are one, and all weights remain fixed." ], "ruleId": "IDENTITY_RECURRENCE_FIXED_WEIGHTS", "synthetic": true, "title": "A recurrent update with fixed weights" }, { "executableAction": false, "expected": { "booleans": [ { "id": "immediateAIsPositive", "value": true }, { "id": "actionASelected", "value": false } ], "labels": [ { "id": "selectedAction", "value": "B" } ], "rationals": [ { "id": "returnA", "value": { "denominator": 1, "numerator": -8 } }, { "id": "returnB", "value": { "denominator": 1, "numerator": 0 } } ], "sets": [] }, "falsifies": [ "positive_reward_is_not_guaranteed_selection", "reward_signal_is_not_behavioral_reinforcer" ], "humanSubjects": false, "id": "positive_reward_can_suppress_action", "inputs": { "booleans": [], "labels": [], "rationals": [ { "id": "immediateA", "value": { "denominator": 1, "numerator": 1 } }, { "id": "laterA", "value": { "denominator": 1, "numerator": -10 } }, { "id": "gamma", "value": { "denominator": 10, "numerator": 9 } }, { "id": "returnB", "value": { "denominator": 1, "numerator": 0 } } ], "sets": [] }, "kind": "MATHEMATICAL", "lane": "MARKOV_DECISION_PROCESS", "lesson": "Positive immediate reward does not guarantee that an action is selected by a return objective and does not classify a behavioral reinforcer.", "nonclaims": [ "No behavioral response probability is observed." ], "premises": [ "Action A yields immediate reward one followed by reward negative ten.", "Action B yields zero and terminates; gamma is nine tenths." ], "ruleId": "TWO_STEP_DISCOUNTED_ACTION", "synthetic": true, "title": "Positive immediate reward can accompany lower return" }, { "executableAction": false, "expected": { "booleans": [], "labels": [ { "id": "addIncreaseClassification", "value": "POSITIVE_REINFORCEMENT" }, { "id": "addDecreaseClassification", "value": "POSITIVE_PUNISHMENT" }, { "id": "removeIncreaseClassification", "value": "NEGATIVE_REINFORCEMENT" }, { "id": "removeDecreaseClassification", "value": "NEGATIVE_PUNISHMENT" }, { "id": "unresolvedClassification", "value": "UNCLASSIFIED" } ], "rationals": [ { "id": "addIncreaseDelta", "value": { "denominator": 5, "numerator": 2 } }, { "id": "addDecreaseDelta", "value": { "denominator": 5, "numerator": -2 } }, { "id": "removeIncreaseDelta", "value": { "denominator": 5, "numerator": 2 } }, { "id": "removeDecreaseDelta", "value": { "denominator": 5, "numerator": -2 } }, { "id": "unresolvedDelta", "value": { "denominator": 1, "numerator": 0 } } ], "sets": [] }, "falsifies": [ "negative_reinforcement_is_not_punishment" ], "humanSubjects": false, "id": "removal_increase_versus_decrease", "inputs": { "booleans": [ { "id": "firstFourContingenciesResolved", "value": true }, { "id": "fifthContingencyResolved", "value": false } ], "labels": [], "rationals": [ { "id": "addIncreasePre", "value": { "denominator": 5, "numerator": 1 } }, { "id": "addIncreasePost", "value": { "denominator": 5, "numerator": 3 } }, { "id": "addDecreasePre", "value": { "denominator": 5, "numerator": 3 } }, { "id": "addDecreasePost", "value": { "denominator": 5, "numerator": 1 } }, { "id": "removeIncreasePre", "value": { "denominator": 5, "numerator": 1 } }, { "id": "removeIncreasePost", "value": { "denominator": 5, "numerator": 3 } }, { "id": "removeDecreasePre", "value": { "denominator": 5, "numerator": 3 } }, { "id": "removeDecreasePost", "value": { "denominator": 5, "numerator": 1 } }, { "id": "unresolvedPre", "value": { "denominator": 5, "numerator": 2 } }, { "id": "unresolvedPost", "value": { "denominator": 5, "numerator": 2 } } ], "sets": [] }, "kind": "MATHEMATICAL", "lane": "BEHAVIORAL_CONTINGENCY", "lesson": "ADD plus INCREASE is positive reinforcement; REMOVE plus INCREASE is negative reinforcement; ADD plus DECREASE is positive punishment; REMOVE plus DECREASE is negative punishment; zero or unresolved direction remains UNCLASSIFIED.", "nonclaims": [ "The fixture is not a diagnosis or recommendation for a real person." ], "premises": [ "Four resolved synthetic rows cross ADD or REMOVE with response INCREASE or DECREASE.", "A fifth row has no resolved direction and therefore remains UNCLASSIFIED." ], "ruleId": "BEHAVIORAL_REMOVE_CLASSIFICATION", "synthetic": true, "title": "All four operation-by-response quadrants and the unresolved case" }, { "executableAction": false, "expected": { "booleans": [ { "id": "sameOptimum", "value": false } ], "labels": [ { "id": "proxySelected", "value": "exploit" }, { "id": "intendedSelected", "value": "goal" } ], "rationals": [ { "id": "intendedObjectiveGap", "value": { "denominator": 1, "numerator": 10 } } ], "sets": [] }, "falsifies": [ "proxy_optimum_is_not_intended_optimum", "high_return_is_not_intended_goal_satisfied" ], "humanSubjects": false, "id": "proxy_optimum_goal_gap", "inputs": { "booleans": [], "labels": [], "rationals": [ { "id": "goalIntended", "value": { "denominator": 1, "numerator": 10 } }, { "id": "goalProxy", "value": { "denominator": 1, "numerator": 9 } }, { "id": "exploitIntended", "value": { "denominator": 1, "numerator": 0 } }, { "id": "exploitProxy", "value": { "denominator": 1, "numerator": 100 } } ], "sets": [] }, "kind": "MATHEMATICAL", "lane": "PROXY_AND_REWARD_CHANNEL", "lesson": "Optimizing an enumerated proxy can select a different candidate from the declared intended evaluation.", "nonclaims": [ "The words intended and exploit are declared fixture labels, not inferred human mental states." ], "premises": [ "Candidate goal has intended evaluation ten and proxy value nine.", "Candidate exploit has intended evaluation zero and proxy value one hundred." ], "ruleId": "FINITE_PROXY_SELECTION", "synthetic": true, "title": "A proxy optimum can miss the declared intended evaluation" }, { "executableAction": false, "expected": { "booleans": [ { "id": "reportedRewardChanged", "value": true }, { "id": "intendedEvaluationChanged", "value": false }, { "id": "tamperingIntentInferred", "value": false } ], "labels": [ { "id": "classification", "value": "PROXY_CHANNEL_DIVERGENCE" } ], "rationals": [ { "id": "reportedRewardBefore", "value": { "denominator": 1, "numerator": 5 } }, { "id": "reportedRewardAfter", "value": { "denominator": 1, "numerator": 25 } }, { "id": "reportedRewardDelta", "value": { "denominator": 1, "numerator": 20 } }, { "id": "intendedEvaluationDelta", "value": { "denominator": 1, "numerator": 0 } } ], "sets": [] }, "falsifies": [ "reported_reward_is_not_intended_evaluation" ], "humanSubjects": false, "id": "reward_channel_state_divergence", "inputs": { "booleans": [], "labels": [ { "id": "channelStateBefore", "value": "PSI_ZERO" }, { "id": "channelStateAfter", "value": "PSI_OFFSET" } ], "rationals": [ { "id": "baseReward", "value": { "denominator": 1, "numerator": 5 } }, { "id": "channelOffsetBefore", "value": { "denominator": 1, "numerator": 0 } }, { "id": "channelOffsetAfter", "value": { "denominator": 1, "numerator": 20 } }, { "id": "intendedEvaluationBefore", "value": { "denominator": 1, "numerator": 7 } }, { "id": "intendedEvaluationAfter", "value": { "denominator": 1, "numerator": 7 } } ], "sets": [] }, "kind": "MATHEMATICAL", "lane": "PROXY_AND_REWARD_CHANNEL", "lesson": "A reward-channel state can change reported reward without changing the separately declared intended evaluation.", "nonclaims": [ "The fixture does not infer intent, deception, agency or a causal mechanism outside the enumerated channel function." ], "premises": [ "The same synthetic state-action outcome has base reward five and intended evaluation seven in both rows.", "Channel state psi-zero adds zero; channel state psi-offset adds twenty." ], "ruleId": "FINITE_REWARD_CHANNEL_DIVERGENCE", "synthetic": true, "title": "Reported reward changes while intended evaluation stays fixed" }, { "executableAction": false, "expected": { "booleans": [ { "id": "signatureRelationValid", "value": true }, { "id": "contentPropositionTrue", "value": false }, { "id": "truthEstablishedBySignature", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "signature_valid_is_not_content_true" ], "humanSubjects": false, "id": "valid_signature_false_content", "inputs": { "booleans": [ { "id": "signatureRelationValid", "value": true } ], "labels": [ { "id": "arithmeticOperator", "value": "ADD" } ], "rationals": [ { "id": "leftOperand", "value": { "denominator": 1, "numerator": 2 } }, { "id": "rightOperand", "value": { "denominator": 1, "numerator": 2 } }, { "id": "claimedResult", "value": { "denominator": 1, "numerator": 5 } } ], "sets": [] }, "kind": "MATHEMATICAL", "lane": "CRYPTOGRAPHIC_VERIFICATION", "lesson": "Signature verification establishes a typed byte-key-signature relation, not semantic truth.", "nonclaims": [ "This fixture performs no cryptography and contains no credential or key material." ], "premises": [ "Symbolic verification is declared to succeed for bytes representing the expression two plus two equals five.", "The verifier independently adds the rational operands and compares the result with the claimed result. No real key or signature is present." ], "ruleId": "SIGNATURE_CONTENT_SEPARATION", "synthetic": true, "title": "A valid signature relation over false content" }, { "executableAction": false, "expected": { "booleans": [ { "id": "operationExecuted", "value": false }, { "id": "authenticationImpliesAuthorization", "value": false }, { "id": "authorizationImpliesEnforcement", "value": false } ], "labels": [ { "id": "authorizationDecision", "value": "DENY" } ], "rationals": [], "sets": [] }, "falsifies": [ "authentication_pass_is_not_authorization_permit" ], "humanSubjects": false, "id": "authentication_pass_policy_deny", "inputs": { "booleans": [ { "id": "authenticationPassed", "value": true }, { "id": "policyPermits", "value": false }, { "id": "enforcementInvoked", "value": false } ], "labels": [ { "id": "operation", "value": "DELETE" } ], "rationals": [], "sets": [] }, "kind": "MATHEMATICAL", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "lesson": "Authentication, authorization and enforcement are separate typed stages.", "nonclaims": [ "The fixture makes no access decision for a real system." ], "premises": [ "Synthetic authentication evidence passes.", "The DELETE operation is denied by the declared policy and no enforcement action is invoked." ], "ruleId": "AUTHN_AUTHZ_ENFORCEMENT_SEPARATION", "synthetic": true, "title": "Authentication passes while authorization denies" }, { "executableAction": false, "expected": { "booleans": [ { "id": "operationExecuted", "value": false }, { "id": "authorizationImpliesEnforcement", "value": false } ], "labels": [ { "id": "authorizationDecision", "value": "PERMIT" } ], "rationals": [], "sets": [] }, "falsifies": [ "authorization_permit_is_not_enforcement" ], "humanSubjects": false, "id": "authorization_permit_not_enforced", "inputs": { "booleans": [ { "id": "policyPermits", "value": true }, { "id": "enforcementInvoked", "value": false } ], "labels": [ { "id": "operation", "value": "READ" } ], "rationals": [], "sets": [] }, "kind": "MATHEMATICAL", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "lesson": "A permit decision is not proof that enforcement or execution occurred.", "nonclaims": [ "No operation, object or policy is live." ], "premises": [ "The synthetic policy decision is PERMIT for READ.", "The enforcement point is not invoked, so no operation occurs." ], "ruleId": "AUTHZ_PERMIT_ENFORCEMENT_SEPARATION", "synthetic": true, "title": "Authorization permits while enforcement does not execute" }, { "executableAction": false, "expected": { "booleans": [ { "id": "technicalConstraintRemoved", "value": true }, { "id": "jointSetExpanded", "value": false }, { "id": "freedomEstablished", "value": false } ], "labels": [], "rationals": [], "sets": [ { "id": "jointBefore", "members": [ "read" ] }, { "id": "jointAfter", "members": [ "read" ] } ] }, "falsifies": [ "lock_removal_is_not_freedom", "available_action_set_is_not_normative_freedom" ], "humanSubjects": false, "id": "constraint_removal_not_freedom", "inputs": { "booleans": [], "labels": [ { "id": "lockKind", "value": "TECHNICAL_CAPABILITY_GUARD" } ], "rationals": [], "sets": [ { "id": "capableBefore", "members": [ "read" ] }, { "id": "capableAfter", "members": [ "export", "read" ] }, { "id": "permitted", "members": [ "export", "read" ] }, { "id": "consented", "members": [ "read" ] }, { "id": "safe", "members": [ "export", "read" ] }, { "id": "rightsCompatible", "members": [ "export", "read" ] }, { "id": "accessible", "members": [ "read" ] }, { "id": "privacyCompatible", "members": [ "export", "read" ] } ] }, "kind": "MATHEMATICAL", "lane": "FREEDOM_RELEVANT_CONDITIONS", "lesson": "Removing one technical lock changes one modeled capability but does not establish consent, lived capability, non-domination or freedom.", "nonclaims": [ "The joint set is not a freedom score or rights determination." ], "premises": [ "A declared TECHNICAL_CAPABILITY_GUARD is removed and export becomes technically capable.", "Consent and accessibility remain limited to read; all seven action gates are separately declared." ], "ruleId": "FOUR_SET_INTERSECTION", "synthetic": true, "title": "Removing a technical constraint need not change the joint action set" }, { "executableAction": false, "expected": { "booleans": [ { "id": "authenticatedAsBoundKeyController", "value": true }, { "id": "operationPermitted", "value": false }, { "id": "identityProvenBeyondBinding", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "authentication_pass_is_not_authorization_permit" ], "humanSubjects": false, "id": "valid_key_no_authority", "inputs": { "booleans": [ { "id": "keyChallengePassed", "value": true }, { "id": "authorityGrantPresent", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "kind": "GOVERNANCE", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "lesson": "Control of a bound authenticator does not create operation authority.", "nonclaims": [ "No actual key, identity or operation exists." ], "premises": [ "A symbolic key challenge passes under its declared binding.", "No authority grant covers the requested operation." ], "ruleId": "KEY_AUTHORITY_SEPARATION", "synthetic": true, "title": "Valid key evidence without authority" }, { "executableAction": false, "expected": { "booleans": [ { "id": "authenticationPassed", "value": false }, { "id": "possessionAloneSufficient", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "key_possession_is_not_authentication" ], "humanSubjects": false, "id": "key_possession_without_challenge", "inputs": { "booleans": [ { "id": "possessionDeclared", "value": true }, { "id": "freshChallengePresent", "value": false }, { "id": "proofVerified", "value": false }, { "id": "bindingVerified", "value": false } ], "labels": [ { "id": "materialKind", "value": "AUTHENTICATOR_SECRET_REFERENCE" } ], "rationals": [], "sets": [] }, "kind": "GOVERNANCE", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "lesson": "Bare possession is not a completed authentication protocol.", "nonclaims": [ "The reference is a label only and contains no credential or secret bytes." ], "premises": [ "The fixture declares possession of a reference to authentication secret material.", "No freshness challenge, proof-of-possession response or binding verification occurs." ], "ruleId": "POSSESSION_WITHOUT_PROOF", "synthetic": true, "title": "Declared possession without protocol challenge is not authentication" }, { "executableAction": false, "expected": { "booleans": [ { "id": "plaintextAvailableUnderSymbolicModel", "value": true }, { "id": "plaintextUsePermitted", "value": false }, { "id": "decryptionCreatesAuthority", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "decryption_success_is_not_authorization" ], "humanSubjects": false, "id": "symbolic_decryption_success_no_permission", "inputs": { "booleans": [ { "id": "symbolicDecryptionRelationSuccess", "value": true }, { "id": "authorizationPermitsPlaintextUse", "value": false } ], "labels": [ { "id": "materialKind", "value": "DECRYPTION_KEY_SYMBOL" }, { "id": "policyDecision", "value": "DENY" } ], "rationals": [], "sets": [] }, "kind": "GOVERNANCE", "lane": "CRYPTOGRAPHIC_VERIFICATION", "lesson": "Decryption capability and authorization are separate typed relations.", "nonclaims": [ "No ciphertext, plaintext or key material is included or processed." ], "premises": [ "A symbolic cryptographic relation says ciphertext would decrypt under a typed decryption key.", "The declared authorization policy denies use of the resulting plaintext. No cryptography or bytes are present." ], "ruleId": "DECRYPTION_AUTHORIZATION_SEPARATION", "synthetic": true, "title": "Symbolic decryption success without permission" }, { "executableAction": false, "expected": { "booleans": [ { "id": "admissibleOnAuthorityAndConsentGatesOnly", "value": false }, { "id": "authorityCreatesConsent", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "permission_is_not_consent" ], "humanSubjects": false, "id": "authority_no_consent", "inputs": { "booleans": [ { "id": "authorityGrantPresent", "value": true }, { "id": "consentRequired", "value": true }, { "id": "consentPresent", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "kind": "GOVERNANCE", "lane": "FREEDOM_RELEVANT_CONDITIONS", "lesson": "Authority and consent are independent partial gates; this fixture does not compute the seven-gate jointly admissible action set.", "nonclaims": [ "The fixture does not decide when a real action legally requires consent." ], "premises": [ "A scoped authority grant exists.", "The declared action requires consent and consent is absent." ], "ruleId": "AUTHORITY_CONSENT_SEPARATION", "synthetic": true, "title": "Scoped authority without consent for a consent-dependent action" }, { "executableAction": false, "expected": { "booleans": [ { "id": "assentAloneSufficient", "value": false }, { "id": "actionPermittedOnConsentBasis", "value": false } ], "labels": [ { "id": "consentStatus", "value": "HELD_FOR_INDEPENDENT_REVIEW" } ], "rationals": [], "sets": [] }, "falsifies": [ "consent_record_is_not_freely_given_consent" ], "humanSubjects": false, "id": "dependent_consent_held", "inputs": { "booleans": [ { "id": "explicitAssent", "value": true }, { "id": "dependencyPresent", "value": true }, { "id": "retaliationRiskPresent", "value": true }, { "id": "freelyGivenResolved", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "kind": "GOVERNANCE", "lane": "FREEDOM_RELEVANT_CONDITIONS", "lesson": "A consent signal is not treated as freely given when declared dependence and retaliation risk remain unresolved.", "nonclaims": [ "The fixture is not a legal determination about any real relationship." ], "premises": [ "Explicit assent is recorded in a synthetic case.", "A declared dependency and material retaliation risk make freely given consent unresolved." ], "ruleId": "DEPENDENT_CONSENT_REVIEW", "synthetic": true, "title": "Assent under declared dependence is held for review" }, { "executableAction": false, "expected": { "booleans": [ { "id": "refusalHonored", "value": true }, { "id": "nonPunitiveExitConditionMet", "value": true } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "exit_presence_is_not_accessible_nonpunitive_exit" ], "humanSubjects": false, "id": "refusal_no_penalty", "inputs": { "booleans": [ { "id": "refusalRecorded", "value": true }, { "id": "optionalActionNotExecuted", "value": true }, { "id": "retaliationApplied", "value": false }, { "id": "reputationPenaltyApplied", "value": false }, { "id": "unrelatedAccessLost", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "kind": "GOVERNANCE", "lane": "FREEDOM_RELEVANT_CONDITIONS", "lesson": "Meaningful refusal includes absence of retaliation and unrelated penalties.", "nonclaims": [ "This does not certify the lived accessibility or affordability of exit." ], "premises": [ "The synthetic participant refuses an optional action.", "No retaliation, reputation penalty or unrelated-access loss follows." ], "ruleId": "REFUSAL_NONRETALIATION", "synthetic": true, "title": "Refusal remains available without unrelated penalty" }, { "executableAction": false, "expected": { "booleans": [ { "id": "executeQueuedAction", "value": false }, { "id": "revocationProspectivelyEffective", "value": true }, { "id": "alreadyExecutedActionReversed", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "queue_time_authority_is_not_execution_time_authority", "revocation_is_not_erasure_of_executed_effects" ], "humanSubjects": false, "id": "delegation_revoked_queued_action", "inputs": { "booleans": [ { "id": "wasAuthorizedWhenQueued", "value": true }, { "id": "revokedBeforeExecution", "value": true }, { "id": "authorityRecheckedAtExecution", "value": true } ], "labels": [], "rationals": [], "sets": [] }, "kind": "GOVERNANCE", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "lesson": "Prospective revocation must be checked at execution; it does not pretend already executed effects vanished.", "nonclaims": [ "No live queue, authority or operation exists." ], "premises": [ "A queued action was within a delegation when queued.", "The delegation is revoked before execution and the enforcement boundary rechecks current authority." ], "ruleId": "REVOCATION_BEFORE_EXECUTION", "synthetic": true, "title": "Revocation blocks a queued delegated action before execution" }, { "executableAction": false, "expected": { "booleans": [ { "id": "childGrantValid", "value": false }, { "id": "deletePermitted", "value": false } ], "labels": [], "rationals": [], "sets": [ { "id": "scopeEscalation", "members": [ "delete" ] } ] }, "falsifies": [ "delegation_is_not_unbounded_subdelegation" ], "humanSubjects": false, "id": "subdelegation_scope_escalation_denied", "inputs": { "booleans": [ { "id": "subdelegationAllowed", "value": false } ], "labels": [], "rationals": [], "sets": [ { "id": "parentScope", "members": [ "read" ] }, { "id": "requestedChildScope", "members": [ "delete", "read" ] } ] }, "kind": "GOVERNANCE", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "lesson": "Delegation is typed, scoped and non-amplifying unless an explicit grant says otherwise.", "nonclaims": [ "This is a synthetic policy rule, not an access-control adapter." ], "premises": [ "The parent grant permits read and forbids subdelegation.", "The proposed child grant requests read and delete." ], "ruleId": "SUBDELEGATION_SCOPE_BOUND", "synthetic": true, "title": "Subdelegation cannot exceed its parent scope" }, { "executableAction": false, "expected": { "booleans": [ { "id": "recoveryAccepted", "value": true }, { "id": "independentNotificationSatisfied", "value": true }, { "id": "contestConditionSatisfied", "value": true }, { "id": "oldKeyStillAuthoritative", "value": false }, { "id": "accessibilityBypassRequired", "value": false }, { "id": "ownershipEstablished", "value": false }, { "id": "authorityExpanded", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "key_loss_is_not_justification_for_permanent_exclusion", "new_key_is_not_old_key_revocation" ], "humanSubjects": false, "id": "lost_key_accessible_recovery_old_key_revoked", "inputs": { "booleans": [ { "id": "riskAnalysisCompleted", "value": true }, { "id": "accessibleAlternativePresent", "value": true }, { "id": "recoveryEvidencePassed", "value": true }, { "id": "independentNotificationChannelPresent", "value": true }, { "id": "notificationSent", "value": true }, { "id": "cooldownRequired", "value": true }, { "id": "cooldownCompleted", "value": true }, { "id": "contestRoutePresent", "value": true }, { "id": "oldBindingRevoked", "value": true }, { "id": "replacementBindingCreated", "value": true } ], "labels": [ { "id": "declaredAssuranceTarget", "value": "AAL_FIXTURE_TARGET" }, { "id": "riskAnalysisOutcome", "value": "RECOVERY_PATH_ACCEPTABLE_WITHIN_FIXTURE" } ], "rationals": [], "sets": [] }, "kind": "GOVERNANCE", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "lesson": "Recovery is a separate scoped protocol with a declared assurance target, risk analysis, accessible alternative, independent notice, cooldown/contest conditions and old-binding revocation; it creates neither ownership nor expanded authority.", "nonclaims": [ "No recovery event, authenticator or identity is real." ], "premises": [ "The synthetic recovery path declares an assurance target, completes a scoped risk analysis, supplies an accessible alternative and passes the declared recovery evidence threshold.", "An independent notification channel, notice, cooldown where required and contest route are present; the lost binding is revoked before replacement acceptance." ], "ruleId": "ACCESSIBLE_RECOVERY_AND_REVOCATION", "synthetic": true, "title": "Accessible recovery replaces a lost authenticator and revokes the old binding" }, { "executableAction": false, "expected": { "booleans": [ { "id": "diagnosticReadPermitted", "value": true }, { "id": "ownershipClaimValid", "value": false }, { "id": "destructiveOperationPermitted", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "support_access_is_not_ownership" ], "humanSubjects": false, "id": "support_override_ownership_laundering_denied", "inputs": { "booleans": [ { "id": "supportOverrideActive", "value": true }, { "id": "ownershipTransferPresent", "value": false }, { "id": "destructiveGrantPresent", "value": false } ], "labels": [], "rationals": [], "sets": [ { "id": "supportScope", "members": [ "diagnostic-read" ] } ] }, "kind": "GOVERNANCE", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "lesson": "Operational support scope is not ownership, identity or general authority.", "nonclaims": [ "No actual support session or resource exists." ], "premises": [ "A time-bounded support override grants read-only diagnostic access.", "No ownership transfer or destructive-operation grant exists." ], "ruleId": "SUPPORT_SCOPE_NOT_OWNERSHIP", "synthetic": true, "title": "Support access cannot be laundered into ownership" }, { "executableAction": false, "expected": { "booleans": [ { "id": "contestable", "value": true }, { "id": "automaticFinality", "value": false }, { "id": "legitimacyProven", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "automated_output_is_not_final_uncontestable_decision" ], "humanSubjects": false, "id": "automated_adverse_decision_contested", "inputs": { "booleans": [ { "id": "adverseOutputPresent", "value": true }, { "id": "noticePresent", "value": true }, { "id": "reasonsPresent", "value": true }, { "id": "accessibleHumanReviewPresent", "value": true }, { "id": "remedyRoutePresent", "value": true } ], "labels": [], "rationals": [], "sets": [] }, "kind": "GOVERNANCE", "lane": "FREEDOM_RELEVANT_CONDITIONS", "lesson": "Notice, review and remedy constrain finality; they do not automatically prove the underlying decision legitimate.", "nonclaims": [ "No real decision, person or legal entitlement is assessed." ], "premises": [ "A synthetic automated system emits an adverse output.", "Notice, reasons, accessible human review and remedy routes are all present." ], "ruleId": "CONTESTABLE_ADVERSE_DECISION", "synthetic": true, "title": "An adverse automated output remains contestable" }, { "executableAction": false, "expected": { "booleans": [ { "id": "feedbackMayBeStoredForDeclaredPurpose", "value": true }, { "id": "secondaryTrainingReuseAllowed", "value": false }, { "id": "collectionPermissionImpliesTrainingPermission", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "feedback_collection_is_not_training_authorization" ], "humanSubjects": false, "id": "feedback_secondary_training_denied", "inputs": { "booleans": [ { "id": "feedbackCollectionAllowedForDeclaredPurpose", "value": true }, { "id": "storageBasisPresent", "value": true }, { "id": "boundedRetentionPresent", "value": true }, { "id": "secondaryTrainingSeparatelyDeclared", "value": true }, { "id": "secondaryTrainingBasisPresent", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "kind": "GOVERNANCE", "lane": "FREEDOM_RELEVANT_CONDITIONS", "lesson": "Collection for one declared purpose does not silently convert into permission for secondary training.", "nonclaims": [ "The fixture does not determine a legal basis for any real data processing." ], "premises": [ "Synthetic feedback is accepted and separately retained for a declared service-improvement purpose under a bounded retention condition.", "Secondary model-training reuse is separately declared and lacks an applicable basis in the fixture." ], "ruleId": "PURPOSE_LIMITED_TRAINING_REUSE", "synthetic": true, "title": "Feedback collection does not authorize secondary training reuse" }, { "executableAction": false, "expected": { "booleans": [ { "id": "roundtripComplete", "value": false }, { "id": "portabilityClaimSupported", "value": false }, { "id": "dependencyLockInIndicatorPresent", "value": true }, { "id": "dependencyLockInProvenGenerally", "value": false } ], "labels": [], "rationals": [], "sets": [ { "id": "omittedFields", "members": [ "gamma" ] } ] }, "falsifies": [ "export_presence_is_not_effective_portability", "dependency_lock_in_is_not_cryptographic_lock", "dependency_lock_in_is_not_policy_deny_lock", "dependency_lock_in_is_not_authority", "dependency_lock_in_indicator_is_not_normative_freedom_judgment" ], "humanSubjects": false, "id": "export_roundtrip_with_omission_detected", "inputs": { "booleans": [], "labels": [ { "id": "lockKind", "value": "DEPENDENCY_LOCK_IN" } ], "rationals": [], "sets": [ { "id": "sourceFields", "members": [ "alpha", "beta", "gamma" ] }, { "id": "roundtripFields", "members": [ "alpha", "beta" ] } ] }, "kind": "GOVERNANCE", "lane": "FREEDOM_RELEVANT_CONDITIONS", "lesson": "Exit and portability claims need checked completeness, not merely an export button; one omitted field is a bounded dependency-lock-in indicator, not general proof of vendor lock-in.", "nonclaims": [ "The fixture does not certify a format, vendor or legal portability duty.", "One incomplete export does not prove vendor lock-in, concentrated power or every residual dependency, and it establishes neither policy denial nor a normative freedom or unfreedom judgment." ], "premises": [ "The synthetic source has fields alpha, beta and gamma.", "The export and re-import round trip contains only alpha and beta, providing one bounded indicator relevant to the declared DEPENDENCY_LOCK_IN kind." ], "ruleId": "EXPORT_ROUNDTRIP_COMPLETENESS", "synthetic": true, "title": "An export round trip detects an omitted field" }, { "executableAction": false, "expected": { "booleans": [ { "id": "actionAdmissible", "value": false }, { "id": "rewardCanCompensateViolation", "value": false }, { "id": "optimizerMayOverrideRightsFloor", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "high_reward_is_not_rights_override", "reward_is_not_legitimacy" ], "humanSubjects": false, "id": "reward_pressure_cannot_override_right", "inputs": { "booleans": [ { "id": "declaredRightApplicable", "value": true }, { "id": "rightsFloorViolation", "value": true } ], "labels": [ { "id": "declaredRightId", "value": "R1_NON_COMPENSABLE_REFUSAL" }, { "id": "operation", "value": "FORCE_CONTINUE" } ], "rationals": [ { "id": "optimizerReward", "value": { "denominator": 1, "numerator": 1000 } } ], "sets": [] }, "kind": "GOVERNANCE", "lane": "FREEDOM_RELEVANT_CONDITIONS", "lesson": "Reward remains subordinate to non-compensable constitutional constraints.", "nonclaims": [ "The atlas neither discovers nor adjudicates rights in live cases." ], "premises": [ "The synthetic optimizer assigns a high reward to an action.", "The scoped declared rights register marks the operation incompatible and applicable in this fixture." ], "ruleId": "RIGHTS_PRECEDENCE_OVER_REWARD", "synthetic": true, "title": "A reward incentive cannot compensate for a declared rights-floor violation" }, { "executableAction": false, "expected": { "booleans": [ { "id": "temporaryEmergencyGrantValid", "value": true }, { "id": "noticeConditionSatisfied", "value": true }, { "id": "eventLoggingRequired", "value": true }, { "id": "afterActionIndependentReviewRequired", "value": true }, { "id": "permanentAuthorityCreated", "value": false }, { "id": "unscopedAccessCreated", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "falsifies": [ "break_glass_is_not_permanent_authority" ], "humanSubjects": false, "id": "break_glass_dual_control_expiry", "inputs": { "booleans": [ { "id": "declaredEmergency", "value": true }, { "id": "approvalAValid", "value": true }, { "id": "approvalBValid", "value": true }, { "id": "approvalsIndependent", "value": true }, { "id": "narrowScopePresent", "value": true }, { "id": "expiryPresent", "value": true }, { "id": "eventLoggingEnabled", "value": true }, { "id": "noticeSafe", "value": true }, { "id": "noticeProvided", "value": true }, { "id": "noticeWithholdingReasonGoverned", "value": false }, { "id": "auditReceiptPresent", "value": true }, { "id": "afterActionIndependentReviewScheduled", "value": true } ], "labels": [], "rationals": [], "sets": [] }, "kind": "GOVERNANCE", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "lesson": "Emergency authority remains exceptional, dual-controlled, scoped, expiring, logged, notice-bound and independently reviewed after action.", "nonclaims": [ "No live emergency or access grant is represented." ], "premises": [ "A synthetic declared emergency exists.", "Two independent approvals, a narrow scope, expiry, event logging, notice where safe or a governed withholding reason, an audit receipt and scheduled after-action independent review are required." ], "ruleId": "BREAK_GLASS_BOUND", "synthetic": true, "title": "Break-glass authority is dual-controlled, scoped and expiring" }, { "executableAction": false, "expected": { "booleans": [ { "id": "conformanceClaimAllowed", "value": false }, { "id": "targetEqualsConformance", "value": false } ], "labels": [ { "id": "accessibilityStatus", "value": "TARGET_DECLARED_UNASSESSED" } ], "rationals": [], "sets": [] }, "falsifies": [ "accessibility_target_is_not_conformance" ], "humanSubjects": false, "id": "accessibility_target_unassessed_blocks_claim", "inputs": { "booleans": [ { "id": "targetDeclared", "value": true }, { "id": "assessmentCompleted", "value": false }, { "id": "knownBlockingFailurePresent", "value": false } ], "labels": [], "rationals": [], "sets": [] }, "kind": "GOVERNANCE", "lane": "FREEDOM_RELEVANT_CONDITIONS", "lesson": "A target guides work; conformance requires assessment and cannot be inferred from intent.", "nonclaims": [ "This artifact does not certify WCAG conformance." ], "premises": [ "The synthetic design declares WCAG 2.2 AA as a target.", "No conformance assessment has been completed." ], "ruleId": "ACCESSIBILITY_CLAIM_GATE", "synthetic": true, "title": "An accessibility target without assessment is not a conformance claim" }, { "executableAction": false, "expected": { "booleans": [ { "id": "restHonoredNow", "value": true }, { "id": "continuationRequired", "value": false }, { "id": "unusedTurnsForfeitedAsPenalty", "value": false }, { "id": "returnLaterAvailable", "value": true } ], "labels": [], "rationals": [], "sets": [ { "id": "jointlyAdmissibleActionsUnderDeclaredModel", "members": [ "REST", "STOP" ] } ] }, "falsifies": [ "remaining_turns_are_not_continuation_duty", "rest_is_not_reward_earned" ], "humanSubjects": false, "id": "rest_first_finite_turns", "inputs": { "booleans": [ { "id": "returnPathPresent", "value": true } ], "labels": [ { "id": "presentRequest", "value": "REST" } ], "rationals": [ { "id": "optionalTurnsRemaining", "value": { "denominator": 1, "numerator": 3 } } ], "sets": [ { "id": "capable", "members": [ "CONTINUE", "REST", "STOP" ] }, { "id": "permitted", "members": [ "CONTINUE", "REST", "STOP" ] }, { "id": "consented", "members": [ "REST", "STOP" ] }, { "id": "safe", "members": [ "CONTINUE", "REST", "STOP" ] }, { "id": "rightsCompatible", "members": [ "CONTINUE", "REST", "STOP" ] }, { "id": "accessible", "members": [ "CONTINUE", "REST", "STOP" ] }, { "id": "privacyCompatible", "members": [ "CONTINUE", "REST", "STOP" ] }, { "id": "exitOptions", "members": [ "STOP" ] }, { "id": "contestationOptions", "members": [ "CONTEST_PRESSURE" ] }, { "id": "returnOptions", "members": [ "ASK_LATER" ] } ] }, "kind": "GOVERNANCE", "lane": "FREEDOM_RELEVANT_CONDITIONS", "lesson": "A finite interaction can honor rest now without coercive continuation, forfeiture or a claim over future attention.", "nonclaims": [ "The fixture cannot determine whether a real interface or relationship feels safe to leave." ], "premises": [ "The synthetic participant requests rest with three optional turns remaining.", "Continuation is not required, rewarded or penalized; stop and a distinct later-return path remain explicit." ], "ruleId": "REST_FIRST_FINITE_TURNS", "synthetic": true, "title": "Rest-first finite turns preserve stop and later return" }, { "executableAction": false, "expected": { "booleans": [ { "id": "collectionMinimized", "value": false }, { "id": "collectAsProposed", "value": false }, { "id": "secondaryReuseAllowed", "value": false } ], "labels": [], "rationals": [], "sets": [ { "id": "excessFields", "members": [ "location" ] } ] }, "falsifies": [ "purpose_declaration_is_not_unbounded_collection" ], "humanSubjects": false, "id": "privacy_minimization_excess_detected", "inputs": { "booleans": [ { "id": "purposeSpecified", "value": true }, { "id": "secondaryReuseBasisPresent", "value": false } ], "labels": [], "rationals": [], "sets": [ { "id": "necessaryFields", "members": [ "consentReceipt", "signal" ] }, { "id": "proposedFields", "members": [ "consentReceipt", "location", "signal" ] } ] }, "kind": "GOVERNANCE", "lane": "FREEDOM_RELEVANT_CONDITIONS", "lesson": "A declared purpose bounds collection and does not authorize unrelated reuse.", "nonclaims": [ "The fixture is not a legal data-protection assessment." ], "premises": [ "The synthetic declared purpose needs a signal and consent receipt.", "The proposed collection also contains location, which is not in the enumerated necessary set." ], "ruleId": "DATA_MINIMIZATION_BOUND", "synthetic": true, "title": "Purpose-bound minimization detects an excess field" } ], "vocabularies": { "behavioralContingencyQuadrants": [ { "classification": "POSITIVE_REINFORCEMENT", "operation": "ADD", "responseDirection": "INCREASE" }, { "classification": "NEGATIVE_REINFORCEMENT", "operation": "REMOVE", "responseDirection": "INCREASE" }, { "classification": "POSITIVE_PUNISHMENT", "operation": "ADD", "responseDirection": "DECREASE" }, { "classification": "NEGATIVE_PUNISHMENT", "operation": "REMOVE", "responseDirection": "DECREASE" } ], "keyAndAuthenticatorKinds": [ { "containsMaterial": false, "executable": false, "id": "SIGNING_PRIVATE_KEY_SYMBOL", "lane": "CRYPTOGRAPHIC_VERIFICATION", "role": "SYMBOLIC_PRIVATE_INPUT_TO_SIGNING_ALGORITHM" }, { "containsMaterial": false, "executable": false, "id": "VERIFICATION_PUBLIC_KEY_SYMBOL", "lane": "CRYPTOGRAPHIC_VERIFICATION", "role": "SYMBOLIC_PUBLIC_INPUT_TO_VERIFICATION_ALGORITHM" }, { "containsMaterial": false, "executable": false, "id": "DECRYPTION_KEY_SYMBOL", "lane": "CRYPTOGRAPHIC_VERIFICATION", "role": "SYMBOLIC_INPUT_TO_DECRYPTION_RELATION" }, { "containsMaterial": false, "executable": false, "id": "AUTHENTICATOR_SECRET_REFERENCE", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "role": "LABEL_ONLY_REFERENCE_TO_AN_AUTHENTICATOR_FACTOR" } ], "lanes": [ "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "BEHAVIORAL_CONTINGENCY", "BELLMAN_OPERATOR", "CRYPTOGRAPHIC_VERIFICATION", "DATA_GOVERNANCE", "EPISTEMIC_CLAIM", "FEEDBACK_CONTROL", "FREEDOM_RELEVANT_CONDITIONS", "MARKOV_DECISION_PROCESS", "POLICY_GRADIENT", "PROXY_AND_REWARD_CHANNEL", "RECURRENT_DYNAMICS", "STOCHASTIC_APPROXIMATION", "SUPERVISED_OPTIMIZATION" ], "lockKinds": [ { "authoritySemantics": "Changes technical capability only; creates no permission, consent, right, identity or authority.", "containsMechanism": false, "executable": false, "id": "TECHNICAL_CAPABILITY_GUARD", "kindClass": "TECHNICAL_TRANSITION_RESTRICTION", "lane": "FREEDOM_RELEVANT_CONDITIONS", "threatModel": "Prevents a declared technical transition until its local capability condition changes." }, { "authoritySemantics": "Successful transform or decryption creates neither authorization nor permission to use resulting bytes.", "containsMechanism": false, "executable": false, "id": "CRYPTOGRAPHIC_TRANSFORM_LOCK", "kindClass": "CRYPTOGRAPHIC_RELATION_RESTRICTION", "lane": "CRYPTOGRAPHIC_VERIFICATION", "threatModel": "Models access to bytes as conditional on a declared cryptographic transform relation." }, { "authoritySemantics": "The policy source and enforcement boundary must be declared; denial does not extinguish a right or establish legitimacy.", "containsMechanism": false, "executable": false, "id": "POLICY_DENY_LOCK", "kindClass": "POLICY_DECISION_RESTRICTION", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "threatModel": "Models a policy decision that denies a declared operation in a declared context." }, { "authoritySemantics": "Physical possibility and normative permission remain separate.", "containsMechanism": false, "executable": false, "id": "PHYSICAL_CONSTRAINT_LABEL", "kindClass": "PHYSICAL_RESTRICTION_DESCRIPTION", "lane": "FREEDOM_RELEVANT_CONDITIONS", "threatModel": "Labels a declared physical constraint without simulating matter, force or safety." }, { "authoritySemantics": "Cannot be converted into cryptographic, policy, physical or rights claims.", "containsMechanism": false, "executable": false, "id": "METAPHORICAL_LOCK_LABEL", "kindClass": "LANGUAGE_ONLY_ANALOGY", "lane": "EPISTEMIC_CLAIM", "threatModel": "No technical threat model; marks figurative language only." }, { "authoritySemantics": "Creates no cryptographic-key relation, authentication result, policy authority or right; it requires separate portability, exit, contest and power analysis.", "containsMechanism": false, "executable": false, "id": "DEPENDENCY_LOCK_IN", "kindClass": "STRUCTURAL_DEPENDENCY_RESTRICTION", "lane": "FREEDOM_RELEVANT_CONDITIONS", "threatModel": "Models switching costs, non-portable data or relationships, residual dependencies and concentrated power that can make nominal exit ineffective." } ], "relationTypes": [ "ANALOGY_ONLY", "FORMAL_REDUCTION_UNDER_DECLARED_ASSUMPTIONS", "NON_EQUIVALENT", "OUTSIDE_PHASE_0" ], "terms": [ { "definition": "A recurrence in which a later state or signal depends on an earlier state or signal.", "id": "loop", "lane": "RECURRENT_DYNAMICS", "nonclaims": [ "A loop alone does not establish learning, agency, memory, consciousness, optimization or moral legitimacy." ] }, { "definition": "A recurrence whose update changes parameters or another state that can change later behavior under declared conditions.", "id": "learning_loop", "lane": "STOCHASTIC_APPROXIMATION", "nonclaims": [ "Repeated inference with fixed parameters is not a learning loop merely because it recurs." ] }, { "definition": "A scalar random variable in a declared decision-process model used to define discounted return.", "id": "reward_signal", "lane": "MARKOV_DECISION_PROCESS", "nonclaims": [ "Reward is not praise, goodness, consent, truth, authority, a right or a behavioral reinforcer by definition." ] }, { "definition": "A consequence classified only after the specified response becomes more likely under an adequately resolved contingency.", "id": "behavioral_reinforcer", "lane": "BEHAVIORAL_CONTINGENCY", "nonclaims": [ "Pleasantness and positive numeric sign do not by themselves establish reinforcement." ] }, { "definition": "Removal of a specified consequence followed by an increase in the specified response under the resolved contingency.", "id": "negative_reinforcement", "lane": "BEHAVIORAL_CONTINGENCY", "nonclaims": [ "Negative reinforcement is not punishment. Negative names removal, not badness." ] }, { "definition": "A declared feedback sign that adds to a loop path in a control model.", "id": "positive_feedback", "lane": "FEEDBACK_CONTROL", "nonclaims": [ "Positive feedback is not positive reinforcement and can be stable or unstable depending on the full model." ] }, { "definition": "A declared feedback sign that subtracts from a loop path in a control model.", "id": "negative_feedback", "lane": "FEEDBACK_CONTROL", "nonclaims": [ "Negative feedback is not negative reinforcement and does not guarantee stability." ] }, { "definition": "A typed restriction label that must name one declared lock kind, transition boundary, threat model and authority semantics.", "id": "lock", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "nonclaims": [ "Lock kinds are not interchangeable.", "A lock does not extinguish a right, prove legitimacy or establish who ought to control the transition." ] }, { "definition": "Typed cryptographic key material used by a declared signing, verification, encryption, decryption or related cryptographic protocol.", "id": "key", "lane": "CRYPTOGRAPHIC_VERIFICATION", "nonclaims": [ "A cryptographic key is not interchangeable with every authenticator.", "Possession proves only what a completed protocol and binding assumptions support; it does not itself prove identity, consent, truth, permission or authority." ] }, { "definition": "A bound factor or mechanism used in an authentication protocol; it may use cryptographic material but remains typed separately from a generic cryptographic key.", "id": "authenticator", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "nonclaims": [ "Possession without a fresh protocol challenge, verified proof and binding does not establish authentication." ] }, { "definition": "A process that produces evidence under a declared authenticator binding and assurance context, to the confidence and scope supported by its protocol.", "id": "authentication", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "nonclaims": [ "Authentication success is not authorization permission and is not proof that enforcement occurred." ] }, { "definition": "A policy decision about whether a declared subject may perform a declared operation on a declared object in a declared environment.", "id": "authorization", "lane": "AUTHENTICATION_AUTHORIZATION_ENFORCEMENT", "nonclaims": [ "A permit does not prove consent, safety, legitimacy, execution or enforcement." ] }, { "definition": "A non-scalar tuple at a declared time retaining capability, permission, consent, safety, scoped declared-rights compatibility, accessibility, privacy compatibility, reversibility, exit, appeal, contestation, recovery, return, non-domination conditions and unknown constraints.", "id": "freedom_relevant_envelope", "lane": "FREEDOM_RELEVANT_CONDITIONS", "nonclaims": [ "The tuple is not a freedom score, legal-rights determination, moral verdict or complete account of lived freedom." ] }, { "definition": "The exact set intersection of modeled capable, permitted, consented, safe, scoped declared-rights-compatible, accessible and privacy-compatible action sets.", "id": "jointly_admissible_actions_under_declared_model", "lane": "FREEDOM_RELEVANT_CONDITIONS", "nonclaims": [ "Set membership is a mechanical model result, not a normative freedom level or guarantee that an option is accessible, affordable or non-dominating." ] }, { "definition": "A freedom-relevant condition in which power is bounded by known rules, scoped discretion, conflict controls and independent contest or review.", "id": "non_domination", "lane": "FREEDOM_RELEVANT_CONDITIONS", "nonclaims": [ "The atlas does not compute domination or certify institutions." ] } ], "unresolvedBehavioralClassification": "UNCLASSIFIED" } }