This PR sorts each ECC when loading the ECC set. If we don't do this, when 2 ECCs are merged together in the Python verifier, there is no guarantee that the ECC with the lexicographically smaller representative will appear first, so the new representative might be not maintained to still be the smallest one in the ECC. Simply sorting the ECC will solve this problem.
This PR sorts each ECC when loading the ECC set. If we don't do this, when 2 ECCs are merged together in the Python verifier, there is no guarantee that the ECC with the lexicographically smaller representative will appear first, so the new representative might be not maintained to still be the smallest one in the ECC. Simply sorting the ECC will solve this problem.