The code for checking if a proleptic year is a leap year can be improved by using a quicker test for divisibility by 16 rather than % 400.

The suggested improvement was inspired by the talk "Implementing Fast Calendar Algorithms" by Cassio Neri: https://www.youtube.com/watch?v=0s9F4QWAl-E