Inscription #65980368#65,980,368pngInscription #59904428#59,904,428webpInscription #53392193#53,392,193pngmint50.mtid#48,303,701brc-20mint50.mtid#48,303,689brc-20mint50.mtid#48,303,658brc-20mint50.mtid#48,303,604brc-20mint50.mtid#48,303,603brc-20mint1,000.inbrc#46,644,403BRC-100mint1,000.inbrc#46,644,394BRC-100mint1,000.inbrc#46,644,372BRC-100mint1,000.inbrc#46,644,371BRC-100mint1,000.inbrc#46,644,370BRC-100mint1,000.inbrc#46,644,368BRC-100mint1,000.inbrc#46,644,366BRC-100mint1,000.inbrc#46,644,359BRC-100mint1,000.inbrc#46,644,356BRC-100mint1,000.inbrc#46,644,351BRC-100mint1,000.inbrc#46,644,313BRC-100mint1,000.inbrc#46,644,301BRC-100mint1,000.inbrc#46,644,292BRC-100mint1,000.inbrc#46,644,286BRC-100mint1,000.inbrc#46,644,284BRC-100mint1,000.inbrc#46,644,264BRC-100mint1,000.inbrc#46,644,262BRC-100mint1,000.inbrc#46,644,261BRC-100mint1,000.inbrc#46,644,234BRC-100mint1,000.inbrc#46,644,233BRC-100mint1,000.inbrc#46,644,230BRC-100mint1,000.inbrc#46,644,214BRC-100mint1,000.inbrc#46,644,213BRC-100Inscription #46092872#46,092,872pngInscription #45996471#45,996,471pngInscription #45993337#45,993,337pngInscription #45374873#45,374,873pngInscription #45348367#45,348,367pngInscription #45175883#45,175,883svgInscription #45175863#45,175,863svgInscription #45175822#45,175,822svgInscription #45175818#45,175,818svgInscription #45175811#45,175,811svgInscription #45175783#45,175,783svgInscription #45175782#45,175,782svgInscription #45175766#45,175,766svgInscription #45175736#45,175,736svgInscription #45175735#45,175,735svgInscription #45152019#45,152,019svgInscription #45151983#45,151,983svgInscription #45151981#45,151,981svgInscription #45151964#45,151,964svgInscription #45151959#45,151,959svgInscription #45148471#45,148,471svgconsidered 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,026,071textchecksum = "7b5fac59a5cb5dd637972e5fca70daf0523c9067fcdc4842f053dae04a18f8e9" dependencies = [ "libc", "windows-sys 0.48.0", ] [[package]] name = "spin" version = "0.5.2" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "6e63cff320ae2c57904679ba7cb63280a3dc4613885beafb148ee7bf9aa9042d" [[package]] name = "spin" version = "0.9.8" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "6980e8d7511241f8acf4aebddbb1ff938df5eebe98691418c4468d0b72a96a67" [[package]] name = "strsim" version = "0.10.0" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "73473c0e59e6d5812c5dfe2a064a6444949f089e20eec9a2e5506596494e4623" [[package]] name = "strum" version = "0.24.1" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "063e6045c0e62079840579a7e47a355ae92f60eb74daaf156fb1e84ba164e63f" dependencies = [ "strum_macros", ] [[package]] name = "strum_macros" version = "0.24.3" source = "registry+https://github.com/rust-lang/crates.io-index"#45,025,400text### Fixed - Respect locked coins (#2618) - Set `Cache-Control: no-store` header on 404 responses (#2637) - Fix statistics table and increment schema version (#2624) - Fix broken link in README (#2621) - Speed up indexing of re-inscriptions (#2608) - Fix docs rendering (#2612) - Update docs with new position of --enable-json-api (#2601) - Move `--enable-json-api` flag to server options (#2599) - Make server_runs_with_rpc_user_and_pass_as_env_vars test less flaky (#2580) ### Runes - Implement open etchings (#2548) - Add more info to /rune page and link to rune from /tx (#2528) - Display inscription on /rune (#2542) - Add rune numbers (#2557) - Ignore non push opcodes in runestones (#2553) - Improve rune minimum at height (#2546) [0.10.0](https://github.com/ordinals/ord/releases/tag/0.10.0) - 2023-10-23 -------------------------------------------------------------------------- ### Added - Batch inscriptions (#2504) - Add teleburn command to generate Ethereum teleburn addresses (#1680) - Add Korean version of handbook (#2560)#45,025,379textconsidered 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,025,376textmint1,000,000.ucat#44,113,292brc-20mint1,000,000.ucat#44,113,285brc-20mint1,000,000.ucat#44,113,231brc-20mint1,000,000.ucat#44,113,192brc-20