Bitcoin address: bc1p8uw0z8fw7fzys22qkytaamj59kgyqsunqd3hzhfmnd0afnwxj2zsqxf3f3

SHOWING: First 60

#56,410,097png mint1,000,000.ligo#55,025,098brc-20 mint1,000,000.ligo#55,025,095brc-20 mint1,000,000.ligo#55,025,093brc-20 mint1,000,000.ligo#55,024,638brc-20 mint1,000,000.ligo#55,024,637brc-20

#52,119,723html mint21,000.btc#51,465,790bitcoin

#50,198,743html

#45,363,228png

#45,362,596png

msgid ""
"Such Bitcoiners may be more interested in inscriptions than Ethereum NFTs, "
"unlocking new classes of collector."
msgstr ""
"Ang mga bitcoiner na ito ay maaaring mas interesado sa inscriptions kaysa sa "
"mga Ethereum NFT, na nagbubukas ng mga bagong klase ng mga kolektor."

#: src/faq.md:204
msgid "_Inscriptions have a richer data model._"
msgstr "_Ang inscriptions ay may mas magandang data model._"

#: src/faq.md:206
msgid ""
"Inscriptions consist of a content type, also known as a MIME type, and "
"content, which is an arbitrary byte string. This is the same data model used "
"by the web, and allows inscription content to evolve with the web, and come "
"to support any kind of content supported by web browsers, without requiring "
"changes to the underlying protocol."
msgstr ""
"Ang inscriptions ay binubuo ng content type, na kilala rin bilang MIME type, "
"at content, na isang arbitrary na byte string. Ito ang parehong data model "
"na ginagamit ng web, na nagbibigay-daan sa inscription ng content na mag-"

#45,003,409text

considered to have an implicit input equal in size to the subsidy, followed by
an input for every fee-paying transaction in the block, in the order that those
transactions appear in the block. The implicit subsidy input carries the
block's newly created sats. The implicit fee inputs carry the sats that were
paid as fees in the block's transactions.

Underpaying the subsidy does not change the ordinal numbers of sats mined
in subsequent blocks. Ordinals depend only on how many sats could have been
mined, not how many actually were.

=== Specification ===

Sats are numbered and transferred with the following algorithm:

<pre>
# subsidy of block at given height
def subsidy(height):
  return 50 * 100_000_000 >> height // 210_000

# first ordinal of subsidy of block at given height
def first_ordinal(height):
  start = 0
  for height in range(height):
    start += subsidy(height)
  return start

# assign ordinals in given block
def assign_ordinals(block):
  first = first_ordinal(block.height)
  last = first + subsidy(block.height)

#45,003,285text