{"push_id":871839565,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"22c97246cfe00f12df437fc21d9674255b36fd8f","before":"c082107253e36bede737f68d0a7e4ef7b52774ae","commits":[{"sha":"c492d50b28eccc84c377629aa1fdf720c06c6d80","author":{"email":"06fa905d7f2aaced6dc72e9511c71a2a51e8aead@stephens-mbp.home","name":"Stephen Roberts"},"message":"Updated comments after refactor of prime calculator","distinct":true,"url":"https://api.github.com/repos/stephenrobertsuk/primes-example/commits/c492d50b28eccc84c377629aa1fdf720c06c6d80"},{"sha":"22c97246cfe00f12df437fc21d9674255b36fd8f","author":{"email":"06fa905d7f2aaced6dc72e9511c71a2a51e8aead@stephens-mbp.home","name":"Stephen Roberts"},"message":"Reduced the search space for primes as larger numbers would also be divisible by those less than sqrt(n) (would already have found larger divisors in seraching below sqrt(n))","distinct":true,"url":"https://api.github.com/repos/stephenrobertsuk/primes-example/commits/22c97246cfe00f12df437fc21d9674255b36fd8f"}]}