# Computational proofs for Prng's definitional laws.
import Base
import ./LAWS.bend as Laws

def Laws.seed_zero_aliases_one():
  {==}

def Laws.seed1_first():
  {==}

def Laws.seed1_second():
  {==}

def Laws.seed42_first():
  {==}

def Laws.same_seed_same_first():
  {==}

def Laws.next_value_is_state():
  {==}

def Laws.bounded_max1_zero():
  {==}

def Laws.bounded_max0_zero():
  {==}

def Laws.bounded_seed42_mod100():
  {==}