@stevenvo780/st-lang 4.9.0 → 4.11.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (241) hide show
  1. package/dist/logic/profiles/natural-deduction-nk/formula.d.ts +18 -0
  2. package/dist/logic/profiles/natural-deduction-nk/formula.d.ts.map +1 -0
  3. package/dist/logic/profiles/natural-deduction-nk/formula.js +102 -0
  4. package/dist/logic/profiles/natural-deduction-nk/formula.js.map +1 -0
  5. package/dist/logic/profiles/natural-deduction-nk/index.d.ts +5 -0
  6. package/dist/logic/profiles/natural-deduction-nk/index.d.ts.map +1 -0
  7. package/dist/logic/profiles/natural-deduction-nk/index.js +28 -0
  8. package/dist/logic/profiles/natural-deduction-nk/index.js.map +1 -0
  9. package/dist/logic/profiles/natural-deduction-nk/prover.d.ts +49 -0
  10. package/dist/logic/profiles/natural-deduction-nk/prover.d.ts.map +1 -0
  11. package/dist/logic/profiles/natural-deduction-nk/prover.js +557 -0
  12. package/dist/logic/profiles/natural-deduction-nk/prover.js.map +1 -0
  13. package/dist/logic/profiles/natural-deduction-nk/types.d.ts +48 -0
  14. package/dist/logic/profiles/natural-deduction-nk/types.d.ts.map +1 -0
  15. package/dist/logic/profiles/natural-deduction-nk/types.js +35 -0
  16. package/dist/logic/profiles/natural-deduction-nk/types.js.map +1 -0
  17. package/dist/proof-systems/distributed-exchange/index.d.ts +101 -0
  18. package/dist/proof-systems/distributed-exchange/index.d.ts.map +1 -0
  19. package/dist/proof-systems/distributed-exchange/index.js +408 -0
  20. package/dist/proof-systems/distributed-exchange/index.js.map +1 -0
  21. package/dist/reasoning/automata/dfa.d.ts +17 -0
  22. package/dist/reasoning/automata/dfa.d.ts.map +1 -0
  23. package/dist/reasoning/automata/dfa.js +276 -0
  24. package/dist/reasoning/automata/dfa.js.map +1 -0
  25. package/dist/reasoning/automata/index.d.ts +8 -0
  26. package/dist/reasoning/automata/index.d.ts.map +1 -0
  27. package/dist/reasoning/automata/index.js +64 -0
  28. package/dist/reasoning/automata/index.js.map +1 -0
  29. package/dist/reasoning/automata/languages.d.ts +10 -0
  30. package/dist/reasoning/automata/languages.d.ts.map +1 -0
  31. package/dist/reasoning/automata/languages.js +78 -0
  32. package/dist/reasoning/automata/languages.js.map +1 -0
  33. package/dist/reasoning/automata/nfa.d.ts +8 -0
  34. package/dist/reasoning/automata/nfa.d.ts.map +1 -0
  35. package/dist/reasoning/automata/nfa.js +122 -0
  36. package/dist/reasoning/automata/nfa.js.map +1 -0
  37. package/dist/reasoning/automata/pda.d.ts +10 -0
  38. package/dist/reasoning/automata/pda.d.ts.map +1 -0
  39. package/dist/reasoning/automata/pda.js +169 -0
  40. package/dist/reasoning/automata/pda.js.map +1 -0
  41. package/dist/reasoning/automata/regex.d.ts +6 -0
  42. package/dist/reasoning/automata/regex.d.ts.map +1 -0
  43. package/dist/reasoning/automata/regex.js +259 -0
  44. package/dist/reasoning/automata/regex.js.map +1 -0
  45. package/dist/reasoning/automata/types.d.ts +69 -0
  46. package/dist/reasoning/automata/types.d.ts.map +1 -0
  47. package/dist/reasoning/automata/types.js +29 -0
  48. package/dist/reasoning/automata/types.js.map +1 -0
  49. package/dist/reasoning/computability/index.d.ts +239 -0
  50. package/dist/reasoning/computability/index.d.ts.map +1 -0
  51. package/dist/reasoning/computability/index.js +851 -0
  52. package/dist/reasoning/computability/index.js.map +1 -0
  53. package/dist/reasoning/graph-theory/index.d.ts +63 -0
  54. package/dist/reasoning/graph-theory/index.d.ts.map +1 -0
  55. package/dist/reasoning/graph-theory/index.js +1043 -0
  56. package/dist/reasoning/graph-theory/index.js.map +1 -0
  57. package/dist/reasoning/group-presentation/cayley.d.ts +8 -0
  58. package/dist/reasoning/group-presentation/cayley.d.ts.map +1 -0
  59. package/dist/reasoning/group-presentation/cayley.js +38 -0
  60. package/dist/reasoning/group-presentation/cayley.js.map +1 -0
  61. package/dist/reasoning/group-presentation/index.d.ts +8 -0
  62. package/dist/reasoning/group-presentation/index.d.ts.map +1 -0
  63. package/dist/reasoning/group-presentation/index.js +36 -0
  64. package/dist/reasoning/group-presentation/index.js.map +1 -0
  65. package/dist/reasoning/group-presentation/standard-groups.d.ts +6 -0
  66. package/dist/reasoning/group-presentation/standard-groups.d.ts.map +1 -0
  67. package/dist/reasoning/group-presentation/standard-groups.js +93 -0
  68. package/dist/reasoning/group-presentation/standard-groups.js.map +1 -0
  69. package/dist/reasoning/group-presentation/todd-coxeter.d.ts +10 -0
  70. package/dist/reasoning/group-presentation/todd-coxeter.d.ts.map +1 -0
  71. package/dist/reasoning/group-presentation/todd-coxeter.js +362 -0
  72. package/dist/reasoning/group-presentation/todd-coxeter.js.map +1 -0
  73. package/dist/reasoning/group-presentation/types.d.ts +7 -0
  74. package/dist/reasoning/group-presentation/types.d.ts.map +1 -0
  75. package/dist/reasoning/group-presentation/types.js +22 -0
  76. package/dist/reasoning/group-presentation/types.js.map +1 -0
  77. package/dist/reasoning/group-presentation/words.d.ts +10 -0
  78. package/dist/reasoning/group-presentation/words.d.ts.map +1 -0
  79. package/dist/reasoning/group-presentation/words.js +109 -0
  80. package/dist/reasoning/group-presentation/words.js.map +1 -0
  81. package/dist/reasoning/number-theory/crt.d.ts +9 -0
  82. package/dist/reasoning/number-theory/crt.d.ts.map +1 -0
  83. package/dist/reasoning/number-theory/crt.js +39 -0
  84. package/dist/reasoning/number-theory/crt.js.map +1 -0
  85. package/dist/reasoning/number-theory/diophantine.d.ts +10 -0
  86. package/dist/reasoning/number-theory/diophantine.d.ts.map +1 -0
  87. package/dist/reasoning/number-theory/diophantine.js +87 -0
  88. package/dist/reasoning/number-theory/diophantine.js.map +1 -0
  89. package/dist/reasoning/number-theory/factorization.d.ts +12 -0
  90. package/dist/reasoning/number-theory/factorization.d.ts.map +1 -0
  91. package/dist/reasoning/number-theory/factorization.js +136 -0
  92. package/dist/reasoning/number-theory/factorization.js.map +1 -0
  93. package/dist/reasoning/number-theory/gcd.d.ts +8 -0
  94. package/dist/reasoning/number-theory/gcd.d.ts.map +1 -0
  95. package/dist/reasoning/number-theory/gcd.js +51 -0
  96. package/dist/reasoning/number-theory/gcd.js.map +1 -0
  97. package/dist/reasoning/number-theory/index.d.ts +9 -0
  98. package/dist/reasoning/number-theory/index.d.ts.map +1 -0
  99. package/dist/reasoning/number-theory/index.js +46 -0
  100. package/dist/reasoning/number-theory/index.js.map +1 -0
  101. package/dist/reasoning/number-theory/modular.d.ts +6 -0
  102. package/dist/reasoning/number-theory/modular.d.ts.map +1 -0
  103. package/dist/reasoning/number-theory/modular.js +75 -0
  104. package/dist/reasoning/number-theory/modular.js.map +1 -0
  105. package/dist/reasoning/number-theory/primality.d.ts +6 -0
  106. package/dist/reasoning/number-theory/primality.d.ts.map +1 -0
  107. package/dist/reasoning/number-theory/primality.js +144 -0
  108. package/dist/reasoning/number-theory/primality.js.map +1 -0
  109. package/dist/reasoning/number-theory/symbols.d.ts +3 -0
  110. package/dist/reasoning/number-theory/symbols.d.ts.map +1 -0
  111. package/dist/reasoning/number-theory/symbols.js +57 -0
  112. package/dist/reasoning/number-theory/symbols.js.map +1 -0
  113. package/dist/reasoning/real-analysis/index.d.ts +127 -0
  114. package/dist/reasoning/real-analysis/index.d.ts.map +1 -0
  115. package/dist/reasoning/real-analysis/index.js +638 -0
  116. package/dist/reasoning/real-analysis/index.js.map +1 -0
  117. package/dist/reasoning/topology/index.d.ts +41 -0
  118. package/dist/reasoning/topology/index.d.ts.map +1 -0
  119. package/dist/reasoning/topology/index.js +739 -0
  120. package/dist/reasoning/topology/index.js.map +1 -0
  121. package/dist/tests/logic/profiles/natural-deduction-nk/nk.test.d.ts +2 -0
  122. package/dist/tests/logic/profiles/natural-deduction-nk/nk.test.d.ts.map +1 -0
  123. package/dist/tests/logic/profiles/natural-deduction-nk/nk.test.js +288 -0
  124. package/dist/tests/logic/profiles/natural-deduction-nk/nk.test.js.map +1 -0
  125. package/dist/tests/proof-systems/distributed-exchange/distributed-exchange.test.d.ts +2 -0
  126. package/dist/tests/proof-systems/distributed-exchange/distributed-exchange.test.d.ts.map +1 -0
  127. package/dist/tests/proof-systems/distributed-exchange/distributed-exchange.test.js +328 -0
  128. package/dist/tests/proof-systems/distributed-exchange/distributed-exchange.test.js.map +1 -0
  129. package/dist/tests/reasoning/automata/automata.test.d.ts +2 -0
  130. package/dist/tests/reasoning/automata/automata.test.d.ts.map +1 -0
  131. package/dist/tests/reasoning/automata/automata.test.js +310 -0
  132. package/dist/tests/reasoning/automata/automata.test.js.map +1 -0
  133. package/dist/tests/reasoning/computability/computability.test.d.ts +2 -0
  134. package/dist/tests/reasoning/computability/computability.test.d.ts.map +1 -0
  135. package/dist/tests/reasoning/computability/computability.test.js +246 -0
  136. package/dist/tests/reasoning/computability/computability.test.js.map +1 -0
  137. package/dist/tests/reasoning/graph-theory/graph-theory.test.d.ts +2 -0
  138. package/dist/tests/reasoning/graph-theory/graph-theory.test.d.ts.map +1 -0
  139. package/dist/tests/reasoning/graph-theory/graph-theory.test.js +363 -0
  140. package/dist/tests/reasoning/graph-theory/graph-theory.test.js.map +1 -0
  141. package/dist/tests/reasoning/group-presentation/group-presentation.test.d.ts +2 -0
  142. package/dist/tests/reasoning/group-presentation/group-presentation.test.d.ts.map +1 -0
  143. package/dist/tests/reasoning/group-presentation/group-presentation.test.js +229 -0
  144. package/dist/tests/reasoning/group-presentation/group-presentation.test.js.map +1 -0
  145. package/dist/tests/reasoning/number-theory/number-theory.test.d.ts +2 -0
  146. package/dist/tests/reasoning/number-theory/number-theory.test.d.ts.map +1 -0
  147. package/dist/tests/reasoning/number-theory/number-theory.test.js +170 -0
  148. package/dist/tests/reasoning/number-theory/number-theory.test.js.map +1 -0
  149. package/dist/tests/reasoning/real-analysis/real-analysis.test.d.ts +2 -0
  150. package/dist/tests/reasoning/real-analysis/real-analysis.test.d.ts.map +1 -0
  151. package/dist/tests/reasoning/real-analysis/real-analysis.test.js +197 -0
  152. package/dist/tests/reasoning/real-analysis/real-analysis.test.js.map +1 -0
  153. package/dist/tests/reasoning/topology/topology.test.d.ts +2 -0
  154. package/dist/tests/reasoning/topology/topology.test.d.ts.map +1 -0
  155. package/dist/tests/reasoning/topology/topology.test.js +327 -0
  156. package/dist/tests/reasoning/topology/topology.test.js.map +1 -0
  157. package/dist/tests/tooling/exporters/coq-v2/coq-v2-exporter.test.d.ts +2 -0
  158. package/dist/tests/tooling/exporters/coq-v2/coq-v2-exporter.test.d.ts.map +1 -0
  159. package/dist/tests/tooling/exporters/coq-v2/coq-v2-exporter.test.js +411 -0
  160. package/dist/tests/tooling/exporters/coq-v2/coq-v2-exporter.test.js.map +1 -0
  161. package/dist/tests/tooling/exporters/lean4/lean4-exporter.test.d.ts +2 -0
  162. package/dist/tests/tooling/exporters/lean4/lean4-exporter.test.d.ts.map +1 -0
  163. package/dist/tests/tooling/exporters/lean4/lean4-exporter.test.js +473 -0
  164. package/dist/tests/tooling/exporters/lean4/lean4-exporter.test.js.map +1 -0
  165. package/dist/tests/tooling/lemma-library/lemma-library.test.d.ts +2 -0
  166. package/dist/tests/tooling/lemma-library/lemma-library.test.d.ts.map +1 -0
  167. package/dist/tests/tooling/lemma-library/lemma-library.test.js +197 -0
  168. package/dist/tests/tooling/lemma-library/lemma-library.test.js.map +1 -0
  169. package/dist/tests/tooling/provenance/ledger.test.d.ts +2 -0
  170. package/dist/tests/tooling/provenance/ledger.test.d.ts.map +1 -0
  171. package/dist/tests/tooling/provenance/ledger.test.js +545 -0
  172. package/dist/tests/tooling/provenance/ledger.test.js.map +1 -0
  173. package/dist/tooling/exporters/coq-v2/index.d.ts +68 -0
  174. package/dist/tooling/exporters/coq-v2/index.d.ts.map +1 -0
  175. package/dist/tooling/exporters/coq-v2/index.js +692 -0
  176. package/dist/tooling/exporters/coq-v2/index.js.map +1 -0
  177. package/dist/tooling/exporters/lean4/index.d.ts +47 -0
  178. package/dist/tooling/exporters/lean4/index.d.ts.map +1 -0
  179. package/dist/tooling/exporters/lean4/index.js +423 -0
  180. package/dist/tooling/exporters/lean4/index.js.map +1 -0
  181. package/dist/tooling/lemma-library/apply.d.ts +9 -0
  182. package/dist/tooling/lemma-library/apply.d.ts.map +1 -0
  183. package/dist/tooling/lemma-library/apply.js +94 -0
  184. package/dist/tooling/lemma-library/apply.js.map +1 -0
  185. package/dist/tooling/lemma-library/arithmetic.d.ts +3 -0
  186. package/dist/tooling/lemma-library/arithmetic.d.ts.map +1 -0
  187. package/dist/tooling/lemma-library/arithmetic.js +176 -0
  188. package/dist/tooling/lemma-library/arithmetic.js.map +1 -0
  189. package/dist/tooling/lemma-library/firstorder.d.ts +3 -0
  190. package/dist/tooling/lemma-library/firstorder.d.ts.map +1 -0
  191. package/dist/tooling/lemma-library/firstorder.js +136 -0
  192. package/dist/tooling/lemma-library/firstorder.js.map +1 -0
  193. package/dist/tooling/lemma-library/index.d.ts +13 -0
  194. package/dist/tooling/lemma-library/index.d.ts.map +1 -0
  195. package/dist/tooling/lemma-library/index.js +32 -0
  196. package/dist/tooling/lemma-library/index.js.map +1 -0
  197. package/dist/tooling/lemma-library/library.d.ts +34 -0
  198. package/dist/tooling/lemma-library/library.d.ts.map +1 -0
  199. package/dist/tooling/lemma-library/library.js +126 -0
  200. package/dist/tooling/lemma-library/library.js.map +1 -0
  201. package/dist/tooling/lemma-library/modal.d.ts +3 -0
  202. package/dist/tooling/lemma-library/modal.d.ts.map +1 -0
  203. package/dist/tooling/lemma-library/modal.js +138 -0
  204. package/dist/tooling/lemma-library/modal.js.map +1 -0
  205. package/dist/tooling/lemma-library/propositional.d.ts +3 -0
  206. package/dist/tooling/lemma-library/propositional.d.ts.map +1 -0
  207. package/dist/tooling/lemma-library/propositional.js +265 -0
  208. package/dist/tooling/lemma-library/propositional.js.map +1 -0
  209. package/dist/tooling/lemma-library/set-theory.d.ts +3 -0
  210. package/dist/tooling/lemma-library/set-theory.d.ts.map +1 -0
  211. package/dist/tooling/lemma-library/set-theory.js +134 -0
  212. package/dist/tooling/lemma-library/set-theory.js.map +1 -0
  213. package/dist/tooling/lemma-library/standard.d.ts +3 -0
  214. package/dist/tooling/lemma-library/standard.d.ts.map +1 -0
  215. package/dist/tooling/lemma-library/standard.js +27 -0
  216. package/dist/tooling/lemma-library/standard.js.map +1 -0
  217. package/dist/tooling/lemma-library/tfidf.d.ts +5 -0
  218. package/dist/tooling/lemma-library/tfidf.d.ts.map +1 -0
  219. package/dist/tooling/lemma-library/tfidf.js +100 -0
  220. package/dist/tooling/lemma-library/tfidf.js.map +1 -0
  221. package/dist/tooling/lemma-library/tokenize.d.ts +2 -0
  222. package/dist/tooling/lemma-library/tokenize.d.ts.map +1 -0
  223. package/dist/tooling/lemma-library/tokenize.js +74 -0
  224. package/dist/tooling/lemma-library/tokenize.js.map +1 -0
  225. package/dist/tooling/lemma-library/types.d.ts +53 -0
  226. package/dist/tooling/lemma-library/types.d.ts.map +1 -0
  227. package/dist/tooling/lemma-library/types.js +10 -0
  228. package/dist/tooling/lemma-library/types.js.map +1 -0
  229. package/dist/tooling/provenance/index.d.ts +3 -0
  230. package/dist/tooling/provenance/index.d.ts.map +1 -0
  231. package/dist/tooling/provenance/index.js +16 -0
  232. package/dist/tooling/provenance/index.js.map +1 -0
  233. package/dist/tooling/provenance/ledger.d.ts +89 -0
  234. package/dist/tooling/provenance/ledger.d.ts.map +1 -0
  235. package/dist/tooling/provenance/ledger.js +439 -0
  236. package/dist/tooling/provenance/ledger.js.map +1 -0
  237. package/dist/tooling/provenance/types.d.ts +70 -0
  238. package/dist/tooling/provenance/types.d.ts.map +1 -0
  239. package/dist/tooling/provenance/types.js +14 -0
  240. package/dist/tooling/provenance/types.js.map +1 -0
  241. package/package.json +1 -1
@@ -0,0 +1,35 @@
1
+ "use strict";
2
+ // ============================================================
3
+ // Natural Deduction NK (Gentzen classical) — Tipos
4
+ // ============================================================
5
+ //
6
+ // Sistema NK de Gentzen para lógica proposicional clásica.
7
+ // Extiende NJ (intuicionista) con reglas que justifican el
8
+ // tercero excluido / doble negación clásica.
9
+ //
10
+ // Reglas intuicionistas heredadas (idéntico a NJ):
11
+ // - Conjunción: ∧I, ∧EL, ∧ER
12
+ // - Disyunción: ∨IL, ∨IR, ∨E (con descarga)
13
+ // - Implicación: →I (descarga), →E (modus ponens)
14
+ // - Negación: ¬I (descarga, deriva ⊥), ¬E (deriva ⊥)
15
+ // - Falsedad: ⊥E (ex falso quodlibet)
16
+ // - Asunción: hipótesis del contexto
17
+ //
18
+ // Reglas clásicas añadidas:
19
+ // - doubleNegE: ¬¬φ ⊢ φ (eliminación doble negación)
20
+ // - LEM: ⊢ φ ∨ ¬φ (tercero excluido como axioma)
21
+ // - pierce: ⊢ ((φ→ψ)→φ)→φ (ley de Peirce como axioma)
22
+ // - rAA: asume ¬φ, deriva ⊥, concluye φ (reductio ad absurdum)
23
+ //
24
+ // La regla rAA es la dual clásica de ¬I: en NJ, asumiendo φ y
25
+ // derivando ⊥ se concluye ¬φ; en NK, asumiendo ¬φ y derivando
26
+ // ⊥ se concluye φ. Con sólo rAA añadida a NJ se obtiene
27
+ // completitud para la lógica clásica proposicional.
28
+ Object.defineProperty(exports, "__esModule", { value: true });
29
+ exports.CLASSICAL_ONLY_RULES = void 0;
30
+ /**
31
+ * Conjunto de reglas que sólo existen en NK (no en NJ).
32
+ * Útil para detectar si una prueba NK es trasladable a NJ.
33
+ */
34
+ exports.CLASSICAL_ONLY_RULES = ['doubleNegE', 'LEM', 'pierce', 'rAA'];
35
+ //# sourceMappingURL=types.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/logic/profiles/natural-deduction-nk/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mDAAmD;AACnD,+DAA+D;AAC/D,EAAE;AACF,2DAA2D;AAC3D,2DAA2D;AAC3D,6CAA6C;AAC7C,EAAE;AACF,mDAAmD;AACnD,iCAAiC;AACjC,gDAAgD;AAChD,qDAAqD;AACrD,2DAA2D;AAC3D,4CAA4C;AAC5C,2CAA2C;AAC3C,EAAE;AACF,4BAA4B;AAC5B,yEAAyE;AACzE,2EAA2E;AAC3E,wEAAwE;AACxE,0EAA0E;AAC1E,EAAE;AACF,8DAA8D;AAC9D,8DAA8D;AAC9D,wDAAwD;AACxD,oDAAoD;;;AAiDpD;;;GAGG;AACU,QAAA,oBAAoB,GAA0B,CAAC,YAAY,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC"}
@@ -0,0 +1,101 @@
1
+ import type { ProofPackage } from '../proof-exchange';
2
+ export interface KnownProofRecord {
3
+ proof: ProofPackage;
4
+ signature: string;
5
+ sourceId: string;
6
+ receivedAt: string;
7
+ }
8
+ export interface PeerNode {
9
+ id: string;
10
+ publicKey: string;
11
+ peers: Set<string>;
12
+ knownProofs: Map<string, KnownProofRecord>;
13
+ trustedKeys: Set<string>;
14
+ blacklist: Set<string>;
15
+ revoked: Map<string, string>;
16
+ }
17
+ export interface NetworkMessage {
18
+ kind: 'announce' | 'request' | 'response' | 'revoke';
19
+ from: string;
20
+ to: string;
21
+ payload: unknown;
22
+ timestamp: string;
23
+ }
24
+ export interface AnnouncePayload {
25
+ proofHash: string;
26
+ proof: ProofPackage;
27
+ signature: string;
28
+ signerPublicKey: string;
29
+ }
30
+ export interface RequestPayload {
31
+ proofHash: string;
32
+ }
33
+ export interface ResponsePayload {
34
+ proofHash: string;
35
+ proof: ProofPackage | null;
36
+ signature: string | null;
37
+ signerPublicKey: string | null;
38
+ }
39
+ export interface RevokePayload {
40
+ proofHash: string;
41
+ reason: string;
42
+ signerPublicKey: string;
43
+ }
44
+ export declare function proofHash(pkg: ProofPackage): string;
45
+ export interface ProofConflict {
46
+ proofHashA: string;
47
+ proofHashB: string;
48
+ statementsMatch: boolean;
49
+ }
50
+ export declare class GossipNetwork {
51
+ private readonly nodes;
52
+ private readonly queue;
53
+ private droppedCount;
54
+ private deliveredCount;
55
+ addNode(node: PeerNode): void;
56
+ hasNode(id: string): boolean;
57
+ getNode(id: string): PeerNode | undefined;
58
+ listNodes(): PeerNode[];
59
+ connect(nodeA: string, nodeB: string): void;
60
+ disconnect(nodeA: string, nodeB: string): void;
61
+ private requireNode;
62
+ private enqueue;
63
+ publish(fromNode: string, proof: ProofPackage, signature: string): NetworkMessage[];
64
+ request(fromNode: string, hash: string): NetworkMessage[];
65
+ revokeProof(fromNode: string, hash: string, reason: string): NetworkMessage[];
66
+ blacklistKey(nodeId: string, publicKey: string): void;
67
+ tick(): {
68
+ delivered: number;
69
+ dropped: number;
70
+ };
71
+ private handleMessage;
72
+ private handleAnnounce;
73
+ private handleRequest;
74
+ private handleResponse;
75
+ private handleRevoke;
76
+ proofPropagation(hash: string): {
77
+ receivedBy: Set<string>;
78
+ coverage: number;
79
+ };
80
+ drain(maxTicks?: number): {
81
+ ticks: number;
82
+ delivered: number;
83
+ dropped: number;
84
+ };
85
+ totals(): {
86
+ delivered: number;
87
+ dropped: number;
88
+ pending: number;
89
+ };
90
+ }
91
+ export declare function createPeerNode(params: {
92
+ id: string;
93
+ publicKey: string;
94
+ trustedKeys?: Iterable<string>;
95
+ }): PeerNode;
96
+ export declare function detectConflicts(network: GossipNetwork): ProofConflict[];
97
+ export declare function syncPeers(network: GossipNetwork, nodeA: string, nodeB: string): {
98
+ sentAtoB: number;
99
+ sentBtoA: number;
100
+ };
101
+ //# sourceMappingURL=index.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/proof-systems/distributed-exchange/index.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEtD,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,YAAY,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACnB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IAC3C,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACzB,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACvB,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC9B;AAED,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,UAAU,GAAG,SAAS,GAAG,UAAU,GAAG,QAAQ,CAAC;IACrD,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,YAAY,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,cAAc;IAC7B,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,YAAY,GAAG,IAAI,CAAC;IAC3B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAED,MAAM,WAAW,aAAa;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,eAAe,EAAE,MAAM,CAAC;CACzB;AAoBD,wBAAgB,SAAS,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAWnD;AAED,MAAM,WAAW,aAAa;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,OAAO,CAAC;CAC1B;AAED,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAoC;IAC1D,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAwB;IAC9C,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,cAAc,CAAK;IAE3B,OAAO,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI;IAO7B,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI5B,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAIzC,SAAS,IAAI,QAAQ,EAAE;IAIvB,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAQ3C,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAO9C,OAAO,CAAC,WAAW;IAMnB,OAAO,CAAC,OAAO;IAIf,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,GAAG,cAAc,EAAE;IA+BnF,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,cAAc,EAAE;IAiBzD,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,cAAc,EAAE;IAuB7E,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAYrD,IAAI,IAAI;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE;IA8B9C,OAAO,CAAC,aAAa;IAarB,OAAO,CAAC,cAAc;IA2BtB,OAAO,CAAC,aAAa;IAqBrB,OAAO,CAAC,cAAc;IActB,OAAO,CAAC,YAAY;IAiBpB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG;QAAE,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE;IAY7E,KAAK,CAAC,QAAQ,SAAM,GAAG;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE;IAa5E,MAAM,IAAI;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE;CAOlE;AAED,wBAAgB,cAAc,CAAC,MAAM,EAAE;IACrC,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;CAChC,GAAG,QAAQ,CAUX;AAED,wBAAgB,eAAe,CAAC,OAAO,EAAE,aAAa,GAAG,aAAa,EAAE,CA6BvE;AAED,wBAAgB,SAAS,CACvB,OAAO,EAAE,aAAa,EACtB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,GACZ;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAyBxC"}
@@ -0,0 +1,408 @@
1
+ "use strict";
2
+ // ============================================================
3
+ // Distributed Proof Exchange — Simulated Gossip Protocol
4
+ // ============================================================
5
+ //
6
+ // Simula la dinámica de un protocolo P2P para intercambio de proofs:
7
+ // - Nodos con peers y proofs conocidas
8
+ // - Mensajes en cola que se procesan por tick()
9
+ // - Gossip: cuando un nodo aprende una proof, la anuncia a sus peers
10
+ // - Request/response para pedir proofs específicas
11
+ // - Revoke + blacklist para invalidación
12
+ // - Anti-entropy para sincronizar peers desconectados
13
+ //
14
+ // NO usa red real. Las firmas se modelan como strings opacos: la verificación
15
+ // criptográfica vive en `proof-exchange`. Aquí lo que importa es la
16
+ // orquestación de mensajes y el estado distribuido.
17
+ Object.defineProperty(exports, "__esModule", { value: true });
18
+ exports.GossipNetwork = void 0;
19
+ exports.proofHash = proofHash;
20
+ exports.createPeerNode = createPeerNode;
21
+ exports.detectConflicts = detectConflicts;
22
+ exports.syncPeers = syncPeers;
23
+ function nowIso() {
24
+ return new Date().toISOString();
25
+ }
26
+ function hashStringSync(input) {
27
+ // Hash determinista no criptográfico (FNV-1a 64-bit-ish, hex). Sólo para
28
+ // identificar proofs dentro de la simulación. La integridad real la dan
29
+ // las firmas en `proof-exchange`.
30
+ let h1 = 0x811c9dc5;
31
+ let h2 = 0xdeadbeef;
32
+ for (let i = 0; i < input.length; i++) {
33
+ const c = input.charCodeAt(i);
34
+ h1 = Math.imul(h1 ^ c, 0x01000193) >>> 0;
35
+ h2 = Math.imul(h2 ^ c, 0x85ebca6b) >>> 0;
36
+ }
37
+ return h1.toString(16).padStart(8, '0') + h2.toString(16).padStart(8, '0');
38
+ }
39
+ function proofHash(pkg) {
40
+ // Versión síncrona pensada para la simulación. Usa un canonical-ish
41
+ // simple: ordena claves de primer nivel + serializa proof.
42
+ const canonical = JSON.stringify({
43
+ formula: pkg.formula,
44
+ metadata: pkg.metadata,
45
+ profile: pkg.profile,
46
+ proof: pkg.proof,
47
+ version: pkg.version,
48
+ });
49
+ return hashStringSync(canonical);
50
+ }
51
+ class GossipNetwork {
52
+ nodes = new Map();
53
+ queue = [];
54
+ droppedCount = 0;
55
+ deliveredCount = 0;
56
+ addNode(node) {
57
+ if (this.nodes.has(node.id)) {
58
+ throw new Error(`Node already registered: ${node.id}`);
59
+ }
60
+ this.nodes.set(node.id, node);
61
+ }
62
+ hasNode(id) {
63
+ return this.nodes.has(id);
64
+ }
65
+ getNode(id) {
66
+ return this.nodes.get(id);
67
+ }
68
+ listNodes() {
69
+ return Array.from(this.nodes.values());
70
+ }
71
+ connect(nodeA, nodeB) {
72
+ const a = this.requireNode(nodeA);
73
+ const b = this.requireNode(nodeB);
74
+ if (a.id === b.id)
75
+ return;
76
+ a.peers.add(b.id);
77
+ b.peers.add(a.id);
78
+ }
79
+ disconnect(nodeA, nodeB) {
80
+ const a = this.nodes.get(nodeA);
81
+ const b = this.nodes.get(nodeB);
82
+ if (a)
83
+ a.peers.delete(nodeB);
84
+ if (b)
85
+ b.peers.delete(nodeA);
86
+ }
87
+ requireNode(id) {
88
+ const node = this.nodes.get(id);
89
+ if (!node)
90
+ throw new Error(`Unknown node: ${id}`);
91
+ return node;
92
+ }
93
+ enqueue(msg) {
94
+ this.queue.push(msg);
95
+ }
96
+ publish(fromNode, proof, signature) {
97
+ const source = this.requireNode(fromNode);
98
+ const hash = proofHash(proof);
99
+ if (!source.knownProofs.has(hash)) {
100
+ source.knownProofs.set(hash, {
101
+ proof,
102
+ signature,
103
+ sourceId: fromNode,
104
+ receivedAt: nowIso(),
105
+ });
106
+ }
107
+ const emitted = [];
108
+ for (const peerId of source.peers) {
109
+ const msg = {
110
+ kind: 'announce',
111
+ from: fromNode,
112
+ to: peerId,
113
+ payload: {
114
+ proofHash: hash,
115
+ proof,
116
+ signature,
117
+ signerPublicKey: source.publicKey,
118
+ },
119
+ timestamp: nowIso(),
120
+ };
121
+ this.enqueue(msg);
122
+ emitted.push(msg);
123
+ }
124
+ return emitted;
125
+ }
126
+ request(fromNode, hash) {
127
+ const source = this.requireNode(fromNode);
128
+ const emitted = [];
129
+ for (const peerId of source.peers) {
130
+ const msg = {
131
+ kind: 'request',
132
+ from: fromNode,
133
+ to: peerId,
134
+ payload: { proofHash: hash },
135
+ timestamp: nowIso(),
136
+ };
137
+ this.enqueue(msg);
138
+ emitted.push(msg);
139
+ }
140
+ return emitted;
141
+ }
142
+ revokeProof(fromNode, hash, reason) {
143
+ const source = this.requireNode(fromNode);
144
+ source.revoked.set(hash, reason);
145
+ source.knownProofs.delete(hash);
146
+ const emitted = [];
147
+ for (const peerId of source.peers) {
148
+ const msg = {
149
+ kind: 'revoke',
150
+ from: fromNode,
151
+ to: peerId,
152
+ payload: {
153
+ proofHash: hash,
154
+ reason,
155
+ signerPublicKey: source.publicKey,
156
+ },
157
+ timestamp: nowIso(),
158
+ };
159
+ this.enqueue(msg);
160
+ emitted.push(msg);
161
+ }
162
+ return emitted;
163
+ }
164
+ blacklistKey(nodeId, publicKey) {
165
+ const node = this.requireNode(nodeId);
166
+ node.blacklist.add(publicKey);
167
+ // Evict any known proofs originadas en esa key.
168
+ for (const [hash, record] of node.knownProofs.entries()) {
169
+ const sourceNode = this.nodes.get(record.sourceId);
170
+ if (sourceNode && sourceNode.publicKey === publicKey) {
171
+ node.knownProofs.delete(hash);
172
+ }
173
+ }
174
+ }
175
+ tick() {
176
+ let delivered = 0;
177
+ let dropped = 0;
178
+ const pending = this.queue.splice(0, this.queue.length);
179
+ // Mensajes generados durante la propagación de este tick van a una nueva
180
+ // cola para el próximo tick (evita loops infinitos en un solo tick).
181
+ for (const msg of pending) {
182
+ const target = this.nodes.get(msg.to);
183
+ const source = this.nodes.get(msg.from);
184
+ if (!target || !source) {
185
+ dropped++;
186
+ continue;
187
+ }
188
+ // Conexión activa requerida para entrega.
189
+ if (!target.peers.has(msg.from) || !source.peers.has(msg.to)) {
190
+ dropped++;
191
+ continue;
192
+ }
193
+ const ok = this.handleMessage(target, source, msg);
194
+ if (ok) {
195
+ delivered++;
196
+ }
197
+ else {
198
+ dropped++;
199
+ }
200
+ }
201
+ this.deliveredCount += delivered;
202
+ this.droppedCount += dropped;
203
+ return { delivered, dropped };
204
+ }
205
+ handleMessage(target, source, msg) {
206
+ switch (msg.kind) {
207
+ case 'announce':
208
+ return this.handleAnnounce(target, source, msg.payload);
209
+ case 'request':
210
+ return this.handleRequest(target, source, msg.payload);
211
+ case 'response':
212
+ return this.handleResponse(target, source, msg.payload);
213
+ case 'revoke':
214
+ return this.handleRevoke(target, msg.payload);
215
+ }
216
+ }
217
+ handleAnnounce(target, source, payload) {
218
+ if (target.blacklist.has(payload.signerPublicKey))
219
+ return false;
220
+ if (target.revoked.has(payload.proofHash))
221
+ return false;
222
+ if (target.knownProofs.has(payload.proofHash)) {
223
+ // Ya lo conozco: no re-gossip, pero sí lo cuento como entregado.
224
+ return true;
225
+ }
226
+ target.knownProofs.set(payload.proofHash, {
227
+ proof: payload.proof,
228
+ signature: payload.signature,
229
+ sourceId: source.id,
230
+ receivedAt: nowIso(),
231
+ });
232
+ // Gossip a peers (excluye al emisor).
233
+ for (const peerId of target.peers) {
234
+ if (peerId === source.id)
235
+ continue;
236
+ this.enqueue({
237
+ kind: 'announce',
238
+ from: target.id,
239
+ to: peerId,
240
+ payload,
241
+ timestamp: nowIso(),
242
+ });
243
+ }
244
+ return true;
245
+ }
246
+ handleRequest(target, source, payload) {
247
+ const record = target.knownProofs.get(payload.proofHash);
248
+ const signerNode = record ? this.nodes.get(record.sourceId) : undefined;
249
+ const response = record
250
+ ? {
251
+ proofHash: payload.proofHash,
252
+ proof: record.proof,
253
+ signature: record.signature,
254
+ signerPublicKey: signerNode ? signerNode.publicKey : null,
255
+ }
256
+ : { proofHash: payload.proofHash, proof: null, signature: null, signerPublicKey: null };
257
+ this.enqueue({
258
+ kind: 'response',
259
+ from: target.id,
260
+ to: source.id,
261
+ payload: response,
262
+ timestamp: nowIso(),
263
+ });
264
+ return true;
265
+ }
266
+ handleResponse(target, source, payload) {
267
+ if (!payload.proof || !payload.signature || !payload.signerPublicKey)
268
+ return true;
269
+ if (target.blacklist.has(payload.signerPublicKey))
270
+ return false;
271
+ if (target.revoked.has(payload.proofHash))
272
+ return false;
273
+ if (target.knownProofs.has(payload.proofHash))
274
+ return true;
275
+ target.knownProofs.set(payload.proofHash, {
276
+ proof: payload.proof,
277
+ signature: payload.signature,
278
+ sourceId: source.id,
279
+ receivedAt: nowIso(),
280
+ });
281
+ return true;
282
+ }
283
+ handleRevoke(target, payload) {
284
+ if (target.revoked.has(payload.proofHash))
285
+ return true;
286
+ target.revoked.set(payload.proofHash, payload.reason);
287
+ target.knownProofs.delete(payload.proofHash);
288
+ // Propaga a peers (gossip de revocación).
289
+ for (const peerId of target.peers) {
290
+ this.enqueue({
291
+ kind: 'revoke',
292
+ from: target.id,
293
+ to: peerId,
294
+ payload,
295
+ timestamp: nowIso(),
296
+ });
297
+ }
298
+ return true;
299
+ }
300
+ proofPropagation(hash) {
301
+ const receivedBy = new Set();
302
+ for (const node of this.nodes.values()) {
303
+ if (node.knownProofs.has(hash))
304
+ receivedBy.add(node.id);
305
+ }
306
+ const total = this.nodes.size;
307
+ const coverage = total === 0 ? 0 : receivedBy.size / total;
308
+ return { receivedBy, coverage };
309
+ }
310
+ // Drena la cola hasta que no haya más mensajes pendientes (o se alcance
311
+ // el límite). Útil para tests; equivale a varias `tick()` consecutivas.
312
+ drain(maxTicks = 100) {
313
+ let delivered = 0;
314
+ let dropped = 0;
315
+ let ticks = 0;
316
+ while (this.queue.length > 0 && ticks < maxTicks) {
317
+ const result = this.tick();
318
+ delivered += result.delivered;
319
+ dropped += result.dropped;
320
+ ticks++;
321
+ }
322
+ return { ticks, delivered, dropped };
323
+ }
324
+ totals() {
325
+ return {
326
+ delivered: this.deliveredCount,
327
+ dropped: this.droppedCount,
328
+ pending: this.queue.length,
329
+ };
330
+ }
331
+ }
332
+ exports.GossipNetwork = GossipNetwork;
333
+ function createPeerNode(params) {
334
+ return {
335
+ id: params.id,
336
+ publicKey: params.publicKey,
337
+ peers: new Set(),
338
+ knownProofs: new Map(),
339
+ trustedKeys: new Set(params.trustedKeys ?? []),
340
+ blacklist: new Set(),
341
+ revoked: new Map(),
342
+ };
343
+ }
344
+ function detectConflicts(network) {
345
+ // Conflicto = dos hashes distintos en nodos cualesquiera con el mismo
346
+ // (formula, profile). Se reporta como par (A,B) con A<B lexicográfico.
347
+ const byStatement = new Map();
348
+ for (const node of network.listNodes()) {
349
+ for (const [hash, record] of node.knownProofs.entries()) {
350
+ const key = `${record.proof.profile}::${record.proof.formula}`;
351
+ let bucket = byStatement.get(key);
352
+ if (!bucket) {
353
+ bucket = new Map();
354
+ byStatement.set(key, bucket);
355
+ }
356
+ if (!bucket.has(hash))
357
+ bucket.set(hash, record.proof);
358
+ }
359
+ }
360
+ const conflicts = [];
361
+ for (const bucket of byStatement.values()) {
362
+ if (bucket.size < 2)
363
+ continue;
364
+ const hashes = Array.from(bucket.keys()).sort();
365
+ for (let i = 0; i < hashes.length; i++) {
366
+ for (let j = i + 1; j < hashes.length; j++) {
367
+ const a = hashes[i];
368
+ const b = hashes[j];
369
+ if (!a || !b)
370
+ continue;
371
+ conflicts.push({ proofHashA: a, proofHashB: b, statementsMatch: true });
372
+ }
373
+ }
374
+ }
375
+ return conflicts;
376
+ }
377
+ function syncPeers(network, nodeA, nodeB) {
378
+ const a = network.getNode(nodeA);
379
+ const b = network.getNode(nodeB);
380
+ if (!a || !b)
381
+ throw new Error('syncPeers: unknown node');
382
+ let sentAtoB = 0;
383
+ let sentBtoA = 0;
384
+ for (const [hash, record] of a.knownProofs.entries()) {
385
+ if (b.revoked.has(hash))
386
+ continue;
387
+ const signerNode = network.getNode(record.sourceId);
388
+ if (signerNode && b.blacklist.has(signerNode.publicKey))
389
+ continue;
390
+ if (!b.knownProofs.has(hash)) {
391
+ b.knownProofs.set(hash, { ...record, receivedAt: nowIso() });
392
+ sentAtoB++;
393
+ }
394
+ }
395
+ for (const [hash, record] of b.knownProofs.entries()) {
396
+ if (a.revoked.has(hash))
397
+ continue;
398
+ const signerNode = network.getNode(record.sourceId);
399
+ if (signerNode && a.blacklist.has(signerNode.publicKey))
400
+ continue;
401
+ if (!a.knownProofs.has(hash)) {
402
+ a.knownProofs.set(hash, { ...record, receivedAt: nowIso() });
403
+ sentBtoA++;
404
+ }
405
+ }
406
+ return { sentAtoB, sentBtoA };
407
+ }
408
+ //# sourceMappingURL=index.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/proof-systems/distributed-exchange/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yDAAyD;AACzD,+DAA+D;AAC/D,EAAE;AACF,qEAAqE;AACrE,uCAAuC;AACvC,gDAAgD;AAChD,qEAAqE;AACrE,mDAAmD;AACnD,yCAAyC;AACzC,sDAAsD;AACtD,EAAE;AACF,8EAA8E;AAC9E,oEAAoE;AACpE,oDAAoD;;;AAuEpD,8BAWC;AAySD,wCAcC;AAED,0CA6BC;AAED,8BA6BC;AAlZD,SAAS,MAAM;IACb,OAAO,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;AAClC,CAAC;AAED,SAAS,cAAc,CAAC,KAAa;IACnC,yEAAyE;IACzE,wEAAwE;IACxE,kCAAkC;IAClC,IAAI,EAAE,GAAG,UAAU,CAAC;IACpB,IAAI,EAAE,GAAG,UAAU,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;QACzC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC7E,CAAC;AAED,SAAgB,SAAS,CAAC,GAAiB;IACzC,oEAAoE;IACpE,2DAA2D;IAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,OAAO,EAAE,GAAG,CAAC,OAAO;KACrB,CAAC,CAAC;IACH,OAAO,cAAc,CAAC,SAAS,CAAC,CAAC;AACnC,CAAC;AAQD,MAAa,aAAa;IACP,KAAK,GAA0B,IAAI,GAAG,EAAE,CAAC;IACzC,KAAK,GAAqB,EAAE,CAAC;IACtC,YAAY,GAAG,CAAC,CAAC;IACjB,cAAc,GAAG,CAAC,CAAC;IAE3B,OAAO,CAAC,IAAc;QACpB,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QACzD,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,SAAS;QACP,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,CAAC,KAAa,EAAE,KAAa;QAClC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE;YAAE,OAAO;QAC1B,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAClB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IAED,UAAU,CAAC,KAAa,EAAE,KAAa;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC;YAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC;YAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAEO,WAAW,CAAC,EAAU;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,OAAO,CAAC,GAAmB;QACjC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,CAAC,QAAgB,EAAE,KAAmB,EAAE,SAAiB;QAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE;gBAC3B,KAAK;gBACL,SAAS;gBACT,QAAQ,EAAE,QAAQ;gBAClB,UAAU,EAAE,MAAM,EAAE;aACrB,CAAC,CAAC;QACL,CAAC;QACD,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAClC,MAAM,GAAG,GAAmB;gBAC1B,IAAI,EAAE,UAAU;gBAChB,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,MAAM;gBACV,OAAO,EAAE;oBACP,SAAS,EAAE,IAAI;oBACf,KAAK;oBACL,SAAS;oBACT,eAAe,EAAE,MAAM,CAAC,SAAS;iBACR;gBAC3B,SAAS,EAAE,MAAM,EAAE;aACpB,CAAC;YACF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,OAAO,CAAC,QAAgB,EAAE,IAAY;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAClC,MAAM,GAAG,GAAmB;gBAC1B,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,MAAM;gBACV,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAA2B;gBACrD,SAAS,EAAE,MAAM,EAAE;aACpB,CAAC;YACF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,WAAW,CAAC,QAAgB,EAAE,IAAY,EAAE,MAAc;QACxD,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACjC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAClC,MAAM,GAAG,GAAmB;gBAC1B,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,MAAM;gBACV,OAAO,EAAE;oBACP,SAAS,EAAE,IAAI;oBACf,MAAM;oBACN,eAAe,EAAE,MAAM,CAAC,SAAS;iBACV;gBACzB,SAAS,EAAE,MAAM,EAAE;aACpB,CAAC;YACF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,YAAY,CAAC,MAAc,EAAE,SAAiB;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC9B,gDAAgD;QAChD,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YACxD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACnD,IAAI,UAAU,IAAI,UAAU,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACrD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI;QACF,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACxD,yEAAyE;QACzE,qEAAqE;QACrE,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;gBACvB,OAAO,EAAE,CAAC;gBACV,SAAS;YACX,CAAC;YACD,0CAA0C;YAC1C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC7D,OAAO,EAAE,CAAC;gBACV,SAAS;YACX,CAAC;YACD,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACnD,IAAI,EAAE,EAAE,CAAC;gBACP,SAAS,EAAE,CAAC;YACd,CAAC;iBAAM,CAAC;gBACN,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QACD,IAAI,CAAC,cAAc,IAAI,SAAS,CAAC;QACjC,IAAI,CAAC,YAAY,IAAI,OAAO,CAAC;QAC7B,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;IAChC,CAAC;IAEO,aAAa,CAAC,MAAgB,EAAE,MAAgB,EAAE,GAAmB;QAC3E,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,OAA0B,CAAC,CAAC;YAC7E,KAAK,SAAS;gBACZ,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,OAAyB,CAAC,CAAC;YAC3E,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,OAA0B,CAAC,CAAC;YAC7E,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,OAAwB,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IAEO,cAAc,CAAC,MAAgB,EAAE,MAAgB,EAAE,OAAwB;QACjF,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,eAAe,CAAC;YAAE,OAAO,KAAK,CAAC;QAChE,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC;YAAE,OAAO,KAAK,CAAC;QACxD,IAAI,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YAC9C,iEAAiE;YACjE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE;YACxC,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,SAAS,EAAE,OAAO,CAAC,SAAS;YAC5B,QAAQ,EAAE,MAAM,CAAC,EAAE;YACnB,UAAU,EAAE,MAAM,EAAE;SACrB,CAAC,CAAC;QACH,sCAAsC;QACtC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,MAAM,KAAK,MAAM,CAAC,EAAE;gBAAE,SAAS;YACnC,IAAI,CAAC,OAAO,CAAC;gBACX,IAAI,EAAE,UAAU;gBAChB,IAAI,EAAE,MAAM,CAAC,EAAE;gBACf,EAAE,EAAE,MAAM;gBACV,OAAO;gBACP,SAAS,EAAE,MAAM,EAAE;aACpB,CAAC,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,aAAa,CAAC,MAAgB,EAAE,MAAgB,EAAE,OAAuB;QAC/E,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACzD,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACxE,MAAM,QAAQ,GAAoB,MAAM;YACtC,CAAC,CAAC;gBACE,SAAS,EAAE,OAAO,CAAC,SAAS;gBAC5B,KAAK,EAAE,MAAM,CAAC,KAAK;gBACnB,SAAS,EAAE,MAAM,CAAC,SAAS;gBAC3B,eAAe,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI;aAC1D;YACH,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC;QAC1F,IAAI,CAAC,OAAO,CAAC;YACX,IAAI,EAAE,UAAU;YAChB,IAAI,EAAE,MAAM,CAAC,EAAE;YACf,EAAE,EAAE,MAAM,CAAC,EAAE;YACb,OAAO,EAAE,QAAQ;YACjB,SAAS,EAAE,MAAM,EAAE;SACpB,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,cAAc,CAAC,MAAgB,EAAE,MAAgB,EAAE,OAAwB;QACjF,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,SAAS,IAAI,CAAC,OAAO,CAAC,eAAe;YAAE,OAAO,IAAI,CAAC;QAClF,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,eAAe,CAAC;YAAE,OAAO,KAAK,CAAC;QAChE,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC;YAAE,OAAO,KAAK,CAAC;QACxD,IAAI,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC;YAAE,OAAO,IAAI,CAAC;QAC3D,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE;YACxC,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,SAAS,EAAE,OAAO,CAAC,SAAS;YAC5B,QAAQ,EAAE,MAAM,CAAC,EAAE;YACnB,UAAU,EAAE,MAAM,EAAE;SACrB,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,YAAY,CAAC,MAAgB,EAAE,OAAsB;QAC3D,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC;YAAE,OAAO,IAAI,CAAC;QACvD,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACtD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC7C,0CAA0C;QAC1C,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,CAAC,OAAO,CAAC;gBACX,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,MAAM,CAAC,EAAE;gBACf,EAAE,EAAE,MAAM;gBACV,OAAO;gBACP,SAAS,EAAE,MAAM,EAAE;aACpB,CAAC,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gBAAgB,CAAC,IAAY;QAC3B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1D,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAC9B,MAAM,QAAQ,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,GAAG,KAAK,CAAC;QAC3D,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;IAClC,CAAC;IAED,wEAAwE;IACxE,wEAAwE;IACxE,KAAK,CAAC,QAAQ,GAAG,GAAG;QAClB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAC3B,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC;YAC9B,OAAO,IAAI,MAAM,CAAC,OAAO,CAAC;YAC1B,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;IACvC,CAAC;IAED,MAAM;QACJ,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,cAAc;YAC9B,OAAO,EAAE,IAAI,CAAC,YAAY;YAC1B,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM;SAC3B,CAAC;IACJ,CAAC;CACF;AA/RD,sCA+RC;AAED,SAAgB,cAAc,CAAC,MAI9B;IACC,OAAO;QACL,EAAE,EAAE,MAAM,CAAC,EAAE;QACb,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,KAAK,EAAE,IAAI,GAAG,EAAE;QAChB,WAAW,EAAE,IAAI,GAAG,EAAE;QACtB,WAAW,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,WAAW,IAAI,EAAE,CAAC;QAC9C,SAAS,EAAE,IAAI,GAAG,EAAE;QACpB,OAAO,EAAE,IAAI,GAAG,EAAE;KACnB,CAAC;AACJ,CAAC;AAED,SAAgB,eAAe,CAAC,OAAsB;IACpD,sEAAsE;IACtE,uEAAuE;IACvE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAqC,CAAC;IACjE,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YACxD,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,KAAK,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;YAC/D,IAAI,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;gBACnB,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC/B,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD,MAAM,SAAS,GAAoB,EAAE,CAAC;IACtC,KAAK,MAAM,MAAM,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;QAC1C,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC;YAAE,SAAS;QAC9B,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;oBAAE,SAAS;gBACvB,SAAS,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC,CAAC;YAC1E,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAgB,SAAS,CACvB,OAAsB,EACtB,KAAa,EACb,KAAa;IAEb,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACjC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACzD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;QACrD,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAClC,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACpD,IAAI,UAAU,IAAI,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC;YAAE,SAAS;QAClE,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;YAC7D,QAAQ,EAAE,CAAC;QACb,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;QACrD,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAClC,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACpD,IAAI,UAAU,IAAI,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC;YAAE,SAAS;QAClE,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;YAC7D,QAAQ,EAAE,CAAC;QACb,CAAC;IACH,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC"}
@@ -0,0 +1,17 @@
1
+ import type { DFA } from './types';
2
+ /** ¿`M` acepta `input`? Si en algún punto no hay transición definida,
3
+ * rechaza inmediatamente (DFA visto como función parcial). */
4
+ export declare function dfaAccepts(M: DFA, input: string): boolean;
5
+ /** Totaliza un DFA agregando un sink-state para las aristas faltantes.
6
+ * Devuelve un DFA equivalente con `transitions` totales sobre alfabeto. */
7
+ export declare function dfaTotalize(M: DFA, sinkName?: string): DFA;
8
+ /** Complemento de `M`: misma estructura, accept = states \ accept. */
9
+ export declare function dfaComplement(M: DFA): DFA;
10
+ /** Producto cartesiano con predicado de aceptación arbitrario sobre
11
+ * (a-state, b-state). Sólo se crean estados alcanzables desde el par
12
+ * inicial. */
13
+ export declare function dfaProduct(a: DFA, b: DFA, acceptPair: (sa: string, sb: string) => boolean): DFA;
14
+ export declare function dfaUnion(a: DFA, b: DFA): DFA;
15
+ export declare function dfaIntersection(a: DFA, b: DFA): DFA;
16
+ export declare function dfaMinimize(M: DFA): DFA;
17
+ //# sourceMappingURL=dfa.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"dfa.d.ts","sourceRoot":"","sources":["../../../src/reasoning/automata/dfa.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,GAAG,EAAU,MAAM,SAAS,CAAC;AAE3C;+DAC+D;AAC/D,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAUzD;AAED;4EAC4E;AAC5E,wBAAgB,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,SAAa,GAAG,GAAG,CAsC9D;AAED,sEAAsE;AACtE,wBAAgB,aAAa,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAWzC;AAED;;eAEe;AACf,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,OAAO,GAAG,GAAG,CAuC/F;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAE5C;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAEnD;AAaD,wBAAgB,WAAW,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAuHvC"}