transfer100.pizza#71,459,870brc-20transfer100.pizza#71,255,010brc-20Inscription #67381230#67,381,230html#63,154,552Inscription #63154551#63,154,551png#63,152,530Inscription #63152529#63,152,529png#63,149,207Inscription #63149206#63,149,206pngtoken-transfer40,000,000,000.dmt-nat#59,967,480taptoken-transfer4.dmt-nat#59,967,113tapmsgstr "" "Mga generative na koleksyon ng profile picture kung saan ang mga accessory " "at attribute ay naka-inscribe bilang mga indibidwal na larawan, o sa isang " "shared texture atlas, at pagkatapos ay pinagsama, parang collage, na may " "kanya kanyang combinasyon." #: src/inscriptions/recursion.md:23 msgid "A few other endpoints that inscriptions may access are the following:" msgstr "" "Ang ilan pang mga endpoint na maaaring ma-access ng mga inskripsiyon ay ang " "mga sumusunod:" #: src/inscriptions/recursion.md:25 msgid "`/blockheight`: latest block height." msgstr "`/blockheight`: pinakabagong block height." #: src/inscriptions/recursion.md:26 msgid "`/blockhash`: latest block hash." msgstr "`/blockhash`: pinakabagong block hash." #: src/inscriptions/recursion.md:27 msgid "`/blockhash/<HEIGHT>`: block hash at given block height." msgstr "`/blockhash/<HEIGHT>`: block hash sa ibinigay na block height." #: src/inscriptions/recursion.md:28 msgid "`/blocktime`: UNIX time stamp of latest block." msgstr "`/blocktime`: UNIX time stamp ng pinakabagong block." #45,004,155text"`000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1fi255`:" #: src/inscriptions/provenance.md:63 msgid "" "And of inscription ID " "`000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1fi256`:" msgstr "" "At ng inskripsiyong ID " "`000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1fi256`:" #: src/inscriptions/provenance.md:75 msgid "Notes" msgstr "Tandaan" #: src/inscriptions/provenance.md:77 msgid "" "The tag `3` is used because it is the first available odd tag. Unrecognized " "odd tags do not make an inscription unbound, so child inscriptions would be " "recognized and tracked by old versions of `ord`." msgstr "" "`3` Ginagamit ang tag dahil ito ang unang available na odd tag. Ang mga " "hindi kilalang odd tag ay hindi gumagawa ng isang inskripsiyon na unbound, " "kaya ang mga child inscription ay makikilala at masusubaybayan ng mga lumang " "bersyon ng ord." #: src/inscriptions/provenance.md:81 msgid "" "A collection can be closed by burning the collection's parent inscription, "#45,004,082text"en plus court au fur et à mesure que le satoshi est miné dans le futur. Ils " "pourraient d’abord être courts, puis devenir plus longs, mais tous les bons " "noms courts seraient alors piégés dans le bloc de genèse qui ne peut pas " "être dépensé." #: src\overview.md:204 msgid "" "As an example, 1905530482684727°'s name is \"iaiufjszmoba\". The name of the " "last satoshi to be mined is \"a\". Every combination of 10 characters or " "less is out there, or will be out there, someday." msgstr "" "À titre d’exemple, le nom pour 1905530482684727° est « iaiufjszmoba ». Le " "nom du dernier satoshi qui sera miné est « a ». Toutes les combinaisons de " "10 caractères ou moins existent déjà, ou existeront un jour." #: src\overview.md:208 msgid "Exotics" msgstr "Exotiques" #: src\overview.md:211 msgid "" "Satoshis may be prized for reasons other than their name or rarity. This " "might be due to a quality of the number itself, like having an integer " "square or cube root. Or it might be due to a connection to a historical " #45,003,361text"with the highest number of occurrences in `frequency.tsv` shall be the " "winner of part 1." msgstr "" "Die Transaktion, die die UTXO mit dem Namen des Sats enthält, der in " "`frequency.tsv` am häufigsten vorkommt, wird der Gewinner von Teil 1 sein." #: src\bounty/3.md:58 msgid "Tie Breaking" msgstr "Entscheidung bei Unentschieden" #: src\bounty/3.md:60 msgid "" "In the case of a tie, where two submissions occur with the same frequency, " "the earlier submission shall be the winner." msgstr "" "Im Falle eines Unentschiedens, bei dem zwei Einsendungen mit der gleichen " "Häufigkeit erfolgen, geht die frühere Einsendung als Sieger hervor." #: src\bounty/3.md:66 msgid "Part 0: 200,000 sats" msgstr "Teil 0: 200,000 sats" #: src\bounty/3.md:67 msgid "Part 1: 200,000 sats" msgstr "Teil 1: 200,000 sats" #: src\bounty/3.md:68 msgid "Total: 400,000 sats" msgstr "Gesamt: 400,000 sats" #: src\bounty/3.md:73 msgid "" "[`17m5rvMpi78zG8RUpCRd6NWWMJtWmu65kg`](https://mempool.space/" "address/17m5rvMpi78zG8RUpCRd6NWWMJtWmu65kg)"#44,994,482textconsidered 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)#44,991,615textdmt-mint.nat#44,606,431tapdmt-mint.nat#44,606,413tapdmt-mint.nat#44,606,410tapdmt-mint.nat#44,606,393tapdmt-mint.nat#44,606,381tapdmt-mint.nat#44,606,372tapdmt-mint.nat#44,606,304tapdmt-mint.nat#44,606,297tapdmt-mint.nat#44,606,288tapdmt-mint.nat#44,606,287tap793610.bitmap#13,136,303text273710.bitmap#12,514,423text367561.bitmap#12,513,928text