feat: Add domain architecture and extract core services from Prism Console

## Domain Architecture
- Complete domain-to-service mapping for 16 verified domains
- Subdomain architecture for blackroad.systems and blackroad.io
- GitHub organization mapping (BlackRoad-OS repos)
- Railway service-to-domain configuration
- DNS configuration templates for Cloudflare

## Extracted Services

### AIops Service (services/aiops/)
- Canary analysis for deployment validation
- Config drift detection
- Event correlation engine
- Auto-remediation with runbook mapping
- SLO budget management

### Analytics Service (services/analytics/)
- Rule-based anomaly detection with safe expression evaluation
- Cohort analysis with multi-metric aggregation
- Decision engine with credit budget constraints
- Narrative report generation

### Codex Governance (services/codex/)
- 82+ governance principles (entries)
- Codex Pantheon with 48+ agent archetypes
- Manifesto defining ethical framework

## Integration Points
- AIops → infra.blackroad.systems (blackroad-os-infra)
- Analytics → core.blackroad.systems (blackroad-os-core)
- Codex → operator.blackroad.systems (blackroad-os-operator)

🤖 Generated with [Claude Code](https://claude.com/claude-code)

Co-Authored-By: Claude <noreply@anthropic.com>

services/codex/entries/024-verifiable-delay-randomness.md

@@ -0,0 +1,27 @@
+# Codex 24 — Verifiable Delay & Randomness — Unbiasable Lottery
+
+**Fingerprint:** `23064887b1469b19fa562e8afdee5e9046bedf99aa9cd7142c35e38f91e6fef2`
+
+## Aim
+Produce public randomness that cannot be accelerated or forged.
+
+## Core
+- Compute verifiable delay functions (VDFs) \(y = f^{(T)}(x)\) that require sequential effort yet yield easily verifiable proofs \(\pi\).
+- Derive randomness beacons as \(R_t = H(y_t \parallel \text{context})\) for downstream use.
+- Slash or penalize invalid submissions to discourage manipulation attempts.
+
+## Runbook
+1. Seed the VDF with attested entropy and context, then compute \(y\) and proof \(\pi\).
+2. Verify \(\pi\) publicly and derive committees or lotteries from the resulting beacon \(R_t\).
+3. Archive beacons immutably and monitor for forks or divergent outputs.
+
+## Telemetry
+- Verification time and resource usage.
+- Fork rate and availability of beacon outputs.
+- Participation statistics for committees derived from the beacon.
+
+## Failsafes
+- Fall back to multi-party commit-reveal protocols when the VDF beacon fails.
+- Escalate to governance review when invalid proofs surface or delays exceed tolerances.
+
+**Tagline:** Randomness that no miner can rush.