User contributions for Gneale

Jump to navigation Jump to search
Search for contributionsExpandCollapse
⧼contribs-top⧽
⧼contribs-date⧽
(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)

10 December 2023

25 November 2023

22 November 2023

21 November 2023

18 November 2023

  • 02:0802:08, 18 November 2023 diff hist +107 N Sha256tree RKissCreated page with "===== Return to: Insightful Comments ===== <gallery> Rkiss.PNG|Caption 3 </gallery>" current
  • 02:0802:08, 18 November 2023 diff hist +1,205 N Intercoin CommunicationCreated 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..." current
  • 02:0702:07, 18 November 2023 diff hist +485 N Simplest puzzles for testingCreated 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..." current
  • 02:0702:07, 18 November 2023 diff hist +1,491 N Block CompositionCreated 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..." current
  • 02:0602:06, 18 November 2023 diff hist +294 N Graftroot QuexingtonCreated 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" current
  • 02:0602:06, 18 November 2023 diff hist +209 N Length of a listCreated 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 ) )" current
  • 02:0402:04, 18 November 2023 diff hist +574 N Cancelling a coinCreated 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..." current
  • 02:0302:03, 18 November 2023 diff hist +857 N Timed eventsCreated 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...." current
  • 02:0102:01, 18 November 2023 diff hist +993 N Signature tracingCreated 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..." current
  • 02:0002:00, 18 November 2023 diff hist +3 Signature creation in Python3No edit summary current
  • 01:5901:59, 18 November 2023 diff hist +1,319 N Signature creation in Python3Created 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...."
  • 01:5801:58, 18 November 2023 diff hist +632 N Getting started with PRs - QuexCreated 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..." current
  • 01:5701:57, 18 November 2023 diff hist +390 N Identifying CATsCreated 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."" current
(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)