I am trying to learn ($\mathbb{P}^1$-)stable motivic ($\mathbb{A}^1$-)homotopy theory of schemes from the Cisinski-Deglise book, Triangulated Categories of Mixed Motives. In order to keep myself going during its long abstract development as well as to help see parallels with the topological stable homotopy theory I'd like to know in advance some of the concrete computational results and goals the theory is reaching for.
For example, in the topological setting calculating the stable homotopy groups of spheres has been a long-running motivating theme. Are there similar computational goals animating the development in the algebraic-geometric context (as opposed to those concerned with having a satisfactory theory with certain features, e.g., the six-functor formalism, spectra for cohomology theories etc. which are wonderfully explained in the preface to the book?) I'm specially interested in those that are of arithmetical nature.