{"action":"created","issue":{"url":"https://api.github.com/repos/RovoMe/JDrum/issues/1","repository_url":"https://api.github.com/repos/RovoMe/JDrum","labels_url":"https://api.github.com/repos/RovoMe/JDrum/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/RovoMe/JDrum/issues/1/comments","events_url":"https://api.github.com/repos/RovoMe/JDrum/issues/1/events","html_url":"https://github.com/RovoMe/JDrum/issues/1","id":186056110,"number":1,"title":"64 bit key is not enough","user":{"login":"ValleZ","id":905759,"avatar_url":"https://avatars.githubusercontent.com/u/905759?v=3","gravatar_id":"","url":"https://api.github.com/users/ValleZ","html_url":"https://github.com/ValleZ","followers_url":"https://api.github.com/users/ValleZ/followers","following_url":"https://api.github.com/users/ValleZ/following{/other_user}","gists_url":"https://api.github.com/users/ValleZ/gists{/gist_id}","starred_url":"https://api.github.com/users/ValleZ/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ValleZ/subscriptions","organizations_url":"https://api.github.com/users/ValleZ/orgs","repos_url":"https://api.github.com/users/ValleZ/repos","events_url":"https://api.github.com/users/ValleZ/events{/privacy}","received_events_url":"https://api.github.com/users/ValleZ/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":1,"created_at":"2016-10-29T03:13:45Z","updated_at":"2016-10-29T18:19:11Z","closed_at":"2016-10-29T18:19:11Z","body":"Original algorithm uses 80 bit. When you deal with data what can hash into 64 bit with almost no collisions you probably should store all the data in RAM."},"comment":{"url":"https://api.github.com/repos/RovoMe/JDrum/issues/comments/257107259","html_url":"https://github.com/RovoMe/JDrum/issues/1#issuecomment-257107259","issue_url":"https://api.github.com/repos/RovoMe/JDrum/issues/1","id":257107259,"user":{"login":"ValleZ","id":905759,"avatar_url":"https://avatars.githubusercontent.com/u/905759?v=3","gravatar_id":"","url":"https://api.github.com/users/ValleZ","html_url":"https://github.com/ValleZ","followers_url":"https://api.github.com/users/ValleZ/followers","following_url":"https://api.github.com/users/ValleZ/following{/other_user}","gists_url":"https://api.github.com/users/ValleZ/gists{/gist_id}","starred_url":"https://api.github.com/users/ValleZ/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ValleZ/subscriptions","organizations_url":"https://api.github.com/users/ValleZ/orgs","repos_url":"https://api.github.com/users/ValleZ/repos","events_url":"https://api.github.com/users/ValleZ/events{/privacy}","received_events_url":"https://api.github.com/users/ValleZ/received_events","type":"User","site_admin":false},"created_at":"2016-10-29T18:19:10Z","updated_at":"2016-10-29T18:19:10Z","body":"Seems I was about different algorithm, I've rechecked original paper and it's indeed 8 bytes, sorry about that. Taking into account birthday paradox 64 bits it feels not enough to avoid collisions when you have millions of data entries."}}
{"actor":{"display_login":"ValleZ"}}