RFC-0049 projection algebra domain review
Versioned draft snapshot
RFCs, reference catalogs, and evidence reflect Spec 3b2e3e7a114fb826b1445d39a48756b8fff629cd. Counts and pending/status notes belong to that snapshot. Read the dated project update for later progress.
Source repositories are private during staging. Links marked “repository access required” need access to the linked repository.
This is a trace and gap record from the pinned draft specification. It does not establish proof or implementation conformance.
Status: all 68 domain nodes reviewed on 2026-10-05; 50 match and eighteen mismatch. Owners: Compiler, Graph Runtime. No normative facts changed.
Projection/query/mutation forms, the named provenance projection, and the two query/mutation lowering effects have explicit authored identities. Source agreement does not establish implementation of the closed algebra.
Two invariants preserve authored contradictions:
- Aggregation is summarized as scalar/tuple-only with no composition afterward, while §8 lists groupBy returning a map of subgraphs and §8.1.2 explicitly permits further composition on those values. Distinguish the outer map from its subgraph values and specify the exceptional result shape.
- Empty-stable says every operator returns empty or zero, while §8.1.4 returns null for empty avg/min/max, and §3.3 describes refinement/composition inputs as nonempty. Define empty-input support and the absent aggregate-result representation consistently with the language’s null prohibition.
Acceptance: prepare concrete algebra signatures, empty-input/result semantics, and source/Lean/RDF corrections for owner approval; test count/sum/avg/min/max and groupBy on empty and nonempty subgraphs, including composition on groupBy partitions. Preserve authorization and bitemporal contexts in those tests.
Authorization and source operator boundaries
The next 16 nodes contain twelve matches and four mismatches. Mutation idempotency/provenance/template mediation and named algebra operators have explicit authored support.
The unconditional source policy and tenant filtering summaries conflict with §10.4’s elevated service/system principal modes and §14.7’s audited cross-tenant exception. Specify source evaluation principal separately from the caller’s exposure filter; preserve the mandatory query-boundary refiltering rule.
asOf is a temporal qualifier, but is classified as an algebra Operation. Give the qualifier a distinct syntax or configuration identity. byId also needs an explicit statement-ID case: §4 promises a singleton gnomon with zero edges, while §3.2 requires endpoint vertices whenever an edge-gnomon is included. Specify endpoint closure or rejection rather than leaving that shape ambiguous.
Acceptance includes principal/service/system exposure tests, audited elevation, object and statement IDs, missing IDs, temporal binding, and endpoint closure. No authorization or operator contract changed in this review.
Composition and selection closure
The next 20 nodes contain seventeen matches and three mismatches. Most named operators have explicit signatures and source descriptions. validAt repeats the temporal-qualifier versus algebra-operation class problem found for asOf.
Set difference and selection lack an endpoint-closure rule. Removing a vertex while retaining its incident edge violates §3.2; selecting a matching edge while dropping a nonmatching endpoint does likewise. Specify induced-edge removal or endpoint retention explicitly, including how that affects the promised set or predicate semantics. Selection’s no-added-gnomons rule in §5 must also stay coherent with the chosen closure operation.
Acceptance requires minimal two-vertex/one-edge counterexamples for difference and selection, edges-only selection, disjoint/intersecting graphs, and authorization redaction before wire materialization. The current match for the materialize node records its boundary role, not proof of endpoint closure after permission filtering.
Logical types and provenance owners
The final 20 nodes contain eleven matches and nine mismatches. EmptySubgraph is an algebraic value, Carrier is a runtime universe, and BitemporalQualifier, AuthMode, and MaterializeMode describe invocation/configuration concepts without named language-type declarations. Their DataType classes require explicit ownership or a concept/syntax/value representation. Identifier appears in example signatures, but this RFC does not define its claimed branded scalar representation; attribute that fact to the canonical type owner.
Three shared provenance summaries conflict with RFC-0050 §4.1: instance_of connects a created gnomon to its template definition; instantiated_from connects the created gnomon to its parent calling template; with connects the created gnomon to a hash-keyed argument record (§4.2). The RFC-0049 summaries instead use template-instantiation subjects or targets and argument resources.
Acceptance: inventory every shared predicate definition and consumer, preserve the canonical endpoint kinds, correct the source attribution, and test lineage for root and nested template calls. Class and type corrections need their own owner-approved contract and generated-artifact checks.