chia-blockchain 2.5.2rc2__py3-none-any.whl → 2.5.3rc2__py3-none-any.whl

chia/wallet/cat_wallet/puzzles/cat_truths.clib

@@ -1,31 +0,0 @@
-(
-  (defun-inline cat_truth_data_to_truth_struct (innerpuzhash cat_struct my_id this_coin_info)
-    (c
-      (c
-        innerpuzhash
-        cat_struct
-      )
-      (c
-        my_id
-        this_coin_info
-      )
-    )
-  )
-
-  ; CAT Truths is: ((Inner puzzle hash . (MOD hash . (MOD hash hash . TAIL hash))) . (my_id . (my_parent_info my_puzhash my_amount)))
-
-  (defun-inline my_inner_puzzle_hash_cat_truth (Truths) (f (f Truths)))
-  (defun-inline cat_struct_truth (Truths) (r (f Truths)))
-  (defun-inline my_id_cat_truth (Truths) (f (r Truths)))
-  (defun-inline my_coin_info_truth (Truths) (r (r Truths)))
-  (defun-inline my_amount_cat_truth (Truths) (f (r (r (my_coin_info_truth Truths)))))
-  (defun-inline my_full_puzzle_hash_cat_truth (Truths) (f (r (my_coin_info_truth Truths))))
-  (defun-inline my_parent_cat_truth (Truths) (f (my_coin_info_truth Truths)))
-
-
-  ; CAT mod_struct is: (MOD_HASH MOD_HASH_hash TAIL_PROGRAM TAIL_PROGRAM_hash)
-
-  (defun-inline cat_mod_hash_truth (Truths) (f (cat_struct_truth Truths)))
-  (defun-inline cat_mod_hash_hash_truth (Truths) (f (r (cat_struct_truth Truths))))
-  (defun-inline cat_tail_program_hash_truth (Truths) (f (r (r (cat_struct_truth Truths)))))
-)

chia/wallet/cat_wallet/puzzles/cat_v2.clsp

@@ -1,397 +0,0 @@
-; Coins locked with this puzzle are spendable cats.
-;
-; Choose a list of n inputs (n>=1), I_1, ... I_n with amounts A_1, ... A_n.
-;
-; We put them in a ring, so "previous" and "next" have intuitive k-1 and k+1 semantics,
-; wrapping so {n} and 0 are the same, ie. all indices are mod n.
-;
-; Each coin creates 0 or more coins with total output value O_k.
-; Let D_k = the "debt" O_k - A_k contribution of coin I_k, ie. how much debt this input accumulates.
-; Some coins may spend more than they contribute and some may spend less, ie. D_k need
-; not be zero. That's okay. It's enough for the total of all D_k in the ring to be 0.
-;
-; A coin can calculate its own D_k since it can verify A_k (it's hashed into the coin id)
-; and it can sum up `CREATE_COIN` conditions for O_k.
-;
-; Defines a "subtotal of debts" S_k for each coin as follows:
-;
-; S_1 = 0
-; S_k = S_{k-1} + D_{k-1}
-;
-; Here's the main trick that shows the ring sums to 0.
-; You can prove by induction that S_{k+1} = D_1 + D_2 + ... + D_k.
-; But it's a ring, so S_{n+1} is also S_1, which is 0. So D_1 + D_2 + ... + D_k = 0.
-; So the total debts must be 0, ie. no coins are created or destroyed.
-;
-; Each coin's solution includes I_{k-1}, I_k, and I_{k+1} along with proofs that I_{k}, and I_{k+1} are CATs of the same type.
-; Each coin's solution includes S_{k-1}. It calculates D_k = O_k - A_k, and then S_k = S_{k-1} + D_{k-1}
-;
-; Announcements are used to ensure that each S_k follows the pattern is valid.
-; Announcements automatically commit to their own coin id.
-; Coin I_k creates an announcement that further commits to I_{k-1} and S_{k-1}.
-;
-; Coin I_k gets a proof that I_{k+1} is a cat, so it knows it must also create an announcement
-; when spent. It checks that I_{k+1} creates an announcement committing to I_k and S_k.
-;
-; So S_{k+1} is correct iff S_k is correct.
-;
-; Coins also receive proofs that their neighbours are CATs, ensuring the announcements aren't forgeries.
-; Inner puzzles and the CAT layer prepend `CREATE_COIN_ANNOUNCEMENT` with different prefixes to avoid forgeries.
-; Ring announcements use 0xcb, and inner puzzles are given 0xca
-;
-; In summary, I_k generates a coin_announcement Y_k ("Y" for "yell") as follows:
-;
-;  Y_k: hash of I_k (automatically), I_{k-1}, S_k
-;
-; Each coin creates an assert_coin_announcement to ensure that the next coin's announcement is as expected:
-;  Y_{k+1} : hash of I_{k+1}, I_k, S_{k+1}
-;
-; TLDR:
-;  I_k : coins
-;  A_k : amount coin k contributes
-;  O_k : amount coin k spend
-;  D_k : difference/delta that coin k incurs (A - O)
-;  S_k : subtotal of debts D_1 + D_2 ... + D_k
-;  Y_k : announcements created by coin k committing to I_{k-1}, I_k, S_k
-;
-; All conditions go through a "transformer" that looks for CREATE_COIN conditions
-; generated by the inner solution, and wraps the puzzle hash ensuring the output is a cat.
-;
-; Three output conditions are prepended to the list of conditions for each I_k:
-;  (ASSERT_MY_ID I_k) to ensure that the passed in value for I_k is correct
-;  (CREATE_COIN_ANNOUNCEMENT I_{k-1} S_k) to create this coin's announcement
-;  (ASSERT_COIN_ANNOUNCEMENT hashed_announcement(Y_{k+1})) to ensure the next coin really is next and
-;     the relative values of S_k and S_{k+1} are correct
-;
-; This is all we need to do to ensure cats exactly balance in the inputs and outputs.
-;
-; Proof:
-;   Consider n, k, I_k values, O_k values, S_k and A_k as above.
-;   For the (CREATE_COIN_ANNOUNCEMENT Y_{k+1}) (created by the next coin)
-;   and (ASSERT_COIN_ANNOUNCEMENT hashed(Y_{k+1})) to match,
-;   we see that I_k can ensure that is has the correct value for S_{k+1}.
-;
-;   By induction, we see that S_{m+1} = sum(i, 1, m) [O_i - A_i] = sum(i, 1, m) O_i - sum(i, 1, m) A_i
-;   So S_{n+1} = sum(i, 1, n) O_i - sum(i, 1, n) A_i. But S_{n+1} is actually S_1 = 0,
-;   so thus sum(i, 1, n) O_i = sum (i, 1, n) A_i, ie. output total equals input total.
-
-;; GLOSSARY:
-;;  MOD_HASH: this code's sha256 tree hash
-;;  TAIL_PROGRAM_HASH: the program that determines if a coin can mint new cats, burn cats, and check if its lineage is valid if its parent is not a CAT
-;;  INNER_PUZZLE: an independent puzzle protecting the coins. Solutions to this puzzle are expected to generate `AGG_SIG` conditions and possibly `CREATE_COIN` conditions.
-;; ---- items above are curried into the puzzle hash ----
-;;  inner_puzzle_solution: the solution to the inner puzzle
-;;  prev_coin_id: the id for the previous coin
-;;  tail_program_reveal: reveal of TAIL_PROGRAM_HASH required to run the program if desired
-;;  tail_solution: optional solution passed into tail_program
-;;  lineage_proof: optional proof that our coin's parent is a CAT
-;;  this_coin_info: (parent_id puzzle_hash amount)
-;;  next_coin_proof: (parent_id inner_puzzle_hash amount)
-;;  prev_subtotal: the subtotal between prev-coin and this-coin
-;;  extra_delta: an amount that is added to our delta and checked by the TAIL program
-;;
-
-(mod (
-    MOD_HASH  ;; curried into puzzle
-    TAIL_PROGRAM_HASH  ;; curried into puzzle
-    INNER_PUZZLE  ;; curried into puzzle
-    inner_puzzle_solution  ;; if invalid, INNER_PUZZLE will fail
-    lineage_proof  ;; This is the parent's coin info, used to check if the parent was a CAT. Optional if using tail_program.
-    prev_coin_id  ;; used in this coin's announcement, prev_coin ASSERT_COIN_ANNOUNCEMENT will fail if wrong
-    this_coin_info  ;; verified with ASSERT_MY_COIN_ID
-    next_coin_proof  ;; used to generate ASSERT_COIN_ANNOUNCEMENT
-    prev_subtotal  ;; included in announcement, prev_coin ASSERT_COIN_ANNOUNCEMENT will fail if wrong
-    extra_delta  ;; this is the "legal discrepancy" between your real delta and what you're announcing your delta is
-  )
-
-  ;;;;; start library code
-
-  (include condition_codes.clib)
-  (include curry-and-treehash.clib)
-  (include cat_truths.clib)
-  (include utility_macros.clib)
-
-  (defconstant RING_MORPH_BYTE 0xcb)
-
-
-  ; take two lists and merge them into one
-  (defun merge_list (list_a list_b)
-    (if list_a
-        (c (f list_a) (merge_list (r list_a) list_b))
-        list_b
-    )
-  )
-
-  ; cat_mod_struct = (MOD_HASH MOD_HASH_hash GENESIS_COIN_CHECKER GENESIS_COIN_CHECKER_hash)
-
-  (defun-inline mod_hash_from_cat_mod_struct (cat_mod_struct) (f cat_mod_struct))
-  (defun-inline mod_hash_hash_from_cat_mod_struct (cat_mod_struct) (f (r cat_mod_struct)))
-  (defun-inline tail_program_hash_from_cat_mod_struct (cat_mod_struct) (f (r (r cat_mod_struct))))
-
-  ;;;;; end library code
-
-  ;; return the puzzle hash for a cat with the given `GENESIS_COIN_CHECKER_hash` & `INNER_PUZZLE`
-  (defun-inline cat_puzzle_hash (cat_mod_struct inner_puzzle_hash)
-    (puzzle-hash-of-curried-function (mod_hash_from_cat_mod_struct cat_mod_struct)
-      inner_puzzle_hash
-      (sha256 ONE (tail_program_hash_from_cat_mod_struct cat_mod_struct))
-      (mod_hash_hash_from_cat_mod_struct cat_mod_struct)
-    )
-  )
-
-  ;; assert `CREATE_COIN_ANNOUNCEMENT` doesn't contain the RING_MORPH_BYTE bytes so it cannot be used to cheat the coin ring
-
-  (defun-inline morph_condition (condition cat_mod_struct)
-    (if (= (f condition) CREATE_COIN)
-        (c CREATE_COIN
-          (c (cat_puzzle_hash cat_mod_struct (f (r condition)))
-          (r (r condition)))
-        )
-        (if (= (f condition) CREATE_COIN_ANNOUNCEMENT)
-            (assert (not (and
-                (= 33 (strlen (f (r condition))))
-                (= (substr (f (r condition)) 0 ONE) RING_MORPH_BYTE)  ; lazy eval
-              ))
-              ; then
-              condition
-            )
-            condition
-        )
-    )
-  )
-
-  ;; given a coin's parent, inner_puzzle and amount, and the cat_mod_struct, calculate the id of the coin
-  (defun-inline coin_id_for_proof (coin cat_mod_struct)
-    (calculate_coin_id (f coin) (cat_puzzle_hash cat_mod_struct (f (r coin))) (f (r (r coin))))
-  )
-
-  ;; utility to fetch coin amount from coin
-  (defun-inline input_amount_for_coin (coin)
-    (f (r (r coin)))
-  )
-
-  ;; calculate the hash of an announcement
-  ;; we add 0xcb so ring announcements exist in a different namespace to announcements from inner_puzzles
-  (defun-inline calculate_annoucement_id (this_coin_id this_subtotal next_coin_id cat_mod_struct)
-    (sha256 next_coin_id RING_MORPH_BYTE (sha256tree (list this_coin_id this_subtotal)))
-  )
-
-  ;; create the `ASSERT_COIN_ANNOUNCEMENT` condition that ensures the next coin's announcement is correct
-  (defun-inline create_assert_next_announcement_condition (this_coin_id this_subtotal next_coin_id cat_mod_struct)
-    (list ASSERT_COIN_ANNOUNCEMENT
-      (calculate_annoucement_id this_coin_id
-        this_subtotal
-        next_coin_id
-        cat_mod_struct
-      )
-    )
-  )
-
-  ;; here we commit to I_{k-1} and S_k
-  ;; we add 0xcb so ring announcements exist in a different namespace to announcements from inner_puzzles
-  (defun-inline create_announcement_condition (prev_coin_id prev_subtotal)
-    (list CREATE_COIN_ANNOUNCEMENT
-      (concat RING_MORPH_BYTE (sha256tree (list prev_coin_id prev_subtotal)))
-    )
-  )
-
-  ;;;;;;;;;;;;;;;;;;;;;;;;;;;
-
-  ;; this function takes a condition and returns an integer indicating
-  ;; the value of all output coins created with CREATE_COIN. If it's not
-  ;; a CREATE_COIN condition, it returns 0.
-
-  (defun-inline output_value_for_condition (condition)
-    (if (= (f condition) CREATE_COIN)
-        (f (r (r condition)))
-        0
-    )
-  )
-
-  ;; add two conditions to the list of morphed conditions:
-  ;; CREATE_COIN_ANNOUNCEMENT for my announcement
-  ;; ASSERT_COIN_ANNOUNCEMENT for the next coin's announcement
-  (defun-inline generate_final_output_conditions
-    (
-      prev_subtotal
-      this_subtotal
-      morphed_conditions
-      prev_coin_id
-      this_coin_id
-      next_coin_id
-      cat_mod_struct
-    )
-    (c (create_announcement_condition prev_coin_id prev_subtotal)
-      (c (create_assert_next_announcement_condition this_coin_id this_subtotal next_coin_id cat_mod_struct)
-      morphed_conditions)
-    )
-  )
-
-
-  ;; This next section of code loops through all of the conditions to do three things:
-  ;;   1) Look for a "magic" value of -113 and, if one exists, filter it, and take note of the tail reveal and solution
-  ;;   2) Morph any CREATE_COIN or CREATE_COIN_ANNOUNCEMENT conditions
-  ;;   3) Sum the total output amount of all of the CREATE_COINs that are output by the inner puzzle
-  ;;
-  ;; After everything return a struct in the format (morphed_conditions . (output_sum . tail_reveal_and_solution))
-  ;; If multiple magic conditions are specified, the later one will take precedence
-
-  (defun-inline condition_tail_reveal (condition) (f (r (r (r condition)))))
-  (defun-inline condition_tail_solution (condition) (f (r (r (r (r condition))))))
-
-  (defun cons_onto_first_and_add_to_second (morphed_condition output_value struct)
-    (c (c morphed_condition (f struct)) (c (+ output_value (f (r struct))) (r (r struct))))
-  )
-
-  (defun find_and_strip_tail_info (inner_conditions cat_mod_struct tail_reveal_and_solution)
-    (if inner_conditions
-        (if (= (output_value_for_condition (f inner_conditions)) -113)  ; Checks this is a CREATE_COIN of value -113
-            (find_and_strip_tail_info
-              (r inner_conditions)
-              cat_mod_struct
-              (c (condition_tail_reveal (f inner_conditions)) (condition_tail_solution (f inner_conditions)))
-            )
-            (cons_onto_first_and_add_to_second
-              (morph_condition (f inner_conditions) cat_mod_struct)
-              (output_value_for_condition (f inner_conditions))
-              (find_and_strip_tail_info
-                (r inner_conditions)
-                cat_mod_struct
-                tail_reveal_and_solution
-              )
-            )
-        )
-        (c () (c 0 tail_reveal_and_solution))
-    )
-  )
-
-  ;;;;;;;;;;;;;;;;;;;;;;;;;;; lineage checking
-
-  ;; return true iff parent of `this_coin_info` is provably a cat
-  ;; A 'lineage proof' consists of (parent_parent_id parent_INNER_puzzle_hash parent_amount)
-  ;; We use this information to construct a coin who's puzzle has been wrapped in this MOD and verify that,
-  ;; once wrapped, it matches our parent coin's ID.
-  (defun-inline is_parent_cat (
-      cat_mod_struct
-      parent_id
-      lineage_proof
-    )
-    (= parent_id
-      (calculate_coin_id (f lineage_proof)
-        (cat_puzzle_hash cat_mod_struct (f (r lineage_proof)))
-        (f (r (r lineage_proof)))
-      )
-    )
-  )
-
-  (defun check_lineage_or_run_tail_program
-    (
-      this_coin_info
-      tail_reveal_and_solution
-      parent_is_cat  ; flag which says whether or not the parent CAT check ran and passed
-      lineage_proof
-      Truths
-      extra_delta
-      inner_conditions
-    )
-    (if tail_reveal_and_solution
-        (assert (= (sha256tree (f tail_reveal_and_solution)) (cat_tail_program_hash_truth Truths))
-          (merge_list
-            (a  (f tail_reveal_and_solution)
-              (list
-                Truths
-                parent_is_cat
-                lineage_proof  ; Lineage proof is only guaranteed to be true if parent_is_cat
-                extra_delta
-                inner_conditions
-                (r tail_reveal_and_solution)
-              )
-            )
-            inner_conditions
-          )
-        )
-        (assert parent_is_cat (not extra_delta)
-          inner_conditions
-        )
-    )
-  )
-
-  ;;;;;;;;;;;;;;;;;;;;;;;;;;;
-
-  (defun stager_two (
-      Truths
-      (inner_conditions . (output_sum . tail_reveal_and_solution))
-      lineage_proof
-      prev_coin_id
-      this_coin_info
-      next_coin_id
-      prev_subtotal
-      extra_delta
-    )
-    (check_lineage_or_run_tail_program
-      this_coin_info
-      tail_reveal_and_solution
-      (if lineage_proof (is_parent_cat (cat_struct_truth Truths) (my_parent_cat_truth Truths) lineage_proof) ())
-      lineage_proof
-      Truths
-      extra_delta
-      (generate_final_output_conditions
-        prev_subtotal
-        ; the expression on the next line calculates `this_subtotal` by adding the delta to `prev_subtotal`
-        (+ prev_subtotal (- (input_amount_for_coin this_coin_info) output_sum) extra_delta)
-        inner_conditions
-        prev_coin_id
-        (my_id_cat_truth Truths)
-        next_coin_id
-        (cat_struct_truth Truths)
-      )
-    )
-  )
-
-  ; CAT TRUTHS struct is: ; CAT Truths is: ((Inner puzzle hash . (MOD hash . (MOD hash hash . TAIL hash))) . (my_id . (my_parent_info my_puzhash my_amount)))
-  ; create truths - this_coin_info verified true because we calculated my ID from it!
-  ; lineage proof is verified later by cat parent check or tail_program
-
-  (defun stager (
-      cat_mod_struct
-      inner_conditions
-      lineage_proof
-      inner_puzzle_hash
-      my_id
-      prev_coin_id
-      this_coin_info
-      next_coin_proof
-      prev_subtotal
-      extra_delta
-    )
-    (c (list ASSERT_MY_COIN_ID my_id) (stager_two
-        (cat_truth_data_to_truth_struct
-          inner_puzzle_hash
-          cat_mod_struct
-          my_id
-          this_coin_info
-        )
-        (find_and_strip_tail_info inner_conditions cat_mod_struct ())
-        lineage_proof
-        prev_coin_id
-        this_coin_info
-        (coin_id_for_proof next_coin_proof cat_mod_struct)
-        prev_subtotal
-        extra_delta
-    ))
-  )
-
-  (stager
-    ;; calculate cat_mod_struct, inner_puzzle_hash, coin_id
-    (list MOD_HASH (sha256 ONE MOD_HASH) TAIL_PROGRAM_HASH)
-    (a INNER_PUZZLE inner_puzzle_solution)
-    lineage_proof
-    (sha256tree INNER_PUZZLE)
-    (calculate_coin_id (f this_coin_info) (f (r this_coin_info)) (f (r (r this_coin_info))))
-    prev_coin_id  ; ID
-    this_coin_info  ; (parent_id puzzle_hash amount)
-    next_coin_proof  ; (parent_id innerpuzhash amount)
-    prev_subtotal
-    extra_delta
-  )
-)

chia/wallet/cat_wallet/puzzles/cat_v2.clsp.hex

@@ -1 +0,0 @@
-ff02ffff01ff02ff5effff04ff02ffff04ffff04ff05ffff04ffff0bff34ff0580ffff04ff0bff80808080ffff04ffff02ff17ff2f80ffff04ff5fffff04ffff02ff2effff04ff02ffff04ff17ff80808080ffff04ffff02ff2affff04ff02ffff04ff82027fffff04ff82057fffff04ff820b7fff808080808080ffff04ff81bfffff04ff82017fffff04ff8202ffffff04ff8205ffffff04ff820bffff80808080808080808080808080ffff04ffff01ffffffff3d46ff02ff333cffff0401ff01ff81cb02ffffff20ff02ffff03ff05ffff01ff02ff32ffff04ff02ffff04ff0dffff04ffff0bff7cffff0bff34ff2480ffff0bff7cffff0bff7cffff0bff34ff2c80ff0980ffff0bff7cff0bffff0bff34ff8080808080ff8080808080ffff010b80ff0180ffff02ffff03ffff22ffff09ffff0dff0580ff2280ffff09ffff0dff0b80ff2280ffff15ff17ffff0181ff8080ffff01ff0bff05ff0bff1780ffff01ff088080ff0180ffff02ffff03ff0bffff01ff02ffff03ffff09ffff02ff2effff04ff02ffff04ff13ff80808080ff820b9f80ffff01ff02ff56ffff04ff02ffff04ffff02ff13ffff04ff5fffff04ff17ffff04ff2fffff04ff81bfffff04ff82017fffff04ff1bff8080808080808080ffff04ff82017fff8080808080ffff01ff088080ff0180ffff01ff02ffff03ff17ffff01ff02ffff03ffff20ff81bf80ffff0182017fffff01ff088080ff0180ffff01ff088080ff018080ff0180ff04ffff04ff05ff2780ffff04ffff10ff0bff5780ff778080ffffff02ffff03ff05ffff01ff02ffff03ffff09ffff02ffff03ffff09ff11ff5880ffff0159ff8080ff0180ffff01818f80ffff01ff02ff26ffff04ff02ffff04ff0dffff04ff0bffff04ffff04ff81b9ff82017980ff808080808080ffff01ff02ff7affff04ff02ffff04ffff02ffff03ffff09ff11ff5880ffff01ff04ff58ffff04ffff02ff76ffff04ff02ffff04ff13ffff04ff29ffff04ffff0bff34ff5b80ffff04ff2bff80808080808080ff398080ffff01ff02ffff03ffff09ff11ff7880ffff01ff02ffff03ffff20ffff02ffff03ffff09ffff0121ffff0dff298080ffff01ff02ffff03ffff09ffff0cff29ff80ff3480ff5c80ffff01ff0101ff8080ff0180ff8080ff018080ffff0109ffff01ff088080ff0180ffff010980ff018080ff0180ffff04ffff02ffff03ffff09ff11ff5880ffff0159ff8080ff0180ffff04ffff02ff26ffff04ff02ffff04ff0dffff04ff0bffff04ff17ff808080808080ff80808080808080ff0180ffff01ff04ff80ffff04ff80ff17808080ff0180ffff02ffff03ff05ffff01ff04ff09ffff02ff56ffff04ff02ffff04ff0dffff04ff0bff808080808080ffff010b80ff0180ff0bff7cffff0bff34ff2880ffff0bff7cffff0bff7cffff0bff34ff2c80ff0580ffff0bff7cffff02ff32ffff04ff02ffff04ff07ffff04ffff0bff34ff3480ff8080808080ffff0bff34ff8080808080ffff02ffff03ffff07ff0580ffff01ff0bffff0102ffff02ff2effff04ff02ffff04ff09ff80808080ffff02ff2effff04ff02ffff04ff0dff8080808080ffff01ff0bffff0101ff058080ff0180ffff04ffff04ff30ffff04ff5fff808080ffff02ff7effff04ff02ffff04ffff04ffff04ff2fff0580ffff04ff5fff82017f8080ffff04ffff02ff26ffff04ff02ffff04ff0bffff04ff05ffff01ff808080808080ffff04ff17ffff04ff81bfffff04ff82017fffff04ffff02ff2affff04ff02ffff04ff8204ffffff04ffff02ff76ffff04ff02ffff04ff09ffff04ff820affffff04ffff0bff34ff2d80ffff04ff15ff80808080808080ffff04ff8216ffff808080808080ffff04ff8205ffffff04ff820bffff808080808080808080808080ff02ff5affff04ff02ffff04ff5fffff04ff3bffff04ffff02ffff03ff17ffff01ff09ff2dffff02ff2affff04ff02ffff04ff27ffff04ffff02ff76ffff04ff02ffff04ff29ffff04ff57ffff04ffff0bff34ff81b980ffff04ff59ff80808080808080ffff04ff81b7ff80808080808080ff8080ff0180ffff04ff17ffff04ff05ffff04ff8202ffffff04ffff04ffff04ff78ffff04ffff0eff5cffff02ff2effff04ff02ffff04ffff04ff2fffff04ff82017fff808080ff8080808080ff808080ffff04ffff04ff20ffff04ffff0bff81bfff5cffff02ff2effff04ff02ffff04ffff04ff15ffff04ffff10ff82017fffff11ff8202dfff2b80ff8202ff80ff808080ff8080808080ff808080ff138080ff80808080808080808080ff018080

chia/wallet/cat_wallet/puzzles/delegated_tail.clsp

@@ -1,25 +0,0 @@
-; This is a "limitations_program" for use with cat.clsp.
-(mod (
-    PUBKEY
-    Truths
-    parent_is_cat
-    lineage_proof
-    delta
-    inner_conditions
-    (
-      delegated_puzzle
-      delegated_solution
-    )
-  )
-
-  (include condition_codes.clib)
-
-  (defun sha256tree1 (TREE)
-    (if (l TREE)
-        (sha256 2 (sha256tree1 (f TREE)) (sha256tree1 (r TREE)))
-  (sha256 1 TREE)))
-
-  (c (list AGG_SIG_UNSAFE PUBKEY (sha256tree1 delegated_puzzle))
-    (a delegated_puzzle (c Truths (c parent_is_cat (c lineage_proof (c delta (c inner_conditions delegated_solution))))))
-  )
-)

chia/wallet/cat_wallet/puzzles/delegated_tail.clsp.hex

@@ -1 +0,0 @@
-ff02ffff01ff04ffff04ff04ffff04ff05ffff04ffff02ff06ffff04ff02ffff04ff82027fff80808080ff80808080ffff02ff82027fffff04ff0bffff04ff17ffff04ff2fffff04ff5fffff04ff81bfff82057f80808080808080ffff04ffff01ff31ff02ffff03ffff07ff0580ffff01ff0bffff0102ffff02ff06ffff04ff02ffff04ff09ff80808080ffff02ff06ffff04ff02ffff04ff0dff8080808080ffff01ff0bffff0101ff058080ff0180ff018080

chia/wallet/cat_wallet/puzzles/everything_with_signature.clsp

@@ -1,15 +0,0 @@
-; This is a "limitations_program" for use with cat.clsp.
-(mod (
-    PUBKEY
-    Truths
-    parent_is_cat
-    lineage_proof
-    delta
-    inner_conditions
-    _
-  )
-
-  (include condition_codes.clib)
-
-  (list (list AGG_SIG_ME PUBKEY delta))  ; Careful with a delta of zero, the bytecode is 80 not 00
-)

chia/wallet/cat_wallet/puzzles/everything_with_signature.clsp.hex

@@ -1 +0,0 @@
-ff02ffff01ff04ffff04ff02ffff04ff05ffff04ff5fff80808080ff8080ffff04ffff0132ff018080

chia/wallet/cat_wallet/puzzles/genesis_by_coin_id.clsp

@@ -1,26 +0,0 @@
-; This is a TAIL for use with cat.clvm.
-;
-; This checker allows new CATs to be created if they have a particular coin id as parent
-;
-; The genesis_id is curried in, making this lineage_check program unique and giving the CAT it's uniqueness
-(mod (
-    GENESIS_ID
-    Truths
-    parent_is_cat
-    lineage_proof
-    delta
-    inner_conditions
-    _
-  )
-
-  (include cat_truths.clib)
-
-  (if delta
-      (x)
-      (if (= (my_parent_cat_truth Truths) GENESIS_ID)
-          ()
-          (x)
-      )
-  )
-
-)

chia/wallet/cat_wallet/puzzles/genesis_by_coin_id.clsp.hex

@@ -1 +0,0 @@
-ff02ffff03ff2fffff01ff0880ffff01ff02ffff03ffff09ff2dff0280ff80ffff01ff088080ff018080ff0180

chia/wallet/cat_wallet/puzzles/genesis_by_coin_id_or_singleton.clsp

@@ -1,42 +0,0 @@
-; This is a TAIL for use with cat.clvm.
-;
-; This checker allows new CATs to be created if they have a particular coin id as parent
-;
-; The genesis_id is curried in, making this lineage_check program unique and giving the CAT it's uniqueness
-(mod (
-    GENESIS_ID
-    MINT_LAUNCHER_PUZZLE_HASH
-    Truths
-    parent_is_cat
-    lineage_proof
-    delta
-    inner_conditions
-    (  ; solution
-      parent_parent_id
-      parent_amount
-    )
-  )
-
-  (include cat_truths.clib)
-  (include curry-and-treehash.clib)
-
-  (if delta
-      (x)
-      (if (= (my_parent_cat_truth Truths) GENESIS_ID)
-          ()
-          (if
-            (=
-              (my_parent_cat_truth Truths)
-              (sha256
-                parent_parent_id
-                MINT_LAUNCHER_PUZZLE_HASH
-                parent_amount
-              )
-            )
-            ()
-            (x)
-          )
-      )
-  )
-
-)

chia/wallet/cat_wallet/puzzles/genesis_by_coin_id_or_singleton.clsp.hex

@@ -1 +0,0 @@
-ff02ffff03ff5fffff01ff0880ffff01ff02ffff03ffff09ff5bff0280ff80ffff01ff02ffff03ffff09ff5bffff0bff82027fff05ff82057f8080ff80ffff01ff088080ff018080ff018080ff0180

chia/wallet/cat_wallet/puzzles/genesis_by_puzzle_hash.clsp

@@ -1,24 +0,0 @@
-; This is a "limitations_program" for use with cat.clsp.
-;
-; This checker allows new CATs to be created if their parent has a particular puzzle hash
-(mod (
-    GENESIS_PUZZLE_HASH
-    Truths
-    parent_is_cat
-    lineage_proof
-    delta
-    inner_conditions
-    (parent_parent_id parent_amount)
-  )
-
-  (include cat_truths.clib)
-
-  ; Returns nil since we don't need to add any conditions
-  (if delta
-      (x)
-      (if (= (sha256 parent_parent_id GENESIS_PUZZLE_HASH parent_amount) (my_parent_cat_truth Truths))
-          ()
-          (x)
-      )
-  )
-)

chia/wallet/cat_wallet/puzzles/genesis_by_puzzle_hash.clsp.hex

@@ -1 +0,0 @@
-ff02ffff03ff2fffff01ff0880ffff01ff02ffff03ffff09ffff0bff82013fff02ff8202bf80ff2d80ff80ffff01ff088080ff018080ff0180

chia/wallet/dao_wallet/dao_info.py

@@ -1,61 +0,0 @@
-from __future__ import annotations
-
-from dataclasses import dataclass
-from enum import Enum
-from typing import Optional
-
-from chia.types.blockchain_format.coin import Coin
-from chia.types.blockchain_format.program import Program
-from chia.types.blockchain_format.sized_bytes import bytes32
-from chia.util.ints import uint32, uint64
-from chia.util.streamable import Streamable, streamable
-from chia.wallet.lineage_proof import LineageProof
-
-
-@streamable
-@dataclass(frozen=True)
-class ProposalInfo(Streamable):
-    proposal_id: bytes32  # this is launcher_id
-    inner_puzzle: Program
-    amount_voted: uint64
-    yes_votes: uint64
-    current_coin: Coin
-    current_innerpuz: Optional[Program]
-    timer_coin: Optional[Coin]  # if this is None then the proposal has finished
-    singleton_block_height: uint32  # Block height that current proposal singleton coin was created in
-    passed: bool
-    closed: bool
-
-
-@streamable
-@dataclass(frozen=True)
-class DAOInfo(Streamable):
-    treasury_id: bytes32
-    cat_wallet_id: uint32
-    dao_cat_wallet_id: uint32
-    proposals_list: list[ProposalInfo]
-    parent_info: list[tuple[bytes32, Optional[LineageProof]]]  # {coin.name(): LineageProof}
-    current_treasury_coin: Optional[Coin]
-    current_treasury_innerpuz: Optional[Program]
-    singleton_block_height: uint32  # the block height that the current treasury singleton was created in
-    filter_below_vote_amount: uint64  # we ignore proposals with fewer votes than this - defaults to 1
-    assets: list[Optional[bytes32]]
-    current_height: uint64
-
-
-@streamable
-@dataclass(frozen=True)
-class DAORules(Streamable):
-    proposal_timelock: uint64
-    soft_close_length: uint64
-    attendance_required: uint64
-    pass_percentage: uint64
-    self_destruct_length: uint64
-    oracle_spend_delay: uint64
-    proposal_minimum_amount: uint64
-
-
-class ProposalType(Enum):
-    SPEND = "s"
-    UPDATE = "u"
-    MINT = "m"