@@ -435,10 +435,10 @@ flowchart TD
435435 R --> OPINION
436436 S --> OPINION
437437 OPINION[Opinion Calculation]
438- OPINION --> |R = r_m + s_m| TOTAL
439- TOTAL --> |belief = r_m / R+K | B
440- TOTAL --> |disbelief = s_m / R+K | D
441- TOTAL --> |uncertainty = K / R+K | U
438+ OPINION --> |W = r_m + s_m| TOTAL
439+ TOTAL --> |belief = r_m / (W+K) | B
440+ TOTAL --> |disbelief = s_m / (W+K) | D
441+ TOTAL --> |uncertainty = K / (W+K) | U
442442 B[Belief b]
443443 D[Disbelief d]
444444 U[Uncertainty u]
@@ -448,8 +448,8 @@ flowchart TD
448448 end
449449
450450 subgraph Decay per Epoch
451- R --> |×0.99| R
452- S --> |×0.999| S
451+ r_m --> |×0.99| r_m
452+ s_m --> |×0.999| s_m
453453 end
454454
455455 subgraph Eligibility Check
@@ -567,7 +567,7 @@ graph LR
567567| WP Requirement | Implementation | Status | Notes |
568568| ----------------| ----------------| --------| -------|
569569| Battle circuit structure | ` BattleCircuit ` | ✅ | |
570- | Winner ID validation | Constraint: ` w*(w-1)*(w-2)=0 ` | ✅ | |
570+ | Winner ID validation | Constraint: ` w*(w-1)*(w-2)=0 ` | ✅ | 0 = Player A wins, 1 = Player B wins, 2 = Draw |
571571| CA evolution verification | TODO | ⚠️ | Complex constraint programming needed |
572572| State circuit structure | ` StateCircuit ` | ✅ | |
573573| Non-equality constraint | ` diff * inv = 1 ` | ✅ | Fixed in RC1 |
@@ -670,7 +670,7 @@ flowchart TD
670670 BASE --> |EIP-1559 style| ADJUST[Adjust per Block]
671671
672672 CONTRACT[Private Contract]
673- CONTRACT --> |×2 multiplier| PRIVACY[Privacy Premium]
673+ CONTRACT --> |×2 multiplier| PRIVACY[Privacy Premium: Ring Signature Privacy ]
674674 end
675675
676676 subgraph "Supply Schedule"
@@ -908,14 +908,14 @@ graph LR
908908
909909** Risk Level:** Low - core functionality present, advanced features deferred.
910910
911- ### 4. Recursive SNARK Aggregation
911+ ### 4. Recursive zkSNARK Aggregation
912912
913- ** WP Spec:** Proof aggregation via recursive SNARKs for scalability.
913+ ** WP Spec:** Proof aggregation via recursive zkSNARKs for scalability.
914914
915915** Implementation:** Individual Groth16 proofs per battle.
916916
917917** Rationale:**
918- - Recursive SNARKs require significant R&D
918+ - Recursive zkSNARKs require significant R&D
919919- Current approach functional for RC1 throughput
920920- Planned for v1.0+
921921
@@ -968,7 +968,7 @@ graph LR
968968
969969### Priority 2: v1.0 Enhancements
970970
971- 1 . ** Recursive SNARK Aggregation**
971+ 1 . ** Recursive zkSNARK Aggregation**
972972 - Migrate to Plonk or STARK
973973 - Implement recursive verification
974974 - Reduce block verification time
0 commit comments