Timeline for How would one hash two different pubkeys inside an Anchor program?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 21, 2022 at 20:19 | comment | added | AllBlooming | I agree, @trent.sol. Sorting is definitely the better idea compared to XORing. However, I still stand by my original statement that the risk of a collision is still negligible. The chance of (a^b) == (a1^b1), with (a1 != a ) || (b1 != b), for single bits (i.e. 0 or 1), is exactly 50%. So the risk of rendering the exact same 256 xored bits for 2 Pubkey's 1/(2^256), considered negligible everywhere on Solana. However, it's still an additional risk that can be avoided by sorting instead of xoring. | |
| Jul 21, 2022 at 18:33 | comment | added | trent.sol | generating the private key for a chosen public key is not the problem here though. generating two public keys which XOR to a chosen value is. this is quite easy in comparison | |
| Jul 21, 2022 at 17:52 | comment | added | Whiteseal | This should work with minimal risk of collision because it is extremely difficult to generate a public key of your choice @trent.sol | |
| Jul 20, 2022 at 20:24 | comment | added | trent.sol | finding collisions on XORed hashes is much easier than the hashes themselves. ref | |
| Jul 20, 2022 at 17:04 | history | answered | AllBlooming | CC BY-SA 4.0 |