BIP32 Path Depth Parser Check

Parse a BIP32 path with m or M root and apostrophe-marked hardened indices, enforcing depth and public-derivation restrictions.

Description

A BIP32 derivation path identifies successive child keys in a hierarchy.

A BIP32 derivation path identifies successive child keys in a hierarchy. Hardened children encode their index with the high bit set and require private derivation, while a public root can follow only nonhardened steps.^{[1, 2]}

Parse a BIP32 path with m or M root and apostrophe-marked hardened indices, enforcing depth and public-derivation restrictions.

When to use BIP32 Path Depth Parser Check

Use this tool to parse a BIP32 path with m or M root and apostrophe-marked hardened indices, enforcing depth and public-derivation restrictions.

Choose the text, counts, explicit reference time or format parameters requested by this tool. Follow the stated byte, epoch-time and randomness assumptions.

How to use BIP32 Path Depth Parser Check and understand its results

Choose the text, counts, explicit reference time or format parameters requested by this tool. Follow the stated byte, epoch-time and randomness assumptions.
Enter path using the field table and calculation rules, then run the tool.
Read root, depth, indices, hardened. The explanation below defines the units, signs, ordering and any flags or placeholder values.
If the tool reports an input issue, correct the values and run it again. Apply the stated assumptions when interpreting a successfully returned result.

Input field	Meaning	Value type; see rules below	Requirement
path	BIP32 derivation path	string; maximum length: 10000	Required

Enter a slash-separated path beginning exactly m for a private root or M for a public root. Each following component must be unsigned decimal digits optionally ending in an apostrophe, with the unencoded value below 2³¹. The tool returns root, depth, encoded indices and aligned hardened flags. Public-root hardened components and depth above 255 are errors. A root alone is depth zero; leading zeros in numeric components are accepted.

encoded index = decimal index + (hardened ? 2³¹ : 0); depth = component count

Units, indexing, boundary conditions and exceptional cases are defined in the calculation rules above.

Output field	Meaning	Value type
root	Path root	string; one of private, public
depth	Derivation depth	integer; minimum: 0; maximum: 255
indices	Encoded child indices	list of integer; minimum: 0; maximum: 9007199254740991
hardened	Hardened derivation flags	list of boolean

json

{
  "input": {
    "path": "m/44'/0'/0'/0/5"
  },
  "output": {
    "root": "private",
    "depth": 5,
    "indices": [
      2147483692,
      2147483648,
      2147483648,
      0,
      5
    ],
    "hardened": [
      true,
      true,
      true,
      false,
      false
    ]
  }
}

Limitations and assumptions

It parses notation without deriving keys or checking a wallet's path policy. h/H suffixes, whitespace, empty components and a trailing slash are unsupported. A structurally accepted path does not prove the availability, origin or security of its keys.

Numeric inputs must be finite. Follow the calculation-specific rules for overflow, underflow and exceptional cases. Extremely large text inputs are rejected. Missing required fields, extra fields, wrong value types and violations of the calculation rules are input errors.

Alternative or Complementary methods

Use Mnemonic Checksum Bits For Word Count: Return the entropy and checksum bit counts prescribed for a valid BIP39 mnemonic word count. For a complementary task, use Keyspace Size Calculator: Return the exact keyspace size for independent positions chosen from a fixed-size alphabet, with bounded output materialization.

Further background: BIP 32: derivation paths and hardened child keys.

References

BIP32 Path Depth Parser Check — tool.io
BIP 32: derivation paths and hardened child keys — Bitcoin Improvement Proposals

Similar or alternative tools

Mnemonic Checksum Bits For Word Count
Return the entropy and checksum bit counts prescribed for a valid BIP39 mnemonic word count.
Keyspace Size Calculator
Return the exact keyspace size for independent positions chosen from a fixed-size alphabet, with bounded output materialization.