perf(continuations): linked list search should run in sublinear time

[Nashtare]

The current implementation of searching through the linked list is performing it naively, hence running in linear time, at the detriment of slower witness generation. This is particularly noticeable for payloads with a large number of accesses to storage or accounts.

We should have the search run in $O(\log n)$ time instead.