{"action":"created","issue":{"url":"https://api.github.com/repos/lemire/StronglyUniversalStringHashing/issues/10","labels_url":"https://api.github.com/repos/lemire/StronglyUniversalStringHashing/issues/10/labels{/name}","comments_url":"https://api.github.com/repos/lemire/StronglyUniversalStringHashing/issues/10/comments","events_url":"https://api.github.com/repos/lemire/StronglyUniversalStringHashing/issues/10/events","html_url":"https://github.com/lemire/StronglyUniversalStringHashing/pull/10","id":121632441,"number":10,"title":"Iterated hashing with CLNH","user":{"login":"jbapple","id":4156460,"avatar_url":"https://avatars.githubusercontent.com/u/4156460?v=3","gravatar_id":"","url":"https://api.github.com/users/jbapple","html_url":"https://github.com/jbapple","followers_url":"https://api.github.com/users/jbapple/followers","following_url":"https://api.github.com/users/jbapple/following{/other_user}","gists_url":"https://api.github.com/users/jbapple/gists{/gist_id}","starred_url":"https://api.github.com/users/jbapple/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/jbapple/subscriptions","organizations_url":"https://api.github.com/users/jbapple/orgs","repos_url":"https://api.github.com/users/jbapple/repos","events_url":"https://api.github.com/users/jbapple/events{/privacy}","received_events_url":"https://api.github.com/users/jbapple/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":3,"created_at":"2015-12-11T03:53:59Z","updated_at":"2015-12-11T15:37:47Z","closed_at":"2015-12-11T14:27:34Z","pull_request":{"url":"https://api.github.com/repos/lemire/StronglyUniversalStringHashing/pulls/10","html_url":"https://github.com/lemire/StronglyUniversalStringHashing/pull/10","diff_url":"https://github.com/lemire/StronglyUniversalStringHashing/pull/10.diff","patch_url":"https://github.com/lemire/StronglyUniversalStringHashing/pull/10.patch"},"body":"This speed is between CLHASH and multilinear half-multiplication on my machine."},"comment":{"url":"https://api.github.com/repos/lemire/StronglyUniversalStringHashing/issues/comments/163966321","html_url":"https://github.com/lemire/StronglyUniversalStringHashing/pull/10#issuecomment-163966321","issue_url":"https://api.github.com/repos/lemire/StronglyUniversalStringHashing/issues/10","id":163966321,"user":{"login":"lemire","id":391987,"avatar_url":"https://avatars.githubusercontent.com/u/391987?v=3","gravatar_id":"","url":"https://api.github.com/users/lemire","html_url":"https://github.com/lemire","followers_url":"https://api.github.com/users/lemire/followers","following_url":"https://api.github.com/users/lemire/following{/other_user}","gists_url":"https://api.github.com/users/lemire/gists{/gist_id}","starred_url":"https://api.github.com/users/lemire/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/lemire/subscriptions","organizations_url":"https://api.github.com/users/lemire/orgs","repos_url":"https://api.github.com/users/lemire/repos","events_url":"https://api.github.com/users/lemire/events{/privacy}","received_events_url":"https://api.github.com/users/lemire/received_events","type":"User","site_admin":false},"created_at":"2015-12-11T15:37:47Z","updated_at":"2015-12-11T15:37:47Z","body":"@jbapple \r\n\r\nThat's not bad.\r\n\r\nI understand what big-endian universality is... but what is the motivation? A shift is typically more expensive than a mask... so why would you want to extract the most significant bits instead of the least significant bits?"}}