Bit Lane Permutation Tool
Reorder bit lanes with a complete output-to-input permutation; no endian or packing assumptions.
Description
Reorder bit lanes with a complete output-to-input permutation; no endian or packing assumptions.
A bit-lane permutation reorders literal left-to-right bit positions using source indexes.
When to use this tool
Reorder bit lanes with a complete output-to-input permutation; no endian or packing assumptions.
- Prepare the supplied bits, permutation 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 bits, permutation. 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.bits. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Validate a binary string and a complete same-length index permutation. Emit the bit at each referenced source index and join the output.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| bits | bits. | Binary text containing only 0 and 1; at most 128 characters |
| permutation | permutation. | List of finite numbers; at most 128 entries |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.bits | The bits value under the stated formula or text convention. |
{
"input": {
"bits": "100",
"permutation": [
2,
0,
1
]
},
"output": {
"result": {
"bits": "010"
}
}
}Limitations and assumptions
- No numeric low-bit-first convention or automatic inverse mapping is used. Every original position must occur exactly once.
- Every declared top-level field is required and unexpected fields are rejected. Numeric inputs must be finite; ordinary text fields are bounded to 8,192 UTF-16 code units, with tighter operation-specific limits where stated.
- Lists are limited to 128 entries. JSON text must meet bounded size and depth checks, and numeric outputs beyond the safe finite magnitude are rejected. Exact large integers use decimal strings.
- Indexes are zero-based and spans have an exclusive end unless explicitly stated otherwise. A valid false, null or empty-list result is distinct from malformed input.
Alternative or Complementary methods
Retain the field-width, bit-index and byte-order conventions when combining operations. Slicing, escaping, permutation and alignment are separate transforms; none supplies a complete framing or cryptographic protocol.
References
Similar or alternative tools
- Byte Lane Permutation Tool
Reorder byte lanes with a complete output-to-input permutation; no endian or packing assumptions.
- Bit Range Byte Envelope
Find the smallest half-open byte envelope of a bit range; empty bit ranges return an empty envelope.