IPv4 Prefix Subdivision Index
Locate a member IPv4 address’s normalized child-prefix index inside an explicit parent at a requested subdivision width.
Description
Locate a member IPv4 address’s normalized child-prefix index inside an explicit parent at a requested subdivision width.
An address inside a parent IPv4 block belongs to one equal-size child at a chosen prefix length. Integer division locates that child.
When to use this tool
Locate a member IPv4 address’s normalized child-prefix index inside an explicit parent at a requested subdivision width.
- Prepare the supplied address, network, parentPrefix, childPrefix fields for this operation.
- Compare the complete example with the representation used by your own input before carrying the result into another step.
How to use the tool and how it works
- Enter address, network, parentPrefix, childPrefix. Use the exact text syntax, units and index conventions explained below.
- Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
- Read result.index, result.address, result.prefix. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Normalize network at parentPrefix, validate childPrefix and require address inside the parent. Divide its parent-relative offset by child size to return a decimal-text index and normalized child address/prefix.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| address | Address text for the family named by this tool. Prefix lengths are separate fields where shown. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| network | Address text for the family named by this tool. Prefix lengths are separate fields where shown. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| parentPrefix | parent prefix. | Safe integer |
| childPrefix | child prefix. | Integer from parentPrefix to 32 inclusive |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.index | The index value under the stated formula or text convention. |
| result.address | The address value under the stated formula or text convention. |
| result.prefix | The prefix value under the stated formula or text convention. |
{
"input": {
"address": "10.0.0.130",
"network": "10.0.0.0",
"parentPrefix": 24,
"childPrefix": 26
},
"output": {
"result": {
"index": "2",
"address": "10.0.0.128",
"prefix": 26
}
}
}Limitations and assumptions
- The input address need not already be a child network boundary. No address assignment or host availability is established.
- IPv4 input uses strict dotted-decimal octets without leading zeros or surrounding whitespace. IPv6 accepts its supported compressed or full spellings and trims surrounding whitespace, but rejects zone identifiers; embedded dotted IPv4 uses the strict IPv4 spelling. IPv6 address outputs are fully expanded unless stated otherwise.
- All declared input fields are required and unexpected top-level fields are rejected. Numbers must be finite; lists are limited to 128 entries and ordinary text fields to 8,192 UTF-16 code units, with tighter limits where stated.
- JSON text inputs must parse within bounded nesting and size limits. Numeric outputs outside the safe finite range are rejected; large exact integer results use decimal strings. Indexes and half-open spans are zero-based unless a rank is explicitly described as one-based.
Alternative or Complementary methods
Use address-set arithmetic for prefix planning and a routing or interface inspection for deployed configuration. Membership and overlap do not establish reachability, ownership or route preference.
References
Similar or alternative tools
- IPv4 Prefix Subdivision at Index
Return one normalized IPv4 child prefix at an exact zero-based subdivision index without enumerating the full subdivision.
- IPv4 Address Pair Common Prefix
Find the exact common leading-bit prefix of two IPv4 addresses; identical addresses yield a /32 ancestor.