ABSTRACT. We announce proofs of Macdonald's constant term conjectures for the affine root systems S(F 4 ) and S(F 4 ) U . We also give an algorithm for deciding the conjectures for the remaining root systems S(E 6 ), S(E 7 ), and S(E % ) and prove that the constant term in question can indeed be expressed in closed form. Combined with previous work of ZeilbergerBressoud, Kadell, and Gustafson, our results imply that Macdonald's conjectures are true in form for any root system, and the complete truth of Macdonald's conjectures is a finite number of mips away.