<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN" "http://www.w3.org/TR/REC-html40/loose.dtd">
<html><body>
<span id="mailbox-conversation"></span><br><br><span class="none"><div id="orc-email-signature" style="display: block;">
<span style="-webkit-tap-highlight-color: transparent;">On Monday, Sep 29, 2014 at 4:35 PM, Daniel Kahn Gillmor <</span><a href="mailto:dkg@fifthhorseman.net" target="_blank" style="-webkit-tap-highlight-color: transparent;">dkg@fifthhorseman.net</a><span style="-webkit-tap-highlight-color: transparent;">>, wrote:</span>
</div>
<blockquote class="gmail_quote"><p>On 09/29/2014 04:24 PM, Feng Hao wrote:<br>> It is a bit odd though to compare the identity and the message, as they are two different types of data.<br><br>I think the proposal was to compare two (id,msg) structs with each<br>other, not to compare the identity with the message.<br></p></blockquote>
<span class="mailbox-inline-edit">(Agreed; just to amplify.)</span><div><span class="mailbox-inline-edit"></span></div>
<span class="mailbox-inline-edit"></span><div>
<span class="mailbox-inline-edit"></span><span class="mailbox-inline-edit">Perhaps what Mike was getting at with the minmax formulation is that a usual precondition is that id0 != id1, and thus the identities suffice to establish an unambiguous ordering. (Some otherwise useful(?) deterministic schemes might permit universal impersonation if this precondition isn't respected; xor^2 and such.)</span><div><br></div>
</div></span>
</body></html>