IPv6 Prefix Relation Classifier
Classify exact normalized IPv6 prefix set relationships without expanding addresses or inferring routing policy.
Description
Classify exact normalized IPv6 prefix set relationships without expanding addresses or inferring routing policy.
IPv6 prefixes describe aligned sets even when the input address has host bits set. Comparing their normalized ranges reveals their set relationship.
When to use this tool
Classify exact normalized IPv6 prefix set relationships without expanding addresses or inferring routing policy.
- Prepare the supplied left, leftPrefix, right, rightPrefix 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 left, leftPrefix, right, rightPrefix. 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.relation. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Normalize both addresses at their supplied 0-to-128 prefix lengths. Compare inclusive endpoints and return equal, contains, contained-by, disjoint or overlap.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| left | 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 |
| leftPrefix | left prefix. | Safe integer |
| right | 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 |
| rightPrefix | right prefix. | Safe integer |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.relation | The relation value under the stated formula or text convention. |
{
"input": {
"left": "::",
"leftPrefix": 126,
"right": "::2",
"rightPrefix": 127
},
"output": {
"result": {
"relation": "contains"
}
}
}Limitations and assumptions
- The classification concerns address sets only. It does not infer route preference, ownership or firewall policy.
- 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
- IPv6 Nibble Prefix Length Check
Check IPv6 prefix alignment for whole-nibble reverse-zone labels; nonaligned prefixes do not imply a simple reverse-zone delegation.
- IPv6 Prefix Address at Offset
Select one IPv6 address at an exact zero-based offset inside a normalized prefix, including every address and avoiding 128-bit floating precision loss.