Byte Frame Delimiter Coverage Check
Compare explicit byte delimiter observations against caller-declared boundary positions, retaining both undeclared delimiters and false boundary claims.
Description
Compare explicit byte delimiter observations against caller-declared boundary positions, retaining both undeclared delimiters and false boundary claims.
A declared delimiter-position list can disagree with the actual byte stream in two directions. This audit reports omitted delimiters and false declarations separately.
When to use this tool
Compare explicit byte delimiter observations against caller-declared boundary positions, retaining both undeclared delimiters and false boundary claims.
- Prepare the supplied bytes, delimiter, declaredPositions 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 bytes, delimiter, declaredPositions. 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.undeclared, result.falseDeclarations. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Validate bytes, delimiter from 0 to 255 and unique in-range declaredPositions. Find every actual delimiter index and take the two list differences.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| bytes | bytes. | List of integers from 0 to 255; at most 128 bytes |
| delimiter | delimiter. | Integer from 0 to 255 inclusive |
| declaredPositions | declared positions. | List of finite numbers; at most 128 entries |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.undeclared | The undeclared list in the ordering and representation described above. |
| result.falseDeclarations | The false declarations list in the ordering and representation described above. |
{
"input": {
"bytes": [
0,
1,
0
],
"delimiter": 0,
"declaredPositions": [
0,
1
]
},
"output": {
"result": {
"undeclared": [
2
],
"falseDeclarations": [
1
]
}
}
}Limitations and assumptions
- No escaping rule or complete frame structure is inferred. Positions are literal byte indexes, so delimiter-like payload values still count.
- 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.