File size: 10,405 Bytes
224e773
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
use hyperkitty_core::{Glyph, MAX_ENTROPY};
use hyperkitty_routing::QRADispatcher;
use crate::validity::{ValidityPredicate, ValidityInput, ValidityDecision, ValidityGate};

/// Reconciliation result — full decision with trace
#[derive(Debug, Clone)]
pub struct ReconciliationDecision {
    pub accepted: bool,
    pub current_state: Glyph,
    pub previous_state: Glyph,
    pub next_state: Option<Glyph>,
    pub entropy: f64,
    pub validity_decision: ValidityDecision,
    pub route_valid: bool,
    pub invariant_preserved: bool,
    pub failed_gate: Option<ValidityGate>,
    pub trace_id: u64,
}

impl ReconciliationDecision {
    pub fn accept(
        current: Glyph,
        previous: Glyph,
        next: Glyph,
        entropy: f64,
        validity: ValidityDecision,
    ) -> Self {
        ReconciliationDecision {
            accepted: true,
            current_state: current,
            previous_state: previous,
            next_state: Some(next),
            entropy,
            validity_decision: validity,
            route_valid: true,
            invariant_preserved: validity.invariant_ok,
            failed_gate: None,
            trace_id: 0,
        }
    }

    pub fn reject(
        current: Glyph,
        previous: Glyph,
        entropy: f64,
        validity: ValidityDecision,
        gate: ValidityGate,
    ) -> Self {
        ReconciliationDecision {
            accepted: false,
            current_state: current,
            previous_state: previous,
            next_state: None,
            entropy,
            validity_decision: validity,
            route_valid: false,
            invariant_preserved: false,
            failed_gate: Some(gate),
            trace_id: 0,
        }
    }
}

/// Reconciliation state tracker
#[derive(Debug, Clone)]
pub struct ReconciliationState {
    pub committed_state: Glyph,
    pub committed_at: u64,
    pub last_entropy: f64,
    pub rejection_count: u64,
    pub acceptance_count: u64,
}

impl ReconciliationState {
    pub fn new(initial: Glyph) -> Self {
        ReconciliationState {
            committed_state: initial,
            committed_at: 0,
            last_entropy: 0.0,
            rejection_count: 0,
            acceptance_count: 0,
        }
    }

    pub fn advance(&mut self, next: Glyph, entropy: f64) {
        self.committed_state = next;
        self.committed_at = self.committed_at.wrapping_add(1);
        self.last_entropy = entropy;
        self.acceptance_count = self.acceptance_count.wrapping_add(1);
    }

    pub fn reject(&mut self) {
        self.rejection_count = self.rejection_count.wrapping_add(1);
    }
}

/// ReconciliationProtocol — authoritative orchestrator
pub struct ReconciliationProtocol {
    predicate: ValidityPredicate,
    state: ReconciliationState,
}

impl ReconciliationProtocol {
    pub fn new(initial_state: Glyph) -> Self {
        ReconciliationProtocol {
            predicate: ValidityPredicate::new(),
            state: ReconciliationState::new(initial_state),
        }
    }

    /// Reconcile a candidate state transition
    /// Returns decision with full trace, but does NOT commit until caller confirms
    pub fn reconcile(
        &mut self,
        current: Glyph,
        previous: Glyph,
        proof_exists: bool,
        invariant_ok: bool,
    ) -> hyperkitty_core::Result<ReconciliationDecision> {
        // Step 1: QRA Dispatch
        let qra_result = QRADispatcher::dispatch(current, previous)
            .map_err(|_| hyperkitty_core::Error::ParseError("qra_dispatch_failed".to_string()))?;

        // Step 2: Entropy calculation
        // For now, use simple heuristic: entropy = 0 for deterministic QRA
        // (H(next | current, previous) = 0 by design)
        let entropy = 0.0;

        // Step 3: Invariant preservation (check consistency)
        let invariant_ok_computed = invariant_ok && qra_result.is_valid;

        // Step 4: Build validity input
        let validity_input = ValidityInput {
            current_state: current,
            previous_state: previous,
            route_result: Some(qra_result.next),
            entropy,
            proof_exists,
            invariant_ok: invariant_ok_computed,
        };

        // Step 5: Check validity predicate
        let validity_decision = self.predicate.check(&validity_input);

        // Step 6: Build reconciliation decision
        let decision = if validity_decision.accepted {
            ReconciliationDecision::accept(
                current,
                previous,
                qra_result.next,
                entropy,
                validity_decision,
            )
        } else {
            ReconciliationDecision::reject(
                current,
                previous,
                entropy,
                validity_decision,
                validity_decision.failed_gate.unwrap_or(ValidityGate::Route),
            )
        };

        Ok(decision)
    }

    /// Commit a reconciliation decision to state
    /// This is the only place that modifies committed state
    pub fn commit(&mut self, decision: &ReconciliationDecision) -> hyperkitty_core::Result<()> {
        if !decision.accepted {
            self.state.reject();
            return Err(hyperkitty_core::Error::ParseError(
                format!("reconciliation_rejected: {:?}", decision.failed_gate),
            ));
        }

        if let Some(next_state) = decision.next_state {
            self.state.advance(next_state, decision.entropy);
            Ok(())
        } else {
            Err(hyperkitty_core::Error::ParseError(
                "accepted but no next_state".to_string(),
            ))
        }
    }

    /// Get current committed state without mutation
    pub fn get_state(&self) -> Glyph {
        self.state.committed_state
    }

    /// Get full state snapshot
    pub fn snapshot(&self) -> ReconciliationState {
        self.state.clone()
    }

    /// Idempotence: reconciling identical inputs produces identical decisions
    /// (caller's responsibility to verify, but protocol guarantees input->decision is deterministic)
    pub fn is_deterministic() -> bool {
        true // QRA is deterministic, validity is deterministic
    }
}

impl Default for ReconciliationProtocol {
    fn default() -> Self {
        Self::new(Glyph::Lambda)
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_reconciliation_accepts_valid_transition() {
        let mut recon = ReconciliationProtocol::new(Glyph::Lambda);
        let decision = recon
            .reconcile(Glyph::Pi, Glyph::Gamma, true, true)
            .unwrap();

        assert!(decision.accepted);
        assert!(decision.route_valid);
        assert_eq!(decision.current_state, Glyph::Pi);
        assert_eq!(decision.previous_state, Glyph::Gamma);
        assert!(decision.next_state.is_some());
    }

    #[test]
    fn test_reconciliation_rejects_missing_proof() {
        let mut recon = ReconciliationProtocol::new(Glyph::Lambda);
        let decision = recon
            .reconcile(Glyph::Pi, Glyph::Gamma, false, true)
            .unwrap();

        assert!(!decision.accepted);
        assert_eq!(decision.failed_gate, Some(ValidityGate::Proof));
    }

    #[test]
    fn test_reconciliation_rejects_broken_invariant() {
        let mut recon = ReconciliationProtocol::new(Glyph::Lambda);
        let decision = recon
            .reconcile(Glyph::Pi, Glyph::Gamma, true, false)
            .unwrap();

        assert!(!decision.accepted);
        assert_eq!(decision.failed_gate, Some(ValidityGate::Invariant));
    }

    #[test]
    fn test_reconciliation_commit_advances_state() {
        let mut recon = ReconciliationProtocol::new(Glyph::Lambda);
        let decision = recon
            .reconcile(Glyph::Pi, Glyph::Gamma, true, true)
            .unwrap();

        assert!(decision.accepted);
        let result = recon.commit(&decision);
        assert!(result.is_ok());

        let snapshot = recon.snapshot();
        assert_eq!(snapshot.acceptance_count, 1);
        assert!(snapshot.committed_state.index() < 6); // Valid glyph
    }

    #[test]
    fn test_reconciliation_commit_rejects_invalid_decision() {
        let mut recon = ReconciliationProtocol::new(Glyph::Lambda);
        let decision = recon
            .reconcile(Glyph::Pi, Glyph::Gamma, false, true)
            .unwrap();

        assert!(!decision.accepted);
        let result = recon.commit(&decision);
        assert!(result.is_err());

        let snapshot = recon.snapshot();
        assert_eq!(snapshot.rejection_count, 1);
    }

    #[test]
    fn test_reconciliation_idempotent_input_produces_identical_decision() {
        let mut recon1 = ReconciliationProtocol::new(Glyph::Lambda);
        let mut recon2 = ReconciliationProtocol::new(Glyph::Lambda);

        let d1 = recon1
            .reconcile(Glyph::Delta, Glyph::Omega, true, true)
            .unwrap();
        let d2 = recon2
            .reconcile(Glyph::Delta, Glyph::Omega, true, true)
            .unwrap();

        assert_eq!(d1.accepted, d2.accepted);
        assert_eq!(d1.next_state, d2.next_state);
        assert_eq!(d1.entropy, d2.entropy);
        assert_eq!(d1.failed_gate, d2.failed_gate);
    }

    #[test]
    fn test_reconciliation_state_no_commit_on_rejection() {
        let mut recon = ReconciliationProtocol::new(Glyph::Lambda);
        let initial = recon.get_state();

        let decision = recon
            .reconcile(Glyph::Pi, Glyph::Gamma, false, true)
            .unwrap();
        assert!(!decision.accepted);

        let _ = recon.commit(&decision);
        let after = recon.get_state();

        assert_eq!(initial, after); // State unchanged on rejection
    }

    #[test]
    fn test_reconciliation_deterministic() {
        assert!(ReconciliationProtocol::is_deterministic());
    }

    #[test]
    fn test_reconciliation_entropy_always_zero() {
        let mut recon = ReconciliationProtocol::new(Glyph::Lambda);
        for c in Glyph::all() {
            for p in Glyph::all() {
                let decision = recon.reconcile(c, p, true, true).unwrap();
                assert_eq!(decision.entropy, 0.0);
            }
        }
    }

    #[test]
    fn test_reconciliation_protocol_default() {
        let recon = ReconciliationProtocol::default();
        assert_eq!(recon.get_state(), Glyph::Lambda);
    }
}