mojo_puzzler - User contributions [en]

Informatics

2024-05-03T14:35:20Z

Gneale: Created page with "* CFG - Useful Links"

* [[CFG - Useful Links]]

CFG - Useful Links

2024-05-03T14:34:32Z

Gneale:

===== Return to: [[Informatics]] =====
* https://cfg-corp-app01.fusionehr.com/ehr - '''FEHR Corporate Environment'''
* https://clinicalforge.com - '''Clinical Forge - New Fusion form editor '''
* https://fusioncorp.atlassian.net/servicedesk/customer/portals - '''Fusion Helpdesk'''
* https://helpdesk.cfgpc.com/WOListView.do - '''CFG Helpdesk'''
* https://cfgportal.cfgpc.com/ - '''CFG Portal'''
* https://fusionehr.docebosaas.com/ - '''Fusion LMS'''
* https://portal.coremr.com/ - '''CorEMR portal'''
* https://intranet.cfgpc.com/MyTeam/Corrections
* https://coremr-train.cfgpc.com/ - '''CorEMR Training v6 '''
* https://coremr-atlantic.cfgpc.com/login.php - '''Atlantic County - CorEMR v6.x AKA "Build System"'''
* https://ehr.fusionmgt.com/RDWeb/Pages/en-US/default.aspx '''RDWeb - Essex/Ocean'''
* https://fc-rdweb.fusionmgt.com/rdweb/pages/ - '''RDWeb - Albany/Camden'''
* https://cfgportal.cfgpc.com/RDWeb/Pages/en-US/login.aspx?ReturnUrl=/RDWeb/Pages/en-US/Default.aspx - '''CFG Portal - Burlington/Union'''

CFG - Useful Links

2024-05-03T14:33:54Z

Gneale: Created page with "===== Return to: Informatics ===== * https://cfg-corp-app01.fusionehr.com/ehr - '''FEHR Corporate Environment''' * https://clinicalforge.com - '''Clinical Forge - New Fusion form editor ''' * https://fusioncorp.atlassian.net/servicedesk/customer/portals - '''Fusion Helpdesk''' * https://helpdesk.cfgpc.com/WOListView.do - '''CFG Helpdesk''' * https://cfgportal.cfgpc.com/ - '''CFG Portal''' * https://fusionehr.docebosaas.com/ - '''Fusion LMS''' * https://portal.coremr...."

===== Return to: [[Informatics]] =====
* https://cfg-corp-app01.fusionehr.com/ehr - '''FEHR Corporate Environment'''
* https://clinicalforge.com - '''Clinical Forge - New Fusion form editor '''
* https://fusioncorp.atlassian.net/servicedesk/customer/portals - '''Fusion Helpdesk'''
* https://helpdesk.cfgpc.com/WOListView.do - '''CFG Helpdesk'''
* https://cfgportal.cfgpc.com/ - '''CFG Portal'''
* https://fusionehr.docebosaas.com/ - '''Fusion LMS'''
* https://portal.coremr.com/ - '''CorEMR portal'''
* https://intranet.cfgpc.com/MyTeam/Corrections
* \\mrl-web01\intranetfiles_Corrections$\Blue Jean Training Videos (to add/remove custom videos).
* file:///J:/Corrections-folder/EMR/Reports/Centricity_Practice_Solution_12.0_GA/Centricity%20Practice%20Solution%2012.0/StartPage.htm - '''Centricity Database Schema'''
* https://coremr-train.cfgpc.com/ - '''CorEMR Training v6 '''
* https://coremr-atlantic.cfgpc.com/login.php - '''Atlantic County - CorEMR v6.x AKA "Build System"'''
* https://ehr.fusionmgt.com/RDWeb/Pages/en-US/default.aspx '''RDWeb - Essex/Ocean'''
* https://fc-rdweb.fusionmgt.com/rdweb/pages/ - '''RDWeb - Albany/Camden'''
* https://cfgportal.cfgpc.com/RDWeb/Pages/en-US/login.aspx?ReturnUrl=/RDWeb/Pages/en-US/Default.aspx - '''CFG Portal - Burlington/Union'''

CFG

2024-05-03T14:33:27Z

Gneale:

* [[CFG - Useful Links]]

Main Page

2024-05-03T14:31:49Z

Gneale:

== Welcome to Mojo Puzzler!==
The home for system-based fun. We love Chia blockchain!
* [[Chialisp]]
* [[NFT]]
* [[Insightful Comments|Insightful Comments]]
* [[Tutorial Hints]]
* [[XCH Price]]
* [[Database]]
* [[Github setup notes]]
* [[Useful links]]

CFG

2024-05-03T14:31:09Z

Gneale: Created page with "test"

test

Main Page

2024-05-03T14:30:54Z

Gneale: /* Welcome to Mojo Puzzler! */

Main Page

2024-05-03T14:29:15Z

Gneale: Protected "Main Page" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite))

Useful links

2024-02-20T19:26:37Z

Gneale:

* http://mojopuzzler.org - Homepage
* https://xchdev.com/faucet/index.php
* https://github.com/richardkiss/contract_patterns
* https://github.com/richardkiss/chiaswap
* https://dkackman.github.io/chia-api/
* https://github.com/kimsk/chia-concepts
* https://aggsig.me
* https://docs.google.com/document/u/0/d/1x2PHn1qnMESc9RhPiBflDHWKoch2K0ds50brfSc7LPc/mobilebasic
* https://www.youtube.com/watch?v=NJydOPMLxBg
* https://github.com/geraldneale/py-blink_mojo-secure
* https://github.com/Chia-Network/bls-signatures/tree/main/python-bindings
* https://docs.chia.net/rpc/
* https://github.com/Chia-Network/internal-custody
* https://github.com/Chia-Network/chia-blockchain/branches
* https://github.com/geoffwalmsley/clsp-template
* https://web.archive.org/web/20211129001730/https://www.chia.net/2021/05/27/Agrgregated-Sigs-Taproot-Graftroot.html
* https://mixch.dev/#/tools/address

==Random:==
* https://api.mintgarden.io/docs
* https://rudolfachter.github.io/blockchain-stuff/public/chia/splitting_coins_for_offers/
* https://pawket.app/#/clvm
* https://github.com/steppsr/txch-faucet
* https://gist.github.com/thechiaplot/639fceffaa3e3040e2de002a07ed4344 Original duststorm code(alleged)
* https://github.com/trgarrett/chialisp/blob/a8b3400f88138b499ff62c437ab6927988d213e7/royalty_share/clsp/archives/p2_royalty_share_equal_max_fee_nocat/p2_royalty_share_equal_max_fee_nocat.clsp#L1
* https://github.com/Chia-Network/chia-blockchain/pull/1469 '''Atomic Swap example:''' Basically, the original owner can claim the coins back after a time delay, or the other party can unlock and claim them with a valid preimage.

Errors

2024-01-25T18:23:44Z

Gneale:

===== Return to: [[Insightful Comments|Insightful Comments]] =====
<h1>path into atom</h1>
"Typically path into atom means your chialisp is trying to traverse a list, but you've given it an atom. So either drop parentheses in the chialisp[puzzle], or add them in the solution". -GWalmsley 20240121

Errors

2024-01-25T18:23:11Z

Gneale: Created page with "===== Return to: Insightful Comments ===== <h1>path into atom</h1> "Typically path into atom means your chialisp is trying to traverse a list, but you've given it an atom. So either drop parentheses in the chialisp[puzzle], or add them in the solution"."

Insightful Comments

2024-01-25T18:21:29Z

Gneale:

* [[Singleton comments]]
* [[Securing spend with announcements - overview]]
* [[Puzzle hints]]
* [[Identifying CATs]]
* [[Getting started with PRs - Quex]]
*[[Signature creation in Python3]]
*[[Signature tracing]]
*[[Timed events]]
*[[Cancelling a coin]]
*[[Length of a list]]
*[[Graftroot Quexington]]
*[[Block Composition]]
*[[Simplest puzzles for testing]]
* '''Inline Functions''' - "General rule of thumb is to use inline except when you have a good reason not to. Keep in mind that if you're getting a weird error, it's probably good to change your inlines to regular functions for debugging purposes."
*[[Intercoin Communication]]
*[[Errors]]

Insightful Comments

2024-01-25T18:20:50Z

Gneale:

Signatures

2024-01-21T17:08:47Z

Gneale:

===== Return to: [[Chialisp|Chialisp]] =====

<H1>Useful Commands:</H1>
chia keys show --show-mnemonic-seed

<H1>Useful Links:</H1>
* https://docs.chia.net/guides/crash-course/signatures/
* https://github.com/geoffwalmsley/clsp-template/blob/379fde144a5878921fd3364368f6d81bd5a5a110/src/utils/sim.py#L136

Signatures

2024-01-21T17:07:32Z

Gneale:

Signatures

2024-01-21T01:28:57Z

Gneale:

Signatures

2024-01-20T22:53:54Z

Gneale:

===== Return to: [[Chialisp|Chialisp]] =====

<H1>Useful Commands:</H1>
chia keys show --show-mnemonic-seed

<H1>Useful Links:</H1>
* https://github.com/geoffwalmsley/clsp-template

Useful CDV examples

2023-12-27T15:51:10Z

Gneale:

===== Return to: [[Chialisp|Chialisp]] =====
* [[cdv rpc blocks -s x -e y]] - For looking at block outputs
* [[cdv inspect spendbundles ./spend_bundle.json -db|cdv inspect spendbundles ./spendbundle.json -db]]
* [[cdv inspect --id coins]] - For getting coinID
* [[cdv rpc coinrecords --by id]] - To get parent coinID and spent block height.
* [[cdv clsp treehash trigger.clvm| cdv clsp treehash trigger.clvm.hex]] - To verify puzzle you have revealed is the one committed to in the coin.
* [[cdv rpc coinrecords --by puzhash]] -nd
* [[cdv rpc blockspends --by id]] - To get puzzle reveal and solution.

Useful CDV examples

2023-12-27T15:48:40Z

Gneale:

===== Return to: [[Chialisp|Chialisp]] =====
* [[cdv rpc blocks -s x -e y]] - For looking at block outputs
* [[cdv inspect spendbundles ./spend_bundle.json -db|cdv inspect spendbundles ./spendbundle.json -db]]
* [[cdv inspect --id coins]] - For getting coinID
* [[cdv rpc coinrecords --by id]] - To get parent coinID and spent block height.
* [[cdv clsp treehash trigger.clvm| cdv clsp treehash trigger.clvm.hex]] - To verify puzzle you have revealed is the one committed to in the coin.
* [[cdv rpc coinrecords --by puzhash]]
* [[cdv rpc blockspends --by id]] - To get puzzle reveal and solution.

NFT

2023-12-10T00:24:54Z

Gneale:

==NFT - minting script using python3==
* https://github.com/geraldneale/chia-nft-add_uris - Automated system of aggregating all NFTs in a "wallet" and updating the URIs in bulk.
* Mintgarden API command - curl -s https://api.mintgarden.io/collections/col1mzg4s7q09030tew2xj3rjck2rz77tlt94ekmrqe6l6dm260qhx5qu3a9ds/nfts/ids | jq -r '.[]| .encoded_id'

Other useful links:
* https://devs.chia.net/guides/nft-developer-guide
* https://github.com/zakhikhan/chia-nft-minting-helper
* https://dkackman.github.io/chia-api/static/wallet.html#api-NFTWallet

NFT

2023-12-10T00:24:35Z

Gneale:

==NFT - minting script using python3==
* https://github.com/geraldneale/chia-nft-add_uris - Automated system of aggregating all NFTs in a "wallet" and updating the URIs in bulk.
* Mintgarden API command - curl -s https://api.mintgarden.io/collections/col1mzg4s7q09030tew2xj3rjck2rz77tlt94ekmrqe6l6dm260qhx5qu3a9ds/nfts/ids | jq -r '.[] | .encoded_id'

Other useful links:
* https://devs.chia.net/guides/nft-developer-guide
* https://github.com/zakhikhan/chia-nft-minting-helper
* https://dkackman.github.io/chia-api/static/wallet.html#api-NFTWallet

Main Page

2023-11-25T01:36:17Z

Gneale: Reverted edits by LidaSymonds14 (talk) to last revision by Gneale

File:Austi-powers-costumev3-2.png

2023-11-22T14:05:55Z

Gneale:

File:Mojo puzzler3.png

2023-11-21T23:16:40Z

Gneale:

File:Mojo logo2.png

2023-11-21T23:10:58Z

Gneale:

File:Rkiss.png

2023-11-21T19:37:09Z

Gneale:

File:Mojo logo.png

2023-11-21T19:35:04Z

Gneale:

Sha256tree RKiss

2023-11-18T02:08:50Z

Gneale: Created page with "===== Return to: Insightful Comments ===== <gallery> Rkiss.PNG|Caption 3 </gallery>"

===== Return to: [[Insightful Comments|Insightful Comments]] =====
<gallery>
Rkiss.PNG|Caption 3
</gallery>

Intercoin Communication

2023-11-18T02:08:30Z

Gneale: Created page with "===== Return to: Insightful Comments ===== Keybase 20211023: Q: Any wisdom on the differences/use-cases between CREATE_COIN_ANNOUNCEMENT and CREATE_PUZZLE_ANNOUNCEMENT? A (gneale): CREATE_COIN_ANNOUNCEMENT versus CREATE_PUZZLE_ANNOUNCEMENT is not that big of a difference code-wise, but usage-wise it is vast. Basically, the coinID dependency is much stricter, like one and done. The assertion coin is looking for that one announcement coin with t..."

===== Return to: [[Insightful Comments|Insightful Comments]] =====
Keybase 20211023:

Q: Any wisdom on the differences/use-cases between CREATE_COIN_ANNOUNCEMENT and CREATE_PUZZLE_ANNOUNCEMENT?

A (gneale):

CREATE_COIN_ANNOUNCEMENT versus CREATE_PUZZLE_ANNOUNCEMENT is not that big of a difference code-wise, but usage-wise it is vast. Basically, the coinID dependency is much stricter, like one and done. The assertion coin is looking for that one announcement coin with that one ID and if it gets spent in a different block than the assertion then the assertion coin is locked unspent forever. In contrast, puzzle_hash assertion is looser in that if one announcement is missed another can come later from that same puzzle_hash.

* '''Comment1:''' That actually used to be the implementation of announcements funny enough. You would create a zero value coin and then consume it and another coin would assert that it had been consumed. Announcements are much nicer. - Quexington 20210909
* '''Comment2:''' Zero value coins are still useful for "announcements" that last longer than the block they're created it (but you've got to make a spend for them and all that good stuff) - Matt Howard 20210909

Simplest puzzles for testing

2023-11-18T02:07:36Z

Gneale: Created page with "===== Return to: Insightful Comments ===== <h2>Example 1</h2>keybase://chat/chia_network.public#chialisp/6836 Q: Is it the case that a coin locked with the puzzle '()' can be spent always? Or should it be '(1)'? A: The puzzle can actually just be `1` yes which just returns whatever you pass in the solution. We use it a lot for testing. <h2>Example 2</h2> <code>(mod () (q (51 0x656214f18f80a85a30f97cafa0fdfd29578d5e8030316b21e36552f9172c49d1 0x01..."

===== Return to: [[Insightful Comments|Insightful Comments]] =====

<h2>Example 1</h2>keybase://chat/chia_network.public#chialisp/6836
Q: Is it the case that a coin locked with the puzzle '()' can be spent always? Or should it be '(1)'?

A: The puzzle can actually just be `1` yes which just returns whatever you pass in the solution. We use it a lot for testing.
<h2>Example 2</h2>
<code>(mod () (q (51 0x656214f18f80a85a30f97cafa0fdfd29578d5e8030316b21e36552f9172c49d1 0x01)))</code>

Block Composition

2023-11-18T02:07:07Z

Gneale: Created page with "===== Return to: Insightful Comments ===== <h2>Question: Is there a limit per bundle?</h2> 2021-09-01 "efishcent" said the following on Keybase channel chialisp: Answers from dev on your question: technically, a block is a single spend bundle (with a single aggregate signature). Right now our farmer limits the cost of included transactions to 0.5 of max (called limit_factor in the code). Presumably more to your question though, the mempool also..."

===== Return to: [[Insightful Comments|Insightful Comments]] =====

<h2>Question: Is there a limit per bundle?</h2>
2021-09-01
"efishcent" said the following on Keybase channel chialisp:

Answers from dev on your question:
technically, a block is a single spend bundle (with a single aggregate signature). Right now our farmer limits the cost of included transactions to 0.5 of max (called limit_factor in the code). Presumably more to your question though, the mempool also accepts spend bundles of the same 50% of the max block cost. So, today you cannot make a single spend bundle/transaction that has a higher cost than 50% of the max block cost
As we get more comfortable with the performance of block validation, I imagine we'll crank up the limit_factor to get close to 1 (another issue at that point is that we don't have a closed-form formula to predict the exact cost, so if we set it to exactly 1, we may sometimes create blocks that exceed the max cost)
However, even in that case, I would think it's reasonable to have a smaller limit of what we accept into the mempool. The mempool is a bit sensitive to DoS, since anyone can ask to add spend bundles to it, so having a lower limit protects us from certain kinds of attacks

Also, since cost is determined as a combination of size in bytes, number of output coins, number of aggsig keys and the operations executed in the chialisp program, it's possible to create a very small program that has a very high cost, and vice versa

Graftroot Quexington

2023-11-18T02:06:27Z

Gneale: Created page with "===== Return to: Insightful Comments ===== #Keybase 20211019 11:30EST For example, graftroot is just a puzzle that requires a signature of another puzzle hash and then allows you to run whatever puzzle has been signed. That pubkey can sign an infinite number of puzzles"

===== Return to: [[Insightful Comments|Insightful Comments]] =====
#Keybase 20211019 11:30EST
For example, graftroot is just a puzzle that requires a signature of another puzzle hash and then allows you to run whatever puzzle has been signed. That pubkey can sign an infinite number of puzzles

Length of a list

2023-11-18T02:06:06Z

Gneale: Created page with "===== Return to: Insightful Comments ===== Matt Howard Keybase 20211019 8:00am EST: (defun get_length (my_list) (if my_list (+ 1 (get_length (r my_list))) 0 ) )"

===== Return to: [[Insightful Comments|Insightful Comments]] =====

Matt Howard Keybase 20211019 8:00am EST:

(defun get_length (my_list)
(if my_list
(+ 1 (get_length (r my_list)))
0
)
)

Cancelling a coin

2023-11-18T02:04:36Z

Gneale: Created page with "==== Return to: Insightful_Comments ==== Keybase 20211020: Q: I want to make a coin that can be "cancelled" and the amount returns to sender. One easy way to do this is to embed the sender's address in the puzzle. Is there another way? A(Quexington): You can prove your parent's puzzle hash and then allow sending there. Q (gneale): But how? ASSERT_MY_PARENT_ID - [71] is the closest I thing can find... a nudge in the right direction is sufficient. Thx! A(Quexington..."

==== Return to: [[Insightful_Comments]] ====
Keybase 20211020:

Q: I want to make a coin that can be "cancelled" and the amount returns to sender. One easy way to do this is to embed the sender's address in the puzzle. Is there another way?

A(Quexington): You can prove your parent's puzzle hash and then allow sending there.

Q (gneale): But how? ASSERT_MY_PARENT_ID - [71] is the closest I thing can find... a nudge in the right direction is sufficient. Thx!

A(Quexington): Okay if you only want a nudge then remember that your parent's ID is made up of three components

Timed events

2023-11-18T02:03:19Z

Gneale: Created page with "==== Return to: Insightful_Comments ==== Keybase 20211021: Q : Hi there, a friend and I are wanting to develop a project on Chia as part of our dissertation at university, we wanted to know if timed events/conditions are possible/easy to do? A (Quexington): You can assert that a certain time/block height has passed if you'd like but you cannot assert that a certain time/block height has not passed. If you want to lock a spend until a certain time, you can do that...."

==== Return to: [[Insightful_Comments]] ====
Keybase 20211021:

Q : Hi there, a friend and I are wanting to develop a project on Chia as part of our dissertation at university, we wanted to know if timed events/conditions are possible/easy to do?

A (Quexington): You can assert that a certain time/block height has passed if you'd like but you cannot assert that a certain time/block height has not passed.

If you want to lock a spend until a certain time, you can do that. If you want to lock a spend at a certain time, you cannot do that. Spends only become valid, not invalid.

One more thing to note is that you could get close to the "spend becomes invalid" behavior by having a spend path that allows anyone to spend the coin to some predetermined puzzle. Watchers can watch the blockchain and purposefully go brick those coins that have "expired"

Signature tracing

2023-11-18T02:01:04Z

Gneale: Created page with "==== Return to: Insightful_Comments ==== Keybase 20211021: Q (gneale): Is there any evidence in retrospect in the blockrecord that any particular spendbundle signature is associated with any particular spent coin? A (Quexington): It's kind of like hashing. You can't pull apart a signature to see what pubkeys and messages are inside of it, but if you have a coin spend, you can verify a signature that signs all of its data. If you looked at the spent coin, you can..."

==== Return to: [[Insightful_Comments]] ====
Keybase 20211021:

Q (gneale): Is there any evidence in retrospect in the blockrecord that any particular spendbundle signature is associated with any particular spent coin?

A (Quexington):
It's kind of like hashing. You can't pull apart a signature to see what pubkeys and messages are inside of it, but if you have a coin spend, you can verify a signature that signs all of its data.
If you looked at the spent coin, you can see what pks and messages it required a signature on. Then, if you have a list of signatures that you want to match to it, you can test whether or not those pks and messages are in that signature. And you can see if that's the whole signature or if you're looking at something that is aggregated further.

Q (gneale): The "list of signatures" you are referring to is hypothetical, and not available on the blockrecord, right? All I see is one aggregated signature in the example I am looking at.

A (Quexington): Yes

Signature creation in Python3

2023-11-18T02:00:31Z

Gneale:

==== Return to: [[Insightful_Comments]] ====
Russw_ on 20211029 @01:00am EST said:
-----------------------
GOT IT! This works for me:

basicSpendBundle = await alice.spend_coin(testcoin, pushtx = False, args = spendArgs)

// assemble the aggregated BLS signatures on their own...

// - in this case there is only 1 sig, so `aggSig == sig1`, and `AugScheme.MPL.aggregate` is

// not actually needed here... but just add more to sigs when needed

privateKey = alice.sk()

messageToSign = clvm.casts.int_to_bytes(msg_id)

sig1 = blspy.AugSchemeMPL.sign(privateKey, messageToSign)

sigs = [sig1] # not actually needed with a single sig

aggSig = blspy.AugSchemeMPL.aggregate(sigs) # not actually needed with a single sig

//This is the way to make the combined spend...

// - clean separation between assembling the Coin spends and the agg sigs works well

combinedSpend = cdv.test.SpendBundle(coinSpends, aggSig) # in this single sig case, sig1 would be fine here

//verify both (even though sig1 and combinedSpend.aggregated_signature are the same in this case)

assert blspy.AugSchemeMPL.verify(alice.pk_, messageToSign, sig1)

assert blspy.AugSchemeMPL.verify(alice.pk_, messageToSign, combinedSpend.aggregated_signature)

result = await network.push_tx(combinedSpend)

Signature creation in Python3

2023-11-18T01:59:42Z

Gneale: Created page with "==== Return to: Insightful_Comments ==== Russw_ on 20211029 @01:00am EST said: ----------------------- GOT IT! This works for me: <code> basicSpendBundle = await alice.spend_coin(testcoin, pushtx = False, args = spendArgs) // assemble the aggregated BLS signatures on their own... // - in this case there is only 1 sig, so `aggSig == sig1`, and `AugScheme.MPL.aggregate` is // not actually needed here... but just add more to sigs when needed privateKey = alice...."

==== Return to: [[Insightful_Comments]] ====
Russw_ on 20211029 @01:00am EST said:
-----------------------
GOT IT! This works for me:

<code>
basicSpendBundle = await alice.spend_coin(testcoin, pushtx = False, args = spendArgs)

// assemble the aggregated BLS signatures on their own...

// - in this case there is only 1 sig, so `aggSig == sig1`, and `AugScheme.MPL.aggregate` is

// not actually needed here... but just add more to sigs when needed

privateKey = alice.sk()

messageToSign = clvm.casts.int_to_bytes(msg_id)

sig1 = blspy.AugSchemeMPL.sign(privateKey, messageToSign)

sigs = [sig1] # not actually needed with a single sig

aggSig = blspy.AugSchemeMPL.aggregate(sigs) # not actually needed with a single sig

//This is the way to make the combined spend...

// - clean separation between assembling the Coin spends and the agg sigs works well

combinedSpend = cdv.test.SpendBundle(coinSpends, aggSig) # in this single sig case, sig1 would be fine here

//verify both (even though sig1 and combinedSpend.aggregated_signature are the same in this case)

assert blspy.AugSchemeMPL.verify(alice.pk_, messageToSign, sig1)

assert blspy.AugSchemeMPL.verify(alice.pk_, messageToSign, combinedSpend.aggregated_signature)

result = await network.push_tx(combinedSpend)</code>

Getting started with PRs - Quex

2023-11-18T01:58:48Z

Gneale: Created page with "==== Return to: Insightful_Comments ==== Quexington on Keybase #chialisp 20211201 "If you want to get started with PRs, you just fork the repo, clone the branch you want to PR into (in this case main), create a new branch from that (git checkout -b new_branch), make your changes, push the changes to github and then open a PR to chia's repo. As for testing, the change you want to make is very small, so you could just add it and then a couple of lines in tests/clvm/te..."

==== Return to: [[Insightful_Comments]] ====
Quexington on Keybase #chialisp 20211201

"If you want to get started with PRs, you just fork the repo, clone the branch you want to PR into (in this case main), create a new branch from that (git checkout -b new_branch), make your changes, push the changes to github and then open a PR to chia's repo.
As for testing, the change you want to make is very small, so you could just add it and then a couple of lines in tests/clvm/test_spend_sim.py make sure that test passes and then you're good.
The whole test suite takes approximately 1 million years to run so I wouldn't try that haha"

Identifying CATs

2023-11-18T01:57:36Z

Gneale: Created page with "==== Return to: Insightful_Comments ==== Keybase 20211209 fcoleman Q: "if you are trying to determine if a puzzle hash is a CAT, how can you do this without knowing the inner puzzle as that is one of the curried in arguments..?" Quexington A: "You cannot. You have to look at the parent puzzle reveal with /get_puzzle_and_solution. If the parent was a CAT, then the child is a CAT.""

==== Return to: [[Insightful_Comments]] ====
Keybase 20211209

fcoleman Q: "if you are trying to determine if a puzzle hash is a CAT, how can you do this without knowing the inner puzzle as that is one of the curried in arguments..?"

Quexington A: "You cannot. You have to look at the parent puzzle reveal with /get_puzzle_and_solution. If the parent was a CAT, then the child is a CAT."

Puzzle hints

2023-11-18T01:37:37Z

Gneale: Created page with "==== Return to: Insightful_Comments ==== Bram Cohen 2021-12-17 1:52pm "The hint is the first extra parameter in the create coin and it's more to get someone's attention than it is to explain things""

==== Return to: [[Insightful_Comments]] ====

Bram Cohen 2021-12-17 1:52pm
"The hint is the first extra parameter in the create coin and it's more to get someone's attention than it is to explain things"

Securing spend with announcements - overview

2023-11-18T01:35:32Z

Gneale: Created page with "==== Return to: Insightful_Comments ==== <h1>1.</h1>Dan Perry on Keybase 20211220 10:59pm EST The parameters you pass into the puzzle ("defconstant" and "TARGET_AMOUNT" in your example) are the puzzle's solution. If you curry one of these parameters, you are hard-coding it into the solution, and therefore into the puzzle as well. You won't always know what all of these values will be at the time of the coin's creation, so currying them isn't always an option. Any p..."

==== Return to: [[Insightful_Comments]] ====
<h1>1.</h1>Dan Perry on Keybase 20211220 10:59pm EST
The parameters you pass into the puzzle ("defconstant" and "TARGET_AMOUNT" in your example) are the puzzle's solution. If you curry one of these parameters, you are hard-coding it into the solution, and therefore into the puzzle as well.

You won't always know what all of these values will be at the time of the coin's creation, so currying them isn't always an option. Any part of the solution that has not been curried has to be supplied when the coin is spent. (In order to spend a coin, you must provide the original puzzle, a valid solution, and usually a signature)

While a farmer cannot change the puzzle (because doing so would change the puzzlehash), a farmer can attempt to change any of the non-curried values in the solution. You should make sure that if those values do get changed, the spend will fail. The way you do this is with announcements, which are covered in the chialisp docs: https://chialisp.com/docs/coins_spends_and_wallets

This video shows you how to use announcements to secure your coins: https://www.youtube.com/watch?v=_SBGfMZhRd8

<h1>2.</h1>gneale notes 20211221
Technique for securing multiple coin spends with announcements commonly uses creating puzzlehash announcement while assert a coin announcement.

See:
https://github.com/geoffwalmsley/CreatorNFT/blob/912ce88d75f89357141260aad2dd1626038f7d60/clsp/creator_nft.clsp#L64
(list CREATE_PUZZLE_ANNOUNCEMENT payment_info) ;; Announce the p2 coin id
(list ASSERT_COIN_ANNOUNCEMENT (sha256 payment_info (sha256tree new_state))) ;; Assert the p2_coin spend

See also:
https://github.com/xch-gallery/nft-companion/blob/3ec7748f3cd6834ea97fd46fde6d119f30ab566b/ownable_singleton/clsp/ownable_singleton.clsp#L27
(list CREATE_PUZZLE_ANNOUNCEMENT payment_id) ; Inform the payment coin of this spend
(list ASSERT_COIN_ANNOUNCEMENT (sha256 payment_id new_owner_pubkey)) ; Assert that the payment coin is being spent and validate the owner

Singleton comments

2023-11-18T01:34:58Z

Gneale: Created page with "==== Return to: Insightful_Comments ==== Trepca 20020511: *singleton is tricky yeah, you first create launcher coin, then launcher coin creates singleton coin, and then you need to spend the singleton (eve spend) to "initialize" it *conditions are applied when coin is spent if any are returned *because chia has this concept of all spends happening at the same time in a block, so order doesn't matter, just that parent exists, will be spent, will create a new child coi..."

==== Return to: [[Insightful_Comments]] ====
Trepca 20020511:
*singleton is tricky yeah, you first create launcher coin, then launcher coin creates singleton coin, and then you need to spend the singleton (eve spend) to "initialize" it
*conditions are applied when coin is spent if any are returned
*because chia has this concept of all spends happening at the same time in a block, so order doesn't matter, just that parent exists, will be spent, will create a new child coin, that will be spent too to do something else.
*spend bundle is like a transaction where you can have many spends and coins being created and spent

Hinting

2023-11-17T15:58:55Z

Gneale: Created page with "===== Return to: Chialisp ===== <big>Useful Commands:</big> <pre>cd ~/.chia/mainnet/db</pre> <pre>sqlite3 blockchain_v2_testnet10.sqlite</pre> <pre>SELECT hex(hint),hex(coin_id) FROM hints LIMIT 1000,100;</pre> <pre>SELECT * FROM hints where coin_id = X'02AD7C44D75DE72550B2A8A6E63652C993AC9A60C641AE644230230D95EAD315';</pre> <pre>SELECT * FROM hints WHERE hint = X'01388426758A92EFA9669821578216A223FF167154CFCF67F5E6E8DD76DAF05E'</pre> <pre>SELECT * FROM hint..."

===== Return to: [[Chialisp|Chialisp]] =====
<big>Useful Commands:</big>
<pre>cd ~/.chia/mainnet/db</pre>
<pre>sqlite3 blockchain_v2_testnet10.sqlite</pre>
<pre>SELECT hex(hint),hex(coin_id) FROM hints LIMIT 1000,100;</pre>
<pre>SELECT * FROM hints where coin_id = X'02AD7C44D75DE72550B2A8A6E63652C993AC9A60C641AE644230230D95EAD315';</pre>
<pre>SELECT * FROM hints WHERE hint = X'01388426758A92EFA9669821578216A223FF167154CFCF67F5E6E8DD76DAF05E'</pre>
<pre>SELECT * FROM hints where hex(coin_id) = "02AD7C44D75DE72550B2A8A6E63652C993AC9A60C641AE644230230D95EAD315";</pre>
<pre>SELECT hex(hint) FROM hints LIMIT 1000,10;</pre>
<pre>SELECT hex(hint),hex(coin_id) FROM hints WHERE hint = X'01388426758A92EFA9669821578216A223FF167154CFCF67F5E6E8DD76DAF05E';</pre>

Standard transaction

2023-11-17T15:57:59Z

Gneale: Created page with "===== Return to: CLVM ===== <big>Standard Transaction:</big> <pre> (a (q 2 (q 2 (i 11 (q 2 (i (= 5 (point_add 11 (pubkey_for_exp (sha256 11 (a 6 (c 2 (c 23 () ) ) ) ) ) ) ) (q 2 23 47) (q 8) ) 1) (q 4 (c 4 (c 5 (c (a 6 (c 2 (c 23 ()) ) ) () ) ) ) (a..."

===== Return to: [[CLVM|CLVM]] =====
<big>Standard Transaction:</big>
<pre>
(a
(q 2
(q 2
(i 11
(q 2
(i
(= 5
(point_add 11
(pubkey_for_exp
(sha256 11
(a 6
(c 2
(c 23
()
)
)
)
)
)
)
)
(q 2 23 47)
(q 8)
)
1)
(q 4
(c 4
(c 5
(c
(a 6
(c 2
(c 23 ())
)
)
()
)
)
)
(a 23 47)
)
)
1)
(c
(q 50 2
(i
(l 5)
(q 11
(q . 2)
(a 6
(c 2
(c 9 ())
)
)
(a 6
(c 2
(c 13 ())
)
)
)
(q 11
(q . 1)
5)
)
1)
1)
)
(c
(q . 0x98ae659900a7e2b3030229447fa64bb9ae2e5a1fd0aafcb0095f5f6ecb610315c17f7f6b110d6337a4bbf14b2301ccbc)
1)
)</pre>

Sha256tree

2023-11-17T15:57:35Z

Gneale: Created page with "===== Return to: CLVM ===== <big>sha256tree:</big> <pre> (a (q 2 6 (c 2 (c 5 ()))) (c (q 1 2 (i (l 5) (q 11 (q . 2) (a 6 (c 2 (c 9 ()))) (a 6 (c 2 (c 13 ()))) ) (q 11 (q . 1) 5)) 1) 1) ) ( (c 2 (c 5 (c 13 () ) ) ) )</pre>"

===== Return to: [[CLVM|CLVM]] =====
<big>sha256tree:</big>
<pre>
(a

(q 2 6 (c 2 (c 5 ())))

(c (q 1 2
(i (l 5)
(q 11 (q . 2) (a
6
(c 2 (c 9 ())))
(a
6
(c 2 (c 13 ())))
)
(q 11 (q . 1) 5))
1) 1)
)

(
(c 2
(c 5
(c 13
()
)
)
)
)</pre>

CLVM

2023-11-17T15:57:16Z

Gneale: Created page with "===== Return to: Chialisp ===== <big>Common Examples</big> * sha256tree * standard transaction"

===== Return to: [[Chialisp|Chialisp]] =====
<big>Common Examples</big>
* [[sha256tree]]
* [[standard transaction]]

Integer byte encoding peculiarity

2023-11-17T15:56:34Z

Gneale: Created page with "===== Return to: Chialisp ===== According to Matt Howard 20210816, there is a "peculiarity with how integers are encoded in bytes. It's signed integers. If you just return <code>run '(q . 0xd7)'</code> you get -41 because the most significant bit is set and that's telling the interpreter to read this as a negative number. If you add some leading zeroes <code>run '(q . 0x00d7)'</code>, it should pop out as you would expect". Returns 215. <h1>Orig..."

===== Return to: [[Chialisp|Chialisp]] =====

According to Matt Howard 20210816, there is a "peculiarity with how integers are encoded in bytes.

It's signed integers.

If you just return <code>run '(q . 0xd7)'</code> you get -41 because the most significant bit is set and that's telling the interpreter to read this as a negative number.

If you add some leading zeroes <code>run '(q . 0x00d7)'</code>, it should pop out as you would expect".

Returns 215.

<h1>Original concern</h1>

Q: I still have one question: why does <code>brun '(- (q . 0xd7) (q . 0x1))'</code> return -42?

A: <code>hex(-42 & 0xff) == '0xd6''</code> I see thanks!

Recursion

2023-11-17T15:56:09Z

Gneale: Created page with "===== Return to: Chialisp ===== <big>Important excerpts from the documentaiton:</big> https://chialisp.com/docs/clvm/dive_into_clvm#programs-as-parameters : The core CLVM does not have an operator for creating user defined functions. It does, however, allow programs to be passed as parameters, which can be used for similar results. Here is a puzzle that executes the program contained in 2 (the first solution argument) with the solution (12). <code>brun '(..."

===== Return to: [[Chialisp|Chialisp]] =====
<big>Important excerpts from the documentaiton:</big> https://chialisp.com/docs/clvm/dive_into_clvm#programs-as-parameters :

The core CLVM does not have an operator for creating user defined functions. It does, however, allow programs to be passed as parameters, which can be used for similar results.

Here is a puzzle that executes the program contained in 2 (the first solution argument) with the solution (12).

<code>brun '(a 2 (q . (12)))' '((* 2 (q . 2)))'
</code>

24

Taking this further we can make the puzzle run a new evaluation that only uses parameters from its old solution:

<code>brun '(a 2 1)' '((* 5 (q . 2)) 10)'
</code>

20

'''''We can use this technique to implement recursive programs.
'''''

Added gneale 20210818:

<code>brun '(a 2 1)' '((+ 5 (q . 3)) 10)'
</code>

13

Added gneale 20211119:

<code>brun '(a 2 1)' '((* 4 (q . 2)) 10)'
</code>

36

NOTE:This is because position 4 inside ((* 4 (q . 2)) 10) is * which is the same as the number 9.

<big>Explanation Items:</big>

https://chialisp.com/docs/clvm/lang_reference#control-flow
a means "apply" (a P A)
Evaluate value P as a program with value A as its environment.

Note that this executes P in what is called a ''new environment''. Using integers to reference values in the solution will reference values in A.

Personal NOTE: An ''environment'' is essentially just a new binary tree attached to an existing branch of a binary tree. So in the above example P executes in a new environment.

Cancel mojo technique

2023-11-17T15:55:44Z

Gneale: Created page with "===== Return to: Chialisp ===== The following chialisp code ensure that the introduced parent puzzlehash of the parent coin is correct first, before sending the rebate coin which is restricted to that one possible wallet address: (mod (pwd ppid pph pamt ph amt) (defconstant CREATE_COIN 51) (defconstant ASSERT_MY_PARENT_ID 71) (if (= pwd (q . cancel)) (list (list ASSERT_MY_PARENT_ID (sha256 (concat ppid pph pamt))) (list CREATE_CO..."

===== Return to: [[Chialisp|Chialisp]] =====
The following chialisp code ensure that the introduced parent puzzlehash of the parent coin is correct first, before sending the rebate coin which is restricted to that one possible wallet address:

(mod (pwd ppid pph pamt ph amt)
(defconstant CREATE_COIN 51)
(defconstant ASSERT_MY_PARENT_ID 71)
(if (= pwd (q . cancel))
(list (list ASSERT_MY_PARENT_ID (sha256 (concat ppid pph pamt)))
(list CREATE_COIN pph amt))
(if (= pwd (q . hello))
(list (list CREATE_COIN ph amt))
(x)
)
)
)