Go maps are Swiss tables: groups of eight slots with a control word of match bytes, a 7/8 load factor, tombstones instead of empty slots on delete, and incremental growth through a …
Map keys are hashed with AESENC on amd64 and arm64 and a wyhash-style fallback elsewhere, with a per-process key XORed with a per-map random seed that is regenerated when a map …
Map iteration picks two random offsets at start-up - one in the table directory, one in the slot space - and every map gets a random hash seed, which together defeat hash-flooding …