Las

It doesn't seem to solve the problem entirely unfortunately. Perhaps it needs to be a very high value to avoid it.

`PubKeyHash` uses newtype deriving. IMO, it makes sense to use newtype deriving for this in all cases where possible.

So is it possible to construct a transaction where we control the order of the entries in txInfoMint? Can we also mint a zero amount?

https://github.com/input-output-hk/cardano-ledger/blob/master/eras/shelley-ma/impl/src/Cardano/Ledger/Mary/Value.hs#L382 It very much seems like the sortedness of values is part of the guarantees.

What do you need exactly and whi can't you implement it yourself?

I don't think special-casing these two functions is a good idea.

Isn't the real issue here that `fromList :: [(k, v)] -> Map k v` doesn't drop duplicate keys? See the behavior of https://hackage.haskell.org/package/containers-0.6.5.1/docs/Data-Map-Lazy.html#v:fromList for reference. I'm not sure whether this...

s/may/should?

I think the streamly plugin does this with INLINE FWIW. See https://github.com/composewell/fusion-plugin

> I think what you are saying is that you cannot predict the ordering of the list, because it's based on the set in the real transaction. So the inputs...