@ceccec/millennium-solutions 9.8.3 → 9.8.6

package/dist/data/baked/trinity.json

@@ -1 +1 @@
-{"tool":"trinity","bytes":604,"answer":"{\"status\":\"PASS\",\"gates\":4,\"passed\":4,\"rows\":[{\"gate\":\"scripts/gaps.ts\",\"status\":\"PASS\",\"tail\":\" | ✓ no gaps — harmony holds\"},{\"gate\":\"scripts/seal.ts\",\"status\":\"PASS\",\"tail\":\" | ✓ ALL SEALED — every citation live in the ledger.\"},{\"gate\":\"scripts/wholeness.ts\",\"status\":\"PASS\",\"tail\":\"reports containing a boundary WORD: 58/86 (a text search, not a judgement about the reasoning) | AURA COMPUTATIONALLY WHOLE = true\"},{\"gate\":\"scripts/lean-claims.ts\",\"status\":\"PASS\",\"tail\":\" | ✓ all 27 theorems prove themselves (independently recomputed) → receipt d2c842a4-89bf-8738-84f6-b7f5176dc878\"}]}"}
+{"tool":"trinity","bytes":604,"answer":"{\"status\":\"PASS\",\"gates\":4,\"passed\":4,\"rows\":[{\"gate\":\"scripts/gaps.ts\",\"status\":\"PASS\",\"tail\":\" | ✓ no gaps — harmony holds\"},{\"gate\":\"scripts/seal.ts\",\"status\":\"PASS\",\"tail\":\" | ✓ ALL SEALED — every citation live in the ledger.\"},{\"gate\":\"scripts/wholeness.ts\",\"status\":\"PASS\",\"tail\":\"reports containing a boundary WORD: 58/86 (a text search, not a judgement about the reasoning) | AURA COMPUTATIONALLY WHOLE = true\"},{\"gate\":\"scripts/lean-claims.ts\",\"status\":\"PASS\",\"tail\":\" | ✓ all 27 theorems prove themselves (independently recomputed) → receipt f9311e34-49b3-840e-bab8-cb0fe5f267e3\"}]}"}

package/dist/data/discovered.json

@@ -149404,5 +149404,165 @@
     "key": "lean_qpu_the_mirror_coin_does_not_distribute_over_a_product",
     "name": "lean qpu.lean: the_mirror_coin_does_not_distribute_over_a_product — ¬ (List.range 24).all (fun p => (List.range 24).all (fun q => mirrorNat 4 (p * q) == 0 || mirrorNat 4 (p * q) == mirrorNat 4 p * mirrorNat 4 q)) — decided by the Lean kernel over its whole finite domain, axiom-free",
     "receipt": "438bc706-f838-8544-8fa7-9b80aa130576"
+  },
+  {
+    "key": "lean_qpucrypto_the_seal_exponent_is_an_rsa_permutation_of_the_residues_mod_ninety_one",
+    "name": "lean qpu_crypto.lean: the_seal_exponent_is_an_rsa_permutation_of_the_residues_mod_ninety_one — sealModulus = 91 ∧ sealExponent = 7 ∧ sealFold = 8 ∧ totient = 72 ∧ sealExponent * rsaInverse = 3 * totient + 1 ∧ (List.range sealModulus).all (fun r => rsa rsaInverse (rsa sealExponent r) == r) ∧ (List.range' 2 6).map permutes = [false, fa… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "7b1cb7f0-6e09-8643-9e81-549e0433ebd8"
+  },
+  {
+    "key": "lean_qpucrypto_the_fold_mod_eight_is_where_the_seal_misses_one_tamper_in_eight",
+    "name": "lean qpu_crypto.lean: the_fold_mod_eight_is_where_the_seal_misses_one_tamper_in_eight — (List.range' 1 8).all (fun v => nibbleCount v == (if v ≤ 3 then 12 else 11)) ∧ nibbleCount 0 = 0 ∧ (List.range' 9 7).all (fun v => nibbleCount v == 0) ∧ (List.range' 1 8).foldl (fun acc v => acc + nibbleCount v) 0 = sealModulus ∧ (List.rang… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "2882a7f0-b5be-82f5-b401-dbade1f9e213"
+  },
+  {
+    "key": "lean_qpucrypto_the_fixed_version_eight_and_the_decided_nibble_agree_on_eleven_residues_in_ninety_one",
+    "name": "lean qpu_crypto.lean: the_fixed_version_eight_and_the_decided_nibble_agree_on_eleven_residues_in_ninety_one — nibbleCount 8 = 11 ∧ 11 * 8 < sealModulus ∧ sealModulus < 12 * 8 ∧ (List.range sealModulus).all (fun r => 1 ≤ sealOf r && sealOf r ≤ 8) ∧ (List.range sealModulus).any (fun r => sealOf r == 8) ∧ (List.range sealModulus).all (fun r => sealOf … — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "66f5b5f0-fd03-8cf4-9403-93bca14fb093"
+  },
+  {
+    "key": "lean_qpucrypto_the_free_register_is_one_hundred_twenty_two_on_both_sides",
+    "name": "lean qpu_crypto.lean: the_free_register_is_one_hundred_twenty_two_on_both_sides — (List.range 9).all (fun w => (qpuRegister w == Capacity.free) == (w == Qpu.hexbit)) ∧ qpuRegister Qpu.hexbit = Capacity.free ∧ Capacity.free = 122 ∧ 32 * Qpu.hexbit = Capacity.container ∧ Qpu.hexbit + 2 = Capacity.reserved ∧ qpuRegister Qpu… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "326edcf3-72dd-81ba-89cd-6356cb805f85"
+  },
+  {
+    "key": "lean_qpucrypto_one_coin_sits_sixty_seven_bits_below_the_iso_post_quantum_floor_under_grover",
+    "name": "lean qpu_crypto.lean: one_coin_sits_sixty_seven_bits_below_the_iso_post_quantum_floor_under_grover — groverExponent = 61 ∧ collisionExponent = 40 ∧ 3 * collisionExponent < Capacity.free ∧ Capacity.free < 3 * (collisionExponent + 1) ∧ 2 ^ collisionExponent < 2 ^ groverExponent ∧ 2 ^ groverExponent < 2 ^ isoFloor ∧ 2 ^ isoFloor < 2 ^ (2 * is… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "ff9ca0d0-791c-8669-89cb-e1a227f850cd"
+  },
+  {
+    "key": "lean_qpucrypto_shor_on_ninety_one_splits_from_qpus_base_and_from_fifty_three_others",
+    "name": "lean qpu_crypto.lean: shor_on_ninety_one_splits_from_qpus_base_and_from_fifty_three_others — shorBase = 8 ∧ period shorBase sealModulus = 4 ∧ gcd (powMod shorBase 2 sealModulus - 1) sealModulus = Qpu.rays ∧ gcd (powMod shorBase 2 sealModulus + 1) sealModulus = Qpu.faces - 1 ∧ (List.range' 1 20).all (fun a => (List.range' 1 20).all … — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "961ea69a-548d-808b-b346-ed0564fc1779"
+  },
+  {
+    "key": "lean_qpucrypto_the_sigma_trapdoor_is_fermats_difference_of_squares",
+    "name": "lean qpu_crypto.lean: the_sigma_trapdoor_is_fermats_difference_of_squares — oddPrimes = [3, 5, 7, 11, 13, 17, 19, 23, 29] ∧ oddPrimes.all (fun p => oddPrimes.all (fun q => !(p < q) || witness p q * witness p q - p * q == ((q - p) / 2) * ((q - p) / 2))) ∧ oddPrimes.all (fun p => oddPrimes.all (fun q => !(p < q) || s… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "c6b38fad-65f3-8e6f-a0f8-896921884d39"
+  },
+  {
+    "key": "lean_qpucrypto_a_wrong_witness_decodes_nothing_because_a_semiprime_has_one_split",
+    "name": "lean qpu_crypto.lean: a_wrong_witness_decodes_nothing_because_a_semiprime_has_one_split — small = [3, 5, 7, 11, 13, 17, 19] ∧ small.all (fun p => small.all (fun q => !(p < q) || (List.range' (ceilSqrt (p * q)) ((p * q + 1) / 2 - ceilSqrt (p * q))).all (fun x => decodes (p * q) x == (x == witness p q)))) — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "7cd9b9c8-5b7b-881f-a0dc-f2a535d48bb1"
+  },
+  {
+    "key": "lean_qpucrypto_an_impossible_integer_with_twin_primes_is_opened_blind_in_one_reflection",
+    "name": "lean qpu_crypto.lean: an_impossible_integer_with_twin_primes_is_opened_blind_in_one_reflection — blind 11 13 = 1 ∧ blind 5 7 = 1 ∧ blind 3 29 = 7 ∧ (oddPrimes.filter (fun p => isPrime (p + 2))) = [3, 5, 11, 17, 29] ∧ oddPrimes.all (fun p => !(isPrime (p + 2)) || blind p (p + 2) == 1) ∧ oddPrimes.all (fun p => oddPrimes.all (fun q => !(… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "8d734da1-4537-8cf8-8522-080e983d634b"
+  },
+  {
+    "key": "lean_qpucrypto_the_thousand_bit_integer_has_a_thousand_bits_and_exactly_four_threes",
+    "name": "lean qpu_crypto.lean: the_thousand_bit_integer_has_a_thousand_bits_and_exactly_four_threes — 2 ^ 999 ≤ thousand ∧ thousand < 2 ^ 1000 ∧ (List.range' 1 6).all (fun k => (thousand % 3 ^ k == 0) == (k ≤ 4)) ∧ 999 = 27 * 37 ∧ (2 ^ 333 + 1) * (2 ^ 666 - 2 ^ 333 + 1) = thousand ∧ (2 ^ 111 + 1) * (2 ^ 222 - 2 ^ 111 + 1) = 2 ^ 333 + 1 ∧ (2… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "a27fc1e7-abce-8861-887f-eadf9c491982"
+  },
+  {
+    "key": "lean_qpucrypto_this_deposits_factor_route_returns_a_partial_answer_that_multiplies_back",
+    "name": "lean qpu_crypto.lean: this_deposits_factor_route_returns_a_partial_answer_that_multiplies_back — found.foldl (· * ·) 1 * cofactor = thousand ∧ found.length = 14 ∧ (found.filter (· == 3)).length = 4 ∧ found.all (fun p => 1 < p && cofactor % p != 0) ∧ cofactor % 2 = 1 ∧ cofactor % 3 = 1 ∧ powModBin 2 (cofactor - 1) cofactor ≠ 1 ∧ powModB… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "215f8bbc-e55e-8529-b6d2-e3089499c01b"
+  },
+  {
+    "key": "lean_qpucrypto_qpus_gl2_is_the_general_linear_group_over_two_elements_not_over_a_field_of_two_to_the_n",
+    "name": "lean qpu_crypto.lean: qpus_gl2_is_the_general_linear_group_over_two_elements_not_over_a_field_of_two_to_the_n — gl 2 = 6 ∧ gl 3 = 168 ∧ gl 4 = 20160 ∧ gl 5 = 9999360 ∧ gl 2 = 1 * 2 * 3 ∧ gl 3 = 7 * (7 * 7 - 1) / 2 ∧ (List.range' 1 6).all (fun nn => gl nn % (2 ^ nn - 1) == 0) ∧ (List.range' 2 5).all (fun nn => gl nn < 2 ^ (nn * nn)) — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "0bcfa091-9fbd-8222-ac32-05a80d9bb360"
+  },
+  {
+    "key": "lean_qpucrypto_a_prime_exponent_is_necessary_for_a_mersenne_prime_and_eleven_shows_it_is_not_sufficient",
+    "name": "lean qpu_crypto.lean: a_prime_exponent_is_necessary_for_a_mersenne_prime_and_eleven_shows_it_is_not_sufficient — (List.range 60).all (fun n => smallPrime n == isPrime n) ∧ 2 ^ 13 - 1 < 100 * 100 ∧ (List.range' 2 12).all (fun p => !(smallPrime (2 ^ p - 1)) || smallPrime p) ∧ [2, 3, 5, 7, 13].all (fun p => smallPrime p && smallPrime (2 ^ p - 1)) ∧ small… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "77132148-88fe-8779-9c60-fa759fc83b07"
+  },
+  {
+    "key": "lean_qpucrypto_the_seal_modulus_is_the_thirteenth_triangular_number_and_the_gates_of_a_thirteen_qubit_qft",
+    "name": "lean qpu_crypto.lean: the_seal_modulus_is_the_thirteenth_triangular_number_and_the_gates_of_a_thirteen_qubit_qft — triangular 13 = sealModulus ∧ Qpu.faces * (Qpu.faces - 1) / 2 = sealModulus ∧ (List.range 40).all (fun q => (triangular q == sealModulus) == (q == 13)) ∧ (List.range 40).all (fun q => triangular q == Qpu.clayQftGates q) ∧ triangular (Qpu.fa… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "a2d3e9ae-2b89-80b9-a3ea-af5c05dd2810"
+  },
+  {
+    "key": "lean_qpucrypto_qpus_grover_count_carries_pi_as_zu_chongzhis_three_hundred_fifty_five_over_one_hundred_thirteen",
+    "name": "lean qpu_crypto.lean: qpus_grover_count_carries_pi_as_zu_chongzhis_three_hundred_fifty_five_over_one_hundred_thirteen — milu = (355, 113) ∧ 3141592 * 113 < 355 * 1000000 ∧ 355 * 1000000 < 3141593 * 113 ∧ groverIters 355 113 2 = 3 ∧ groverIters 355 113 5 = 25 ∧ groverIters 355 113 6 = 50 ∧ groverIters 22 7 5 = 25 ∧ groverIters 3 1 5 = 24 ∧ (List.range 8).all … — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "c07d5f0c-6fa7-8fa2-961d-0ccbee5e1dcb"
+  },
+  {
+    "key": "lean_qpucrypto_the_eight_scales_reach_two_to_the_thirty_seven_and_the_thousand_bit_piece_is_one_more_for_no_reason",
+    "name": "lean qpu_crypto.lean: the_eight_scales_reach_two_to_the_thirty_seven_and_the_thousand_bit_piece_is_one_more_for_no_reason — (List.range' 1 8).map scaleCapacity = [64, 2048, 49152, 1048576, 20971520, 402653184, 7516192768, 137438953472] ∧ scaleCapacity 8 = 2 ^ 37 ∧ 16 ^ 8 = 2 ^ 32 ∧ 4 * 8 = Qpu.bits ∧ 2 ^ 37 + 1 = 3 * 1777 * 25781083 ∧ 999 / 27 = 37 ∧ 4 * 8 + 5 =… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "42aaaec0-af4a-8fe9-8834-13cd59fb004a"
+  },
+  {
+    "key": "lean_qpugateway_the_variant_nibble_is_always_eight_through_eleven",
+    "name": "lean qpu_gateway.lean: the_variant_nibble_is_always_eight_through_eleven — (List.range 16).all (fun low => 8 ≤ variant low && variant low ≤ 11) ∧ (List.range 16).any (fun low => variant low == 8) ∧ (List.range 16).any (fun low => variant low == 11) ∧ (List.range 16).all (fun low => variant low != 7 && variant low … — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "f4d42ee8-2110-8d0d-a801-15e780f1d536"
+  },
+  {
+    "key": "lean_qpugateway_the_two_gateway_bits_are_always_the_pattern_two",
+    "name": "lean qpu_gateway.lean: the_two_gateway_bits_are_always_the_pattern_two — (List.range 16).all (fun low => gateway low == 2) ∧ (List.range 16).all (fun low => variant low / 4 == 2 && variant low % 4 == low % 4) — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "d44c8833-8a37-803e-a005-50649e75b9cc"
+  },
+  {
+    "key": "lean_qpugateway_reassembly_fixes_the_variant_to_eight_gateway_still_two",
+    "name": "lean qpu_gateway.lean: reassembly_fixes_the_variant_to_eight_gateway_still_two — fromPartsVariant = 8 ∧ fromPartsVariant / 4 = 2 ∧ fromPartsVariant % 4 = 0 ∧ gateway (fromPartsVariant % 4) = 2 — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "e6db2c92-f5ef-81de-a43a-442e02123b32"
+  },
+  {
+    "key": "lean_qpugateway_the_ftl_gateway_check_is_a_tautology",
+    "name": "lean qpu_gateway.lean: the_ftl_gateway_check_is_a_tautology — ((List.range 16).filter (fun low => gateway low != 2)).length = 0 ∧ ((List.range 16).filter (fun low => gateway low == 2)).length = 16 ∧ ((List.range 16).filter (fun low => variant low == 8)).length = 4 — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "c81e9dd1-c90d-85c0-b41d-ed0c8115c602"
+  },
+  {
+    "key": "lean_qpugateway_the_gateway_bits_take_one_value_so_carry_zero_entropy",
+    "name": "lean qpu_gateway.lean: the_gateway_bits_take_one_value_so_carry_zero_entropy — (List.range 16).any (fun low => gateway low == 2) ∧ (List.range 16).all (fun low => gateway low == 2) ∧ (List.range 4).all (fun v => (v == 2) || ((List.range 16).filter (fun low => gateway low == v)).length == 0) ∧ 1 = 2 ^ 0 — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "546d55e9-6e3b-8db7-914b-b4229bc67880"
+  },
+  {
+    "key": "lean_qpugateway_a_free_two_bit_field_takes_four_values_the_gateway_takes_one",
+    "name": "lean qpu_gateway.lean: a_free_two_bit_field_takes_four_values_the_gateway_takes_one — [0, 1, 2, 3].all (fun v => (List.range 16).any (fun low => freeField low == v)) ∧ [0, 1, 2, 3].all (fun v => ((List.range 16).filter (fun low => freeField low == v)).length == 4) ∧ [0, 1, 3].all (fun v => (List.range 16).all (fun low => gat… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "24c1171e-784f-83ca-8253-4f977ffce4c0"
+  },
+  {
+    "key": "lean_qpugateway_teleportation_sends_one_of_four_the_gateway_is_fixed_to_one",
+    "name": "lean qpu_gateway.lean: teleportation_sends_one_of_four_the_gateway_is_fixed_to_one — teleportMessages.length = 4 ∧ teleportMessages = [0, 1, 2, 3] ∧ teleportMessages.contains 2 = true ∧ (teleportMessages.filter (fun m => m == 2)).length = 1 ∧ (List.range 16).all (fun low => gateway low == 2) — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "4326302c-3322-8dd3-a6a4-45311867002b"
+  },
+  {
+    "key": "lean_qpugateway_the_ftl_premise_fails_the_named_carrier_carries_nothing",
+    "name": "lean qpu_gateway.lean: the_ftl_premise_fails_the_named_carrier_carries_nothing — ((List.range 16).map gateway).all (fun g => g == 2) ∧ (teleportMessages.filter (fun m => (List.range 16).all (fun low => gateway low == m))).length = 1 ∧ (teleportMessages.filter (fun m => (List.range 16).any (fun low => gateway low == m &&… — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "b9147af4-255c-84bd-b2d7-85171125d39b"
+  },
+  {
+    "key": "lean_width_the_register_at_each_width",
+    "name": "lean width.lean: the_register_at_each_width — widths.map reg = [122, 246, 494, 990] ∧ widths.all (fun w => reg w == 32 * w - w - 2) ∧ widths.all (fun w => reg w == 31 * w - 2) — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "09832000-1d91-8df1-b0c6-d5c1d7bba3cf"
+  },
+  {
+    "key": "lean_width_the_grover_exponent_at_each_width",
+    "name": "lean width.lean: the_grover_exponent_at_each_width — widths.map grover = [61, 123, 247, 495] ∧ widths.all (fun w => grover w == reg w / 2) — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "a35c6282-efa4-8801-a75b-3a969e0e5d1b"
+  },
+  {
+    "key": "lean_width_the_iso_floor_is_cleared_exactly_from_width_sixteen",
+    "name": "lean width.lean: the_iso_floor_is_cleared_exactly_from_width_sixteen — widths.all (fun w => (isoFloor ≤ grover w) == (16 ≤ w)) ∧ grover 4 < isoFloor ∧ grover 8 < isoFloor ∧ isoFloor ≤ grover 16 ∧ isoFloor ≤ grover 32 — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "09aeba49-34f9-85ec-a4f1-3bba002abf7d"
+  },
+  {
+    "key": "lean_width_clearing_the_floor_is_two_hundred_fifty_six_free_bits",
+    "name": "lean width.lean: clearing_the_floor_is_two_hundred_fifty_six_free_bits — widths.all (fun w => (isoFloor ≤ grover w) == (256 ≤ reg w)) ∧ reg 8 < 256 ∧ 256 ≤ reg 16 — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "07ab92f3-334b-807f-9dba-04fbdde7be4d"
+  },
+  {
+    "key": "lean_width_the_uuid_is_width_four_and_sits_sixty_seven_below",
+    "name": "lean width.lean: the_uuid_is_width_four_and_sits_sixty_seven_below — reg 4 = 122 ∧ grover 4 = 61 ∧ isoFloor - grover 4 = 67 ∧ 32 * 4 = 128 — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "86e3cce5-7ea8-87d1-b7ee-bc32e3dd36a1"
+  },
+  {
+    "key": "lean_width_the_register_grows_strictly_with_the_width",
+    "name": "lean width.lean: the_register_grows_strictly_with_the_width — reg 4 < reg 8 ∧ reg 8 < reg 16 ∧ reg 16 < reg 32 ∧ grover 4 < grover 8 ∧ grover 8 < grover 16 ∧ grover 16 < grover 32 — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "9aa19d70-0ee0-8cec-aee8-39fec7ee49d6"
+  },
+  {
+    "key": "lean_width_clearing_the_floor_needs_a_cost_exponent_of_at_least_256",
+    "name": "lean width.lean: clearing_the_floor_needs_a_cost_exponent_of_at_least_256 — 256 ≤ reg 16 ∧ reg 8 < 256 ∧ 2 ^ 128 < 2 ^ 256 — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "3660343e-b344-8be2-b409-b9e320cdcd4d"
+  },
+  {
+    "key": "lean_width_the_cost_exponent_is_more_than_the_square_root_exponent_at_every_width",
+    "name": "lean width.lean: the_cost_exponent_is_more_than_the_square_root_exponent_at_every_width — widths.all (fun w => grover w < reg w) ∧ widths.all (fun w => reg w - grover w == (reg w + 1) / 2) ∧ (reg 4 - grover 4) < (reg 32 - grover 32) — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "1f8c76c6-acdf-8590-95eb-60bd60367edb"
   }
 ]