Improve asymptotic efficiency of nullifier checks in `scan_block`

[daira]

This currently takes $O(m \cdot n)$ time where m is the number of notes in the wallet, and n is the number of nullifiers in blocks. It should take $O(q \cdot \log q)$ time where $q = \max(m, n)$, by sorting and scanning.