Replies: 12 comments 11 replies
-
seems intuitive to me, the same way Ruby allows referencing the last element by |
Beta Was this translation helpful? Give feedback.
-
Makes sense. Might be useful to also know the number of inscriptions: Could expose a basic array api even. |
Beta Was this translation helpful? Give feedback.
-
What use cases can you forsee that this would open up?Sent from my iPhoneOn Jun 20, 2023, at 3:42 AM, Danny Yang ***@***.***> wrote:
Ordinal theory uniquely identifies sats on Bitcoin. If inscriptions can reference sats by their id and access the on-chain inscriptions on those sats, that can open up new possibilities.
One proposal for sat referencing:
"/sat/X" where X is the integer sat number, this returns the first inscription on sat X if it exists
"/sat/X/n" where n is the nth inscription on sat X if it was inscribed (and reinscribed) n times or more
"/sat/X/-1" returns the most recent inscription on sat X
A sat basically becomes a variable that can change, and record state changes for inscriptions (which are immutable) to use. This opens up a lot of powerful use cases for code based inscriptions.
—Reply to this email directly, view it on GitHub, or unsubscribe.You are receiving this because you are subscribed to this thread.Message ID: ***@***.***>
|
Beta Was this translation helpful? Give feedback.
-
This is a relevant request as well: #1385 |
Beta Was this translation helpful? Give feedback.
-
Assuming this will largely be used programmatically, does it make more sense to make this a single JSON API endpoint instead? The payload would just be a list of inscription IDs in the order in which they were inscribed. That'd make it easier to get the total count as well. |
Beta Was this translation helpful? Give feedback.
-
Will inscription numbers change after reinscriptions? It really shouldn't. But if it's being considered or not, there should also be a way to return the first or original inscription # of a sat in this sat referencing language. This number is in of itself something that collectors value. Proposal: "/sat/X/prime" where X is the integer sat number, this returns the first inscription # on sat X if it exists |
Beta Was this translation helpful? Give feedback.
-
Would the endpoint be a call to something like |
Beta Was this translation helpful? Give feedback.
-
I would also like to suggest a way for an inscription to recall its own sat metadata.
|
Beta Was this translation helpful? Give feedback.
-
Gents, 1- Is this recycling referencing the Segwit space also or the base 1 Meg only for the history data/ total addressable space? 2- Either way would it not be cumulative, per transaction, per Sat, reducing the available space each time? 3- re utxo's are they also a finite amount set at inception Thanks for focusing your efforts here! |
Beta Was this translation helpful? Give feedback.
-
Fyi, |
Beta Was this translation helpful? Give feedback.
-
I would like to add if it hasnt been mentioned: referencing a satoshi could also work by referencing the alphabetical sat name, and this would enable you to take a named sat with a human readable name and inscribe it with several reinscriptions to create a software library satoshi named sftwarelib https://ordinals.com/sat/sftwarelib or to create a satoshi inscribed with several cookbooks named mycookbooks https://ordinals.com/sat/mycookbooks. |
Beta Was this translation helpful? Give feedback.
-
Sorry if this sounds ignorant, I'm rather new to the ecosystem and plainly working off my small amount of knowledge + logic. Would there be a way to name inscriptions? Nth inscription holds but how many inscriptions could a sat hold? The more re-inscriptions, the harder it would be to make sense of which is which! (Though I understand that the first and latest might have the most significance!) |
Beta Was this translation helpful? Give feedback.
-
Ordinal theory uniquely identifies sats on Bitcoin. If inscriptions can reference sats by their id and access the on-chain inscriptions on those sats, that can open up new possibilities.
One proposal for sat referencing:
"/sat/X" where X is the integer sat number, this returns the first inscription on sat X if it exists
"/sat/X/n" where n is the nth inscription on sat X if it was inscribed (and reinscribed) n times or more
"/sat/X/-1" returns the most recent inscription on sat X
A sat basically becomes a variable that can change, and record state changes for inscriptions (which are immutable) to use. This opens up a lot of powerful use cases for code based inscriptions.
Beta Was this translation helpful? Give feedback.
All reactions