We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
why use the BigEndian and the LittleEndian of the fingerprint to gernerate the both index, rather than the way described in CMU paper?
Your way: func genFirstIndex(sign Signature, numBuckets uint) uint { bytes := make([]byte, 64, 64) for i, b := range sign { bytes[i] = b } hash := binary.LittleEndian.Uint64(bytes) return uint(hash) & (numBuckets - 1) }
func genBackupIndex(sign Signature, numBuckets uint) uint { bytes := make([]byte, 64, 64) for i, b := range sign { bytes[i] = b } hash := binary.BigEndian.Uint64(bytes) return uint(hash) & (numBuckets - 1) }
Paper's way:
The text was updated successfully, but these errors were encountered:
No branches or pull requests
why use the BigEndian and the LittleEndian of the fingerprint to gernerate the both index, rather than the way described in CMU paper?
Your way:
func genFirstIndex(sign Signature, numBuckets uint) uint {
bytes := make([]byte, 64, 64)
for i, b := range sign {
bytes[i] = b
}
hash := binary.LittleEndian.Uint64(bytes)
return uint(hash) & (numBuckets - 1)
}
func genBackupIndex(sign Signature, numBuckets uint) uint {
bytes := make([]byte, 64, 64)
for i, b := range sign {
bytes[i] = b
}
hash := binary.BigEndian.Uint64(bytes)
return uint(hash) & (numBuckets - 1)
}
Paper's way:
![1](https://user-images.githubusercontent.com/25728691/39692582-d7c5483e-5213-11e8-88b1-b194e88f2754.PNG)
The text was updated successfully, but these errors were encountered: