On Aug 27, 9:41 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> > AFAIK, the key requirement for a hash function is that equivalent (in
> > the sense of "==") objects must have the same hash.
>
> Just for the record, we break that all over the place. However, we do
> try to keep it if possible over a given base ring to some extent, maybe.
Ok, if it is already broken then i vote for "fast", too.
> > And how should one pass the argument "consistent=True" in that
> > situation?
>
> What was malb's original definition of inconsistent? Did he *really*
> have pairs of GF(2) matrices that are equal, but have different hashes?
I understood he only has pairs of matrices over *different* rings that
are equivalent but have different hashes.
His hash function depends on the characteristic of the base ring, the
matrix entries, the matrix dimension, and also on the size of
`unsigned long`.
Cheers
Simon
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
