Digital Matter Theory
  • Introduction
    • Digital Matter Theory
    • Digital Elements
      • .element Registry
      • Example Element
    • Non-Arbitrary Tokens (NATs)
      • Hybrid Token Model
      • NAT Deployment Format
      • NAT Minting
      • NAT Token Transfer
    • NAT Use Cases
      • $NAT (Method 1) - Live
      • $BMT (Method 3)
    • UNAT Use Cases
      • $dmt-natcats
      • $dmt-nat
    • Supported Token Protocols
      • TAP Protocol
    • Resources
      • FAQ
      • Videos
      • Guides
        • $BMT Blockdrop Claim
        • How to convert your NAT deployment into a UNAT (Reinscription Guide)
      • $NAT Mint Process
      • Rendering a UNAT
Powered by GitBook
On this page
  1. Introduction
  2. Digital Elements

Example Element

Bitinformatics - a new practice of data parsing and pattern recognition when discovering elements on Bitcoin

Previous.element RegistryNextNon-Arbitrary Tokens (NATs)

Last updated 1 year ago

Below is an example of how Bitinformaticists can find the existence of a pattern within a data series that is specific to a single block. From this point of pattern discovery, an Element can then be registered on-chain.

Example

Using block 817,577 you can find separate patterns to use for your .element inscription in the transaction hash .

Pattern 69 occurs 1,088 times within block 817,577.

Pattern 420 occurs 58 times within block 817,577.

Side note: using tools developed by the community, you'll be able to search patterns in the transaction hash data fields for horizontal, vertical and diagonal patters.

To inscribe the above patterns, they would appear as follows respectively:

satoshi.69.16.element
finney.420.16.element
field #16
The image shows two different search patterns using transaction hash block data.