{"push_id":1145563982,"size":4,"distinct_size":4,"ref":"refs/heads/master","head":"341fbc166e22f383ed7c01fc496849ebaea3d203","before":"7f6ef8c26844e443af26e84c49f9a5887a7651b1","commits":[{"sha":"50ac5ad4be28b7d4f8cf550c7ea511e545104d01","author":{"name":"Dana Jacobsen","email":"abac5ffa4eeed9d9d451b708731e8067299bc4be@acm.org"},"message":"hybrid method has more theorems to use","distinct":true,"url":"https://api.github.com/repos/danaj/Math-Prime-Util-GMP/commits/50ac5ad4be28b7d4f8cf550c7ea511e545104d01"},{"sha":"141500bf740751190789fb9b1ba685a0a8d0495f","author":{"name":"Dana Jacobsen","email":"abac5ffa4eeed9d9d451b708731e8067299bc4be@acm.org"},"message":"Add n+1 and bls75 combined proofs to API","distinct":true,"url":"https://api.github.com/repos/danaj/Math-Prime-Util-GMP/commits/141500bf740751190789fb9b1ba685a0a8d0495f"},{"sha":"7ada890befa92d53b8123a603b04b2c54695a00b","author":{"name":"Dana Jacobsen","email":"abac5ffa4eeed9d9d451b708731e8067299bc4be@acm.org"},"message":"Allow sieving to 62-bit with 32-bit GMP","distinct":true,"url":"https://api.github.com/repos/danaj/Math-Prime-Util-GMP/commits/7ada890befa92d53b8123a603b04b2c54695a00b"},{"sha":"341fbc166e22f383ed7c01fc496849ebaea3d203","author":{"name":"Dana Jacobsen","email":"abac5ffa4eeed9d9d451b708731e8067299bc4be@acm.org"},"message":"Bump version","distinct":true,"url":"https://api.github.com/repos/danaj/Math-Prime-Util-GMP/commits/341fbc166e22f383ed7c01fc496849ebaea3d203"}]}
{"actor":{"display_login":"danaj"}}