Description
Choose one uniform bit position and toggle it, returning exact Hamming-distance-one neighbor text.
A random construction is defined by its sampling support: positions, permutations, complete tilings, proposal sequences or another explicit set. Uniform choices at one stage do not necessarily make final visible outcomes uniform. A replay seed gives a deterministic sequence; equal values can hide different sampled positions. These tools are for reproducible synthetic examples rather than cryptographic entropy.
Choose one uniform bit position and toggle it, returning exact Hamming-distance-one neighbor text.
When to use this tool
Use this tool to choose one uniform bit position and toggle it, returning exact Hamming-distance-one neighbor text.
How to use the tool and how it works
- Enter bits, seed using the definitions below.
- Run the operation. Resolve input-format errors before interpreting an output.
- Read result.seed, result.index, result.bits, using the stated boundary, ordering, sign and absence conventions.
Validate a nonempty 0/1 string of at most 128 positions. Draw one position uniformly, flip only that bit and return the index and resulting string.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| bits | Nonempty 0/1 string of at most 128 left-to-right positions. | Text, at most 8,192 UTF-16 code units; narrower grammar/range rules also apply. |
| seed | Nonblank replay seed, at most 256 UTF-16 code units; an injected source overrides seeded draws. | Text, at most 8,192 UTF-16 code units; narrower grammar/range rules also apply. |
| Output field | Interpretation |
|---|---|
| result | Object containing the fields below. |
| result.seed | Original supplied seed string; injected-source replay additionally requires that source’s state. |
| result.index | Zero-based selected source position. |
| result.bits | Binary text after exactly the stated bit flips. |
{
"input": {
"bits": "1010",
"seed": "batch56"
},
"output": {
"result": {
"seed": "batch56",
"index": 2,
"bits": "1000"
}
}
}Limitations and assumptions
- The result has Hamming distance exactly one from the input, without a channel-error or cryptographic randomness model.
- A nonblank seed of at most 256 UTF-16 code units is required. With ordinary use the seed initializes one deterministic advancing source; an application-injected random source takes precedence and the seed alone then cannot replay the result. Uniformity statements assume independent uniform source draws in [0,1). Source calls are bounded and degenerate injected sources can fail a rejection budget. This is not cryptographically secure.
- Every declared outer field is required and unknown outer fields are rejected. Strings and JSON text have size limits, lists are bounded to 128 entries, and JSON nesting/node counts are bounded. Tighter operation-specific bounds stated above take precedence.
- Ordinary numeric outputs must be finite and within safe-integer magnitude. Exact large lengths/counts use decimal strings. Original record indexes and code-unit positions are zero-based; span ends are exclusive unless stated otherwise.
Alternative or Complementary methods
Choose a generator whose support matches the intended experiment and retain source-position provenance. Use a separate statistically justified process model or cryptographic source where those properties matter.
References
Similar or alternative tools
- Random Contiguous Bit Burst Mask
Choose one uniform nonwrapping contiguous positive bit burst start; the mask is left-to-right text, not an encoded integer.
- Random Exact Hamming Neighbor
Choose a uniform exact-cardinality bit subset and toggle it to produce an exact-Hamming-distance neighbor; zero-distance is permitted and consumes no draws.