Resolve array diffing issues by replacing the diffing algorithm

[lscheibel]

Currently differences between arrays are not calculated ideally. For example currently for an array [2, 3] and a new state [1, 2, 3]

[{ op: 'upd', path: 0, val: 1 }, { op: 'upd', path: 1, val: 2 }, { op: 'add', path: 2, val: 3 }]

is returned while the following would be sufficient:

[{ op: 'add', path: 0, val: 1 }]

Unfortunately this appears to be a non-trivial problem, involving the longest common subsequence problem, however other diffing algorithms already exist, which handle this better than "recursive-diff".