Unspendable keys in descriptors

The discussion centers around a technical challenge associated with the use of left-to-right ordering in programming, specifically in the context of key arrangement. The problem arises when implementing sortedmulti_a, a descriptor that is sensitive to the sequence in which keys are added. Ideally, a descriptor like sortedmulti_a(k,KEY_1,KEY_2,..,KEY_N) should be functionally equivalent to one where the keys are arranged in reverse order, such as sortedmulti_a(k,KEY_N,KEY_N-1,..,KEY_1). However, under the current approach, altering the order of keys leads to the generation of different chaincodes. This issue highlights a significant concern regarding the consistency and predictability of outputs in systems relying on key ordering, necessitating a review or modification of the method to ensure that the order in which keys are introduced does not impact the resulting chaincode.