Timeline for Generate collision resistant identifiers with two-way hashing
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 8, 2016 at 14:36 | comment | added | Erwan Aaron | It's a conjecture that I have clearly labeled as such, when I ask about input this is a, perhaps convoluted, way to ask whether this sounds like a reasonable assertion or not | |
| Nov 8, 2016 at 12:00 | comment | added | Gilles 'SO- stop being evil' | What is your question? Is “For any given input bitstring, we will have a unique identifier and no collisions” a conjecture that you would like us to prove or disprove? | |
| Nov 8, 2016 at 5:14 | history | edited | Erwan Aaron |
Fix moderation power tripping
|
|
| Nov 8, 2016 at 5:07 | vote | accept | Erwan Aaron | ||
| Nov 8, 2016 at 0:02 | comment | added | Raphael | What is your question? This platform does not serve well as discussion board; you'd be better served by getting people in front of a whiteboard. | |
| Nov 8, 2016 at 0:00 | history | edited | Raphael |
edited tags
|
|
| Nov 7, 2016 at 20:44 | answer | added | Yuval Filmus | timeline score: 2 | |
| Nov 7, 2016 at 20:21 | history | edited | Erwan Aaron |
edited tags
|
|
| Nov 7, 2016 at 20:12 | history | asked | Erwan Aaron | CC BY-SA 3.0 |