Fixed Sync Frame Boundary Finder
Find all overlapping occurrences of an explicit sync byte sequence; occurrences are candidate boundaries, not validated frames.
Description
Find all overlapping occurrences of an explicit sync byte sequence; occurrences are candidate boundaries, not validated frames.
A synchronization token may occur at overlapping positions in a byte stream. Reporting every literal match exposes those possibilities.
When to use this tool
Find all overlapping occurrences of an explicit sync byte sequence; occurrences are candidate boundaries, not validated frames.
- Prepare the supplied bytes, sync 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, sync. 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.positions. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Require a nonempty sync byte list. At each zero-based bytes position test the complete sync sequence and return all matching starts, including overlaps.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| bytes | bytes. | List of integers from 0 to 255; at most 128 bytes |
| sync | sync. | List of integers from 0 to 255; at most 128 bytes |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.positions | The positions list in the ordering and representation described above. |
{
"input": {
"bytes": [
1,
1,
1,
2
],
"sync": [
1,
1
]
},
"output": {
"result": {
"positions": [
0,
1
]
}
}
}Limitations and assumptions
- These are candidate synchronization positions, not validated frame boundaries. Payload coincidences and protocol length rules are not resolved.
- 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.