Model access is a provision answered by a record, not a machine

novox/hq ADR 0024, gaps 1 and 2. The user's stated requirement, and the first
thing here that no machine can answer: a hosted model is on nobody's node and
is reached over the public internet, so the rule that refuses two ends sharing
no private network must not apply to it.

A licence is a named thing and the name is the operator's — *the personal
account*, *the organisation's* — because the whole point is saying which one a
given consumer uses, and an anonymous credential hanging off a provider cannot
be said. Many to many, so deliberately not a claim: two machines sharing an
account is ordinary rather than a collision.

Gap 2 is the missing verb, *accept*: take a value somebody supplied, seal it to
each holder, discard the plaintext. With the consequence stated rather than
hidden — a holder recorded after the key was supplied has no key and the mesh
cannot make one, so it is refused by name with the remedy, not silently handed
an empty file.

Refusal is felt, as the record warns: a mesh holding three ways to reach a
model refuses every consumer that has not chosen. So the refusal names the
candidates and the exact command. Being right is not the same as being usable.

Gaps 3 and 4 — a consumer that is not a machine, and switching as a reaction
rather than a declaration — remain gaps. Half-building them would put a
conditional in the declaration language, which is what ADR 0024 says plainly to
avoid.

Its own context, with its own store and its own credential: a licence is a
different aggregate from anything inventory owns, and it refers to nodes by
name because that is what crossing a context boundary may carry.

internal/catalogue/resolve.go

@@ -40,6 +40,18 @@ type World struct {
 	// start meaning something the day a second provider appears, and one recorded and then made
 	// unnecessary should not quietly stop applying either.
 	Pinned map[string]string
+	// Licences is every provision answered by a **record rather than a node**, by provision name.
+	//
+	// novox/hq ADR 0024: a hosted model is on nobody's machine and is reached over the public
+	// internet, so the rule that refuses two ends sharing no private network must not apply to
+	// it. These are the candidates a refusal names.
+	Licences map[string][]Record
+	// Using is which record this node's modules were put on, keyed by module then provision.
+	//
+	// Per consumer, because that is the whole point: saying WHICH licence a given thing uses. Two
+	// modules on one machine using different accounts is ordinary rather than a collision.
+	Using map[string]map[string]Record
+
 	// Unchecked takes brokered requirements on trust instead of refusing when nothing answers
 	// them.
 	//
@@ -50,6 +62,18 @@ type World struct {
 	Unchecked bool
 }
 
+// Record is a provision answered by something the mesh holds rather than by a machine.
+//
+// The name is the operator's — *the personal account*, *the organisation's* — because the whole
+// point is saying which one a consumer uses, and an anonymous credential hanging off a provider
+// cannot be said (novox/hq ADR 0024).
+type Record struct {
+	// Name is what a person calls it, and what a consumer is put on.
+	Name string
+	// Serves is what a consumer must know that is not secret — a base URL, a model name.
+	Serves map[string]any
+}
+
 // Provider is one node answering a mesh-scoped requirement.
 type Provider struct {
 	// Node is the machine.
@@ -101,6 +125,10 @@ type Needed struct {
 	At string
 	// Serves is what the providing module said a consumer needs to know.
 	Serves map[string]any
+	// ByRecord means this was answered by something the mesh holds rather than by a machine, so
+	// there is no node to reach and no private network to share. Its credential comes from
+	// wherever that record's does, not from the pair-wise secret two machines share.
+	ByRecord bool
 	// Sealed is the credential, closed to this node. Filled in after resolving, because whose
 	// credential it is only becomes answerable once which node answers has been settled.
 	Sealed string
@@ -288,6 +316,14 @@ func Resolve(catalogue map[string]Manifest, assigned []string, node Node, world
 		candidates := offers[want]
 		switch len(candidates) {
 		case 0:
+			if len(world.Licences[want]) > 0 {
+				// Answered by a record rather than by a module, and the post-pass below settles
+				// which one. Left alone here: the two questions a refusal must answer — *is
+				// there anything* and *which one* — have different remedies, and answering the
+				// first wrongly would send somebody looking for a module to install.
+				reported[want] = true
+				continue
+			}
 			reported[want] = true
 			problems = append(problems, fmt.Sprintf(
 				"nothing provides %q, wanted by %s", want, because[want]))
@@ -324,6 +360,53 @@ func Resolve(catalogue map[string]Manifest, assigned []string, node Node, world
 		}
 	}
 
+	// What is answered by a record rather than by a machine.
+	//
+	// A post-pass, deliberately: nothing about it depends on the order requirements were walked
+	// in, and putting it in the queue would mean the reachability rule — which must not apply
+	// here — sitting one branch away from a case it would be wrong for.
+	//
+	// **Refused when the consumer has not said which.** ADR 0024 warns this will be felt: a mesh
+	// holding three ways to reach a model refuses every consumer that has not chosen, which is
+	// correct and is a great deal of saying-which the first time. So the refusal names the
+	// candidates and the exact command, because being right is not the same as being usable.
+	for _, name := range order {
+		m := catalogue[name]
+		for _, want := range m.Wants() {
+			offered, byRecord := world.Licences[want]
+			if !byRecord || len(offered) == 0 {
+				continue
+			}
+			if satisfied[want] {
+				// Something in this node's own set answers it -- a model the mesh runs itself,
+				// most obviously. A record is not consulted when there is a local answer.
+				continue
+			}
+			using, said := world.Using[m.Module][want]
+			if !said {
+				if world.Unchecked {
+					continue
+				}
+				names := make([]string, 0, len(offered))
+				for _, r := range offered {
+					names = append(names, r.Name)
+				}
+				sort.Strings(names)
+				problems = append(problems, fmt.Sprintf(
+					"%s on %s needs %q and has not been told which one to use — say which with "+
+						"`licence use <name> %s %s`: %s",
+					m.Module, node.Name, want, node.Name, m.Module, strings.Join(names, ", ")))
+				continue
+			}
+			needs = append(needs, Needed{
+				Name: want, From: using.Name, Serves: using.Serves, ByRecord: true,
+				// The module that required it, not whatever first mentioned the name: the key is
+				// sealed per consumer, and a consumer here is a module on a machine.
+				For: m.Module,
+			})
+		}
+	}
+
 	resolution := Resolution{Node: node.Name, At: node.At, Because: because, Needs: needs}
 	for _, n := range order {
 		resolution.Modules = append(resolution.Modules, catalogue[n])