Align ordered arrays without turning one insertion into a cascade of positional changes.
Each document is capped at 512 KiB; combined input is capped at 1 MiB.
The report states the algorithm, semantics, paths, counts, or conflicts used as proof.
Explicit, bounded structural semantics
A bounded longest-common-subsequence pass preserves the shared order and marks additions or removals around it. Arrays are limited to 2,000 items each because this alignment uses quadratic work.
A bounded longest-common-subsequence pass preserves the shared order and marks additions or removals around it. Arrays are limited to 2,000 items each because this alignment uses quadratic work.
Each document is capped at 512 KiB, combined input at 1 MiB, traversal at 100,000 values and 100 levels, reports at 10,000 entries, and output at 1 MiB. Source and results stay in the active browser tab.
Inputs use the browser's JSON parser. Duplicate object names therefore keep their last value, object member order is ignored, array order is preserved unless the selected tool explicitly says otherwise, and integers outside JavaScript's safe range are rejected instead of rounded silently.
