Skip to content

Sources behind this page

Every claim on this page resolves to these pinned revisions. Follow a path to read the exact source the statement was verified against.

atomicals-electrumx-1.5.2.0

Atomicals ElectrumX

Revision v1.5.2.0 (2025-03-27)

Open pinned path: mintParser

Version-sensitive ARC-20 and Atomicals validation behavior used as the pinned reference baseline.

atomicals-guide

Atomicals protocol guide

Revision unversioned

Open pinned path: bitwork

Concept and command-line explanation. Explicitly states that the specification is defined in code.

Bitwork estimator

Raw

Model a Bitwork prefix and see the expected search space, with the uncertainty stated rather than hidden.

Protocol behavior Verified 2026-08-31 Metadata & Sources

Describes the Atomicals protocol itself at the pinned reference revision. It does not promise that any product exposes it.

Page ID
tools/bitwork-estimator
Normative authority
Atomicals reference implementation
Networks
mainnet
Documentation version
2026.08
Audience
creator, developer
Owner
bitcoin-universe-docs
Sources
Known limitations
  • Probabilistic. Attempts are independent, so a run can finish far under or far over the expectation.
  • No amount of work guarantees a result in any particular time.
  • Nothing here estimates cost, revenue, or profitability.

Bitwork estimator

Probabilistic. Not a schedule
Hexadecimal characters only. Each additional character multiplies the expected attempts by sixteen.
Some configurations allow a partial next character, which sits between two whole character levels.
Your own measured rate. This tool has no idea what hardware you have, and does not estimate cost or profitability.

Attempts are independent, so a run can finish far under or far over the expected count. No amount of work guarantees a result in any particular time. Nothing here is a profitability statement.

Each hexadecimal character of prefix fixes four bits of the transaction id, so the expected number of attempts is two to the power of the fixed bits. A partial next character fixes whole bits between two character levels.

The probability of having finished after a given number of attempts assumes independent attempts, each succeeding with probability two to the negative power of the fixed bits.

  • Your actual attempt rate. Measure it; the tool takes your figure.
  • Electricity, hardware, or opportunity cost.
  • Whether the mint will still have quota left when you finish.
  • Whether a perpetual deployment’s requirement will have progressed by then.

Setting a mint Bitwork requirement raises the cost of automated claiming, and it raises the cost for every ordinary participant equally. Model the level you are considering before publishing it, because it cannot be changed afterwards for a fixed deployment.

See ARC-20 Bitwork requirements.