Module identity_fabric 

Resilient relational identity (§27, legal_logic.md) — fabric resolution.

The strict axiom: an identifier is not an identity. A key, DID, or name is a pointer; identity is the dynamically-computed result of a fabric of anchors (identifiers, attestations, relations). So losing a primary key must NOT collapse identity — it is re-computed from the surviving fabric (the refugee / device-loss / theft resilience case), provided a quorum of anchors survives (k-of-n social/relational recovery).

See [[principle-identifiers-not-identity]]. This complements the foundational modal_kind/resolve layer with the resilience primitive. Zero-heap.

Constants

SHAMIR_PRIME

The Mersenne prime field modulus 2^61 − 1.

Functions

enumerated_identity_confidence

Identity as an enumerated state ([[principle-identifiers-not-identity]]): its confidence is the share of its total cryptographic anchors (identifiers + related datasets) currently present. One identifier of many → low confidence; the full enumerated fabric → high. 0.0 if total == 0 (an enumeration of nothing is not an identity).

identifier_is_not_identity

The axiom, made explicit: an identifier is never, by itself, the identity.

identity_survives_loss

Identity survives the loss of anchors iff a quorum of the fabric remains. quorum must be ≥1 (an identity anchored by nothing is not an identity). k-of-n recovery.

recompute_fabric

Re-compute the active anchor set from all_anchors, excluding any in lost, into out. Returns the count — the surviving fabric an identity is reconstructed from. Zero-heap.

shamir_reconstruct

Reconstruct the secret from k shares (xs[i], ys[i]) by Lagrange interpolation at x = 0. Any k of the n shares recover the secret; fewer reveal nothing. Zero-heap.

shamir_split

Split secret (reduced mod the prime) into n shares with threshold k = coeffs.len()+1: share i (x-coord i+1) y-value is written to ys[i]. coeffs are the k−1 polynomial coefficients (from a CSPRNG in production; caller-supplied here for determinism). Returns n.

surviving_anchors

The surviving anchor count after a loss (saturating).

web_of_trust_confidence

Recursive identity anchoring with web-of-trust decay: an identity asserted through a chain of depth intermediary identities has confidence base · decay^depth — trust attenuates with each hop. decay ∈ [0,1]; depth = 0 is a direct anchor (full base).

zkp_capability_granted

ZKP capability derivation: a capability is granted by PROVING an identity trait (a zk proof) WITHOUT revealing the core identifier. Granted iff trait_proven AND the identifier was NOT revealed — the proof carries the trait, not the id (privacy-preserving derivation).