Remove redundant comments from axhash functions

Author: robby031

axhash.go

@@ -18,7 +18,6 @@ const (
 
 var axSeed = axSec0 ^ axPri0
 
-// axMul is folded_multiply: 128-bit product, XOR of high and low halves.
 func axMul(x, y uint64) uint64 {
 	hi, lo := bits.Mul64(x, y)
 	return hi ^ lo
@@ -32,8 +31,6 @@ func axR8(s string, i int) uint64 {
 	return axR4(s, i) | axR4(s, i+4)<<32
 }
 
-// axhash is the entry point. Dispatch mirrors the original axhash-core
-// tier structure but uses only compile-time constants as secrets.
 func axhash(key string) uint32 {
 	n := len(key)
 	if n == 0 {
@@ -52,7 +49,6 @@ func axhash(key string) uint32 {
 	return uint32(axLong(key, n, rotated))
 }
 
-// axShort handles 1–16 bytes. Identical to the original scalar backend.
 func axShort(key string, n int, acc uint64) uint64 {
 	lm := uint64(n) * axLenMul
 	if n >= 8 {
@@ -83,7 +79,6 @@ func axShort(key string, n int, acc uint64) uint64 {
 	return axMul(m0, lm^axPri0)
 }
 
-// axMid1732 handles 17–32 bytes. Identical to the original scalar backend.
 func axMid1732(key string, n int, acc uint64) uint64 {
 	lm := uint64(n) * axLenMul
 	a, b := axR8(key, 0), axR8(key, 8)
@@ -93,7 +88,6 @@ func axMid1732(key string, n int, acc uint64) uint64 {
 	return axMul(front^bits.RotateLeft64(back, 17)^acc, lm^axSec2)
 }
 
-// axMid3364 handles 33–64 bytes. Identical to the original scalar backend.
 func axMid3364(key string, n int, acc uint64) uint64 {
 	lm := uint64(n) * axLenMul
 	w0, w1 := axR8(key, 0), axR8(key, 8)
@@ -110,9 +104,6 @@ func axMid3364(key string, n int, acc uint64) uint64 {
 	return axMul(bits.RotateLeft64(m^lm, 23), axSec1^acc)
 }
 
-// axLong handles strings > 64 bytes.
-// Replaces the original multi-lane stripe machinery with a simple rolling mix.
-// Map keys this long are rare; uniform distribution is preserved.
 func axLong(key string, n int, seed uint64) uint64 {
 	i := 0
 	for ; i+16 <= n; i += 16 {