A bounded kernel for relation constraints, provenance independence, authority and admitted routing across 29 relation types.
Relational physiology
in GenOS.
A bounded kernel for relation constraints, provenance independence, authority and admitted routing across 29 relation types.
What it means
in GenOS.
Social and causal dependence affect how independent evidence can be counted. The software kernel records typed relations to constrain routing and quorum claims; a relation never grants authority.
Load scoped relations → Check authority and independence → Record and dispatch
For sources S, group known dependent origins into equivalence classes C(S). Effective vote count is |C(S)|, not |S|; unknown dependence must not be asserted independent.
Explore the mechanism: Relational physiology
A qualitative teaching model of this concept. It does not run GenOS or validate its implementation.
The modeled transition may proceed. Change the assumption and move through the stages to inspect the decision path.
How it works
at a glance.
Load scoped relations
Read organization and project edges with provenance. Incomplete or failed reads refuse the affected independence-sensitive route.
Check authority and independence
Apply existing leases, ACLs and budgets first. Group known dependent origins for quorum; refuse a claim of established statistical independence.
Record and dispatch
Preserve the more restrictive relation, write the decision receipt and send only the reduced allowed content.
What is connected,
and how far.
Family, managerial, social and verifier labels constrain routing but confer no new rights. Separate model families do not prove independent errors. The current routing patch does not provide a complete transactional revocation firewall.
The 29-relation kernel is integrated into a targeted persistent audience-routing path; general mission admission and enforcement remain open.
Counting siblings or shared-model runs as independent votes. · Treating a manager or guardian label as authorization. · Losing causal history when an edge is revoked.
No implementation file is pinned to this concept entry yet.
The mechanism
behind the analogy.
The Byzantine Generals Problem
Leslie Lamport, Robert Shostak, and Marshall Pease · ACM Transactions on Programming Languages and Systems 4(3), 382–401
Formalizes agreement under specified faulty-participant assumptions. A voting topology does not inherit Byzantine fault tolerance unless its protocol meets those assumptions.
Open publication ↗Primary research describes the cited mechanism; specific technologies may instead cite their original technical documentation. These sources provide context and do not validate the GenOS implementation.
A relation cannot grant permission
Family, managerial, social and verifier labels constrain routing but confer no new rights. Separate model families do not prove independent errors. The current routing patch does not provide a complete transactional revocation firewall.