Random Pair Generator
Pair entries within one list or across two lists and report every unmatched row.
Enabling local controls…
Results
Review the settings and run. Editing inputs clears old results.
Processing model and limits
List A is required; a blank List B pairs within A. Otherwise each pair contains one row from A and one from B. Every row is used at most once; all leftovers are listed. Trims entries and skips blank rows. Duplicate names remain separate entries identified by list and original row. Each list: 32 KiB UTF-8, 2000 physical rows; each entry: 256 UTF-8 bytes. Values: 1–2000. Result: 1 MiB JSON. Local Web Crypto rejection sampling; at most 10000 random words per run. Each run is independent.
Data and model checked: CompareTwoTexts: source controls ↗W3C Web Cryptography: getRandomValues ↗
How to use this tool
Load the example, confirm field units and processing rules, then run locally. Editing any input clears the old result. Copy or download the complete output explicitly.
When not to use it
List A is required; a blank List B pairs within A. Otherwise each pair contains one row from A and one from B. Every row is used at most once; all leftovers are listed. Trims entries and skips blank rows. Duplicate names remain separate entries identified by list and original row. Each list: 32 KiB UTF-8, 2000 physical rows; each entry: 256 UTF-8 bytes. Values: 1–2000. Result: 1 MiB JSON. Local Web Crypto rejection sampling; at most 10000 random words per run. Each run is independent.