I wouldn't call it karpathys loop I'd call it slop descent. Or descent into slop. Or something like that
This is in fact less random than how generic algorithms used to work traditionally which encoded behaviors in some data structure that then got randomly mutated or crossed with other candidates in the pool.