Random EUI-64 Address Pair Set Generator
Build a bounded reproducible eui-64 address pair set from explicitly supplied candidate scenarios. Every candidate must satisfy imported network/eui64-link-local before selection; answer cards preserve its units, conventions, domain limitations and signed/unknown results. Draws are uniform over caller candidate positions; no replacement means no repeated positions, not necessarily distinct answers. No automatic pedagogical correctness, compliance or physical readiness.
Description
Modified EUI-64 can derive an IPv6 interface identifier from a 48-bit MAC address.
Modified EUI-64 can derive an IPv6 interface identifier from a 48-bit MAC address.1
These exercises insert FF:FE, flip the universal/local bit, and show the resulting link-local address as an arithmetic fixture.
When to use Random EUI-64 Address Pair Set Generator
Use this tool when you need to assemble reproducible practice cards from a supplied, validated scenario corpus. Prepare a reproducible seed and the inventory, corpus, or experiment parameters stated below.
How to use Random EUI-64 Address Pair Set Generator and understand its results
- Prepare a reproducible seed and the inventory, corpus, or experiment parameters stated below.
- Enter seed, count, withoutReplacement, candidateInputsJson, following the field table and calculation rules below, then run the tool.
- Read result. For result objects, inspect the nested output fields below, including any missing evidence or selected indices.
- Correct any input issues and run again. Before using a successful result, review its units, signs, evidence coverage, and stated model or reference assumptions.
| Input field | Meaning | Value type | Requirement |
|---|---|---|---|
| seed | Required nonblank deterministic seed; the SDK can replace the source with context.random. | string | Required |
| count | Number of draws, cards, trials, or output entries under the tool-specific rule; safe integer 1–64 with any narrower inventory bound. | number | Required |
| withoutReplacement | True removes selected inventory positions; false permits repeated positions. Equal rendered values or answers can still occur. | boolean | Required |
| candidateInputsJson | Dense list of JSON objects serialized as strings for the imported calculator; every candidate must be valid. | list of string | Required |
Enter 1–128 dense candidateInputsJson strings, each a strict JSON object for the imported calculator. Each string is at most 8192 UTF-16 units, the corpus at most 131072, and nesting at most 16 levels; nonfinite numbers and prototype-control keys are rejected. Select candidate positions under the sampling rules, then validate every candidate, including undrawn ones, by invoking the imported calculator with a fixed random source of 0.5. Any invalid candidate fails the whole request. Invoke it again for selected candidates with the request’s advancing source, and return original inputs, actual answer objects, selected indices, and never-selected indices. Duplicate candidate texts or equal answers may occur at distinct positions.2, 3, 4
Use a nonblank seed of at most 256 UTF-16 units and a safe-integer count from 1 to 64, subject to the tool’s narrower inventory bound. By default the seed is hashed into a deterministic pseudorandom state; each run restarts that state, so identical full inputs and implementation reproduce the result. The SDK may provide context.random, which replaces the seeded source and advances across the request; the seed remains required. Every source value must be finite in [0,1), with a request limit of 100000 source calls. Draw an index as floor(U×remainingSize). For indexed inventory draws, with replacement draw from the full inventory each time; without replacement remove each chosen position from an ordered pool and reject counts exceeding the inventory size. Uniform-source draws are over positions, not necessarily distinct values. This is not secure randomness.
The imported builder removes colons and hyphens, requires twelve hexadecimal digits, flips bit two of the first byte, inserts FF:FE between the first and last three bytes, and formats four lowercase hexadecimal words after fe80::. It does not assign an address to an interface or check duplicate addresses.
interfaceBytes=[mac0 XOR2,mac1,mac2,255,254,mac3,mac4,mac5] Read these symbols with the field meanings and branch or reference rules above.
| Output field | Meaning | Value type |
|---|---|---|
| result | Composite output; read its nested fields and the worked example. | object |
| result.baseToolId | Canonical identifier of the imported answer calculator. | string |
| result.selectedCandidateIndices | Zero-based positions in the original candidate corpus, in draw order. | list |
| result.unusedCandidateIndices | Original candidate positions never selected during this request. | list |
| result.exercises | Selected supplied input objects paired with their actual imported answer objects and any stated additional outputs. | list |
Each result.exercises entry preserves its supplied input and imported answer object. Additional roundTripAnswer, secondaryAnswer, prompts, or derived quantities appear only where the mechanics above describe them. selectedCandidateIndices and unusedCandidateIndices refer to the original corpus positions, not answer values.
{
"input": {
"seed": "tool.io/batch42",
"count": 1,
"withoutReplacement": true,
"candidateInputsJson": [
"{\"macAddress\": \"00:1A:2B:3C:4D:5E\"}"
]
},
"output": {
"result": {
"baseToolId": "network/eui64-link-local",
"selectedCandidateIndices": [
0
],
"unusedCandidateIndices": [],
"exercises": [
{
"input": {
"macAddress": "00:1A:2B:3C:4D:5E"
},
"answer": {
"address": "fe80::21a:2bff:fe3c:4d5e"
}
}
]
}
}
}Limitations and assumptions
The default source is deterministic pseudorandomness, not an independently audited or secure draw. Replacement applies to inventory positions; distinct positions may render identically or yield equal answers. A fixture does not independently verify the supplied answers or reference content. Each answer retains the imported calculator’s unit conventions and domain assumptions. Randomizing a supplied scenario does not broaden that calculator’s capabilities.
Missing required fields, unknown fields, wrong types, and violated calculation rules return input issues. Numeric values must be finite; nonfinite numeric outputs are rejected. Arrays must be dense, with no missing cells. Extremely large composite outputs are rejected.
Alternative or Complementary methods
For a related task, use Random Intel HEX Record Test Case Generator: An Intel HEX record stores a byte count, address, record type, payload, and checksum in one text line. These fixtures sample supplied record scenarios and return both the generated line and the actual decoder result. For a complementary step, use Random AD C Conversion Dataset Generator: An ideal ADC code-to-voltage mapping depends on resolution and reference voltage. These datasets use endpoint scaling by the maximum code, so the top code maps exactly to the reference voltage.
References
Similar or alternative tools
- Random Intel HEX Record Test Case Generator
An Intel HEX record stores a byte count, address, record type, payload, and checksum in one text line. These fixtures sample supplied record scenarios and return both the generated line and the actual decoder result.
- Random AD C Conversion Dataset Generator
An ideal ADC code-to-voltage mapping depends on resolution and reference voltage. These datasets use endpoint scaling by the maximum code, so the top code maps exactly to the reference voltage.