Byte Frame Sequence Gap Table
Audit modular frame sequence transitions under an explicit forward-order assumption; duplicates retain unknown missing count and reordering cannot be inferred from residues alone.
Description
Audit modular frame sequence transitions under an explicit forward-order assumption; duplicates retain unknown missing count and reordering cannot be inferred from residues alone.
Wrapping sequence numbers need an explicit modulus. A forward modular difference can suggest gaps under a declared forward-order assumption.
When to use this tool
Audit modular frame sequence transitions under an explicit forward-order assumption; duplicates retain unknown missing count and reordering cannot be inferred from residues alone.
- Prepare the supplied sequence, modulus 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 sequence, modulus. 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.transitions. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Require modulus from 2 to one billion and sequence values within it. For each adjacent pair compute nonnegative modular difference, mark zero as duplicate and otherwise report missing = forward minus one; duplicates have null missing.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| sequence | sequence. | List of finite numbers; at most 128 entries |
| modulus | modulus. | Integer from 2 to 1e9 inclusive |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.transitions | The transitions list in the ordering and representation described above. |
{
"input": {
"sequence": [
7,
0,
2,
2
],
"modulus": 8
},
"output": {
"result": {
"transitions": [
{
"fromIndex": 0,
"toIndex": 1,
"forward": 1,
"missing": 0,
"duplicate": false
},
{
"fromIndex": 1,
"toIndex": 2,
"forward": 2,
"missing": 1,
"duplicate": false
},
{
"fromIndex": 2,
"toIndex": 3,
"forward": 0,
"missing": null,
"duplicate": true
}
]
}
}
}Limitations and assumptions
- Reordering, replay and loss cannot be distinguished by this arithmetic. A large forward difference may represent a backward or out-of-order observation.
- 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 a stateful protocol parser when processing partial streams or validating complete packets. Retain the declared prefix width, byte order and payload-versus-frame boundary convention when composing these operations.
References
Similar or alternative tools
- Byte Frame Chunk Carry Tool
Advance one fixed-byte streaming frame chunk with explicit incomplete carry, emitting complete frames and retaining the new tail; no sync search.
- Byte Frame Chunk Rejoin Tool
Rejoin explicit bounded byte chunks and report each chunk’s half-open source span, preserving empty-chunk provenance.