Finite promise games are a family of four closely related two-player games defined by Harvey Friedman. From three of these games arise some fast-growing functions that eventually dominate all recursive functions provably total in an extension of ZFC known as SMAH, but are provably total in a stronger theory known as SMAH+.