Replace prefixcommons usages with curies

[cthoyt]

This PR replaces usages of prefixcommons with curies. This is the first step towards more principled management of I/O of prefix maps that has the following benefits:

1. Prefix map chaining is done using a tested and well-defined algorithm curies.chain
2. Compression uses a fast and correct Trie data structure
3. We replace the internal implementation of expansion and compression with a well-tested one

Next steps after this PR will be to replace the usage of the contract and expand functions directly using curies.Converter, which will have a massive speed gain.