Recently I posted a question about Diffy games which has gone unanswered. Thats fine, the question is really hard, but I would like to make an easier question about Diffy games so that we can get the ball rolling.
How Diffy works
Copied from Find Diffy Games
The Diffy game works like as follows: You start with a list of non-negative integers, in this example we will use
3 4 5 8
Then you take the absolute difference between adjacent numbers
(8) 3 4 5 8 5 1 1 3
Then you repeat. You repeat until you realize you have entered a loop. And then generally the game starts from the beginning again.
3 4 5 8 5 1 1 3 2 4 0 2 0 2 4 2 2 2 2 2 0 0 0 0 0 0 0 0
Most games end in a string of all zeros, which is considered to be a lose state, but a rare few games get stuck in larger loops.
Given the starting state of a Diffy game determine whether or not the game eventually reaches a state of all zeros. You should output a Truthy or Falsy value for each of the two states. Which corresponds to which does not matter.
The goal is to minimize the number of bytes in your source.