Abstract
The paper surveys fundamental properties of Laver tables from an algebraic and combinatorial standpoint. Basic facts come with full proofs.
Advanced facts are restricted to a discussion of the conjectured series of homomorphisms that might provide, within ordinary mathematics, a proof that the periods of the first row are unbounded. These homomorphisms are of interest per se.