hash_potential_delta
For a table of size n, offset sequence r, slot subset S, target sequence length t, prefix A, and next element e, the step change hash_potential_delta n r S t A e is the difference in potential hash_potential n r S t (A ++ [e]) - hash_potential n r S t A.
Statement
noncomputable def hash_potential_delta (n : ℕ) [NeZero n] (r : Fin n → ZMod n) (S : Finset (ZMod n)) (t : ℕ) (A : List (ZMod n)) (e : ZMod n) : ℝ
- Defined in
- arXiv:2610.31363 Section 4
- Verified
- 23 Oct 2026
- Axioms
- none listed
- Built on 1
- hash_potentialFor a table of size n, offset sequence r, slot subset S, target sequence length t, and prefix A, the potential hash_potential n r S t A is…
Read back from the Lean
The definition hash_potential_delta takes:
- a natural number n satisfying n ≠ 0,
- a function r : Fin n → ZMod n,
- a finite set S : Finset (ZMod n),
- a target length t : ℕ,
- a list of elements A : List (ZMod n),
- an element e : ZMod n,
and computes the real number given by:
hash_potential n r S t (A ++ [e]) - hash_potential n r S t A.
That is, it is the difference in hash_potential resulting from appending e to the list A.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Step change in potential delta(A, e) = phi(A ++ [e]) - phi(A). -/ noncomputable def hash_potential_delta (n : ℕ) [NeZero n] (r : Fin n → ZMod n) (S : Finset (ZMod n)) (t : ℕ) (A : List (ZMod n)) (e : ZMod n) : ℝ := hash_potential n r S t (A ++ [e]) - hash_potential n r S t A