For the first part of GSOC I be implemented Wells' Algorithm. This can be found in Elliot Wells' paper Computing the Canonical Height of a Point in Projective Space. This algorithm gives us another way of measuring the canonical height of a mapping. However, Wells' Algorithm (WA) doesn't require you to factor the resultant. Calculating a the resultant is easy, but factoring the resultant can be hard, as factoring is hard. No this may sound odd, as we know every integer has unique prime GSOC- Implementing Wells' Algorithm Rebecca Miller 06/01/2017

For the first part of GSOC I be implemented Wells' Algorithm. This can be found in Elliot Wells' paper Computing the Canonical Height of a Point in Projective Space. This algorithm gives us another way of measuring the canonical height of a mapping. However, Wells' Algorithm (WA) doesn't require you to factor the resultant. Calculating a the resultant is easy, but factoring the resultant can be hard, as factoring is hard. No this may sound odd, as we know every integer has unique prime