Enigma Plugboard Pairing Count Check
Audit explicit Enigma plugboard involution pairing/disjointness, accept0–13 pairs, no historical10-pair default or total Enigma keyspace claim.
Description
An Enigma plugboard pairs letters without sharing a letter between pairs.
An Enigma plugboard pairs letters without sharing a letter between pairs.1
Checking that wiring does not simulate rotor settings or impose one historically universal pair count. Use Enigma Plugboard Pairing Count Check to evaluate the supplied inputs under the specific model below.
When to use Enigma Plugboard Pairing Count Check
Use Enigma Plugboard Pairing Count Check to evaluate the supplied inputs under the specific model below. Choose the intended encoding, alphabet or check and keep the exact character, key and measurement conventions described below.
How to use Enigma Plugboard Pairing Count Check and understand its results
- Choose the intended encoding, alphabet or check and keep the exact character, key and measurement conventions described below.
- Enter Plugboard pairs using the field table and validation rules below, then run the tool.
- Read Used letters, Unpaired letters, Pair count and interpret units, signs, ordering and placeholders as explained below.
- If the tool reports an input error, correct that field and rerun. A successful false result, empty match list or unknown-evidence placeholder has the specific meaning described here; check the limitations before applying the result.
| Input field | Meaning | Value type | Requirement |
|---|---|---|---|
| plugboardPairs | Plugboard pairs | array of string | Required; constraints below |
Enter at most 13 plugboard pairs, each exactly two distinct uppercase A–Z letters, with no letter repeated across pairs. Return paired letters in sorted order, unused letters in alphabetical order and pair count. Empty pairs are allowed and do not imply an error. This is a wiring inventory rather than an Enigma simulation or a historically restricted ten-pair setup.
pairCount = number of pairs; pairedLetters = sorted unique pair letters; unused = A–Z minus paired Field order, units and branch conditions follow the implementation explanation above.
| Output field | Meaning | Value type |
|---|---|---|
| usedLetters | Used letters | string |
| unpairedLetters | Unpaired letters | string |
| pairCount | Pair count | number |
{
"input": {
"plugboardPairs": [
"AB",
"CD"
]
},
"output": {
"usedLetters": "ABCD",
"unpairedLetters": "EFGHIJKLMNOPQRSTUVWXYZ",
"pairCount": 2
}
}Limitations and assumptions
Checking that wiring does not simulate rotor settings or impose one historically universal pair count. Apply the exact scope and assumptions described above.
All listed fields require explicit values. Unexpected fields, incorrect types, nonfinite numbers and sparse arrays fail validation. Domain-specific bounds, alignments and supported tokens are stated above; extremely large inputs or outputs can also be rejected. These errors differ from successful results such as false, no matches or unknown evidence.
Alternative or Complementary methods
Use API Key Prefix Separability Check for a related task: Prefix-based dispatch becomes ambiguous when one registered prefix begins with another.
Use Cardan Grille Hole Pattern Check for a related task: A rotating Cardan grille should cover every cell exactly once across four orientations.
References
-
Enigma Plugboard Pairing Count Check — tool.io
Similar or alternative tools
- API Key Prefix Separability Check
Prefix-based dispatch becomes ambiguous when one registered prefix begins with another.
- Cardan Grille Hole Pattern Check
A rotating Cardan grille should cover every cell exactly once across four orientations.