{"push_id":1294183743,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"550b135b80baadb6f5be959463a98545e178ef46","before":"9822f26bec899f6013bc75b380115f236f1de7c9","commits":[{"sha":"550b135b80baadb6f5be959463a98545e178ef46","author":{"name":"Ondrej Mosnáček","email":"1fb60dd35c4c6adfbf7c3aa849c0415fc5804ad8@gmail.com"},"message":"Avoid the need to allocate memory for addresses\n\nIn the old code, the fill_segment function always dynamically allocated memory for the pseudo-random addresses used in Argon2i. However, the addresses can be easily computed on-the-fly, thus avoiding the need for dynamic allocation.\n\nAnother serious issue with the old code is that if the allocation failed, the fill_segment function would just silently return and do nothing. (WTF?!)\n\nThis commit refactors the code to compute the addresses on-the-fly instead of pre-computing them and also slightly simplifies the way they are computed.","distinct":true,"url":"https://api.github.com/repos/WOnder93/phc-winner-argon2/commits/550b135b80baadb6f5be959463a98545e178ef46"}]}
{"actor":{"display_login":"WOnder93"}}