diff --git a/hopscotch.go b/hopscotch.go
new file mode 100644
index 0000000..ddfaff1
--- /dev/null
+++ b/hopscotch.go
@@ -0,0 +1,315 @@
+package hashmaps
+
+const (
+	reservedBits        = uintptr(1)
+	maxNeighborhoodSize = 64 - reservedBits
+)
+
+type hBucket[K comparable, V any] struct {
+	hopInfo uint64
+	key     K
+	val     V
+}
+
+// go:inline
+func flip(a uint64) uint64 {
+	a ^= 0xFFFFFFFFFFFFFFFF
+	return a
+}
+
+// go:inline
+func (b *hBucket[K, V]) set(i uintptr, v bool) {
+	mask := uint64(1) << (i + reservedBits)
+	if v {
+		b.hopInfo = b.hopInfo | mask
+	} else {
+		b.hopInfo = b.hopInfo & flip(mask)
+	}
+}
+
+// go:inline
+func (b *hBucket[K, V]) getNeighborhood() uint64 {
+	return b.hopInfo >> uint64(reservedBits)
+}
+
+// go:inline
+func (b *hBucket[K, V]) isEmpty() bool {
+	return (b.hopInfo & 1) == 0
+}
+
+// go:inline
+func (b *hBucket[K, V]) release() {
+	b.hopInfo = b.hopInfo & flip(1)
+}
+
+// go:inline
+func (b *hBucket[K, V]) occupy() {
+	b.hopInfo = b.hopInfo | 1
+}
+
+// Hopscotch is a hashmap implementation which uses open addressing,
+// where collisions are managed within a limited neighborhood. That is
+// implemented as a dynamically growing bitmap with a default
+// size of 4 and a upper bound of 63. From this it follows a constant
+// lookup time for the Get function. To achieve this invariant
+// linear probing is used for finding an empty slot in the table,
+// if the next empty slot is not within the size of the neighborhood,
+// subsequent swap of closer buckets are done or the size of the
+// neighborhood is increased.
+type Hopscotch[K comparable, V any] struct {
+	buckets []hBucket[K, V]
+	hasher  HashFn[K]
+	// length stores the current inserted elements
+	length uintptr
+	// capMinus1 is used for a bitwise AND on the hash value,
+	// because the size of the underlying array is a power of two value
+	capMinus1        uintptr
+	neighborhoodSize uint8
+}
+
+// NewHopscotch creates a ready to use `RobinHood` hash map with default settings.
+func NewHopscotch[K comparable, V any]() *Hopscotch[K, V] {
+	return NewHopscotchWithHasher[K, V](GetHasher[K]())
+}
+
+// NewHopscotchWithHasher same as `NewHopscotch` but with a given hash function.
+func NewHopscotchWithHasher[K comparable, V any](hasher HashFn[K]) *Hopscotch[K, V] {
+	const DefaultNeighborhoodSize = 4
+	const capacity = DefaultNeighborhoodSize
+	return &Hopscotch[K, V]{
+		buckets:          make([]hBucket[K, V], capacity*2),
+		capMinus1:        capacity - 1,
+		hasher:           hasher,
+		neighborhoodSize: DefaultNeighborhoodSize,
+	}
+}
+
+func (m *Hopscotch[K, V]) rehash(n uintptr) {
+	nmap := Hopscotch[K, V]{
+		buckets:          make([]hBucket[K, V], n+uintptr(m.neighborhoodSize)),
+		hasher:           m.hasher,
+		length:           m.length,
+		capMinus1:        n - 1,
+		neighborhoodSize: m.neighborhoodSize,
+	}
+	for _, b := range m.buckets {
+		if !b.isEmpty() {
+			homeIdx := nmap.hasher(b.key) & nmap.capMinus1
+			nmap.emplace(b.key, b.val, homeIdx)
+		}
+	}
+	m.buckets = nmap.buckets
+	m.capMinus1 = nmap.capMinus1
+}
+
+// Reserve sets the number of buckets to the most appropriate to contain at least n elements.
+// If n is lower than that, the function may have no effect.
+func (m *Hopscotch[K, V]) Reserve(n uintptr) {
+	newCap := uintptr(NextPowerOf2(uint64(n) * 2))
+	if uintptr(cap(m.buckets)) < newCap {
+		m.rehash(newCap)
+	}
+}
+
+// search looks within the neighborhood of the home bucket to find the desired key.
+// This function has a constant runtime.
+//
+// go:inline
+func (m *Hopscotch[K, V]) search(homeIdx uintptr, key K) (uintptr, bool) {
+	neighborhood := m.buckets[homeIdx].getNeighborhood()
+	for neighborhood != 0 {
+		if (neighborhood & 1) == 1 {
+			if m.buckets[homeIdx].key == key {
+				return homeIdx, true
+			}
+		}
+
+		homeIdx++
+		neighborhood = neighborhood >> 1
+	}
+
+	return 0, false
+}
+
+// Get returns the value stored for this key, or false if there is no such value.
+func (m *Hopscotch[K, V]) Get(key K) (V, bool) {
+	homeIdx := m.hasher(key) & m.capMinus1
+	idx, found := m.search(homeIdx, key)
+	if found {
+		// already inserted, update
+		return m.buckets[idx].val, true
+	}
+	// not found
+	var v V
+	return v, false
+}
+
+// moveCloser tries to achieve the neighborhood invariant by moving
+// the given empty bucket closer to its home bucket. Therefore another
+// buckets are moved more far-off. The parameter `emptyIdx`
+// is a in-out variable, that is updated, if the movement was successful.
+//
+// go:inline
+func (m *Hopscotch[K, V]) moveCloser(emptyIdx *uintptr) bool {
+	start := *emptyIdx - (uintptr(m.neighborhoodSize) - 1)
+
+	for homeIdx := start; homeIdx < *emptyIdx; homeIdx++ {
+
+		neighborhood := m.buckets[homeIdx].getNeighborhood()
+		for cIdx := homeIdx; neighborhood != 0 && cIdx < *emptyIdx; cIdx++ {
+			if (neighborhood & 1) == 1 {
+				distance := cIdx - homeIdx
+				// found a candidate, mark it as empty
+				m.buckets[cIdx].release()
+
+				// move the candidate to the empty bucket
+				m.buckets[*emptyIdx].occupy()
+				m.buckets[*emptyIdx].key = m.buckets[cIdx].key
+				m.buckets[*emptyIdx].val = m.buckets[cIdx].val
+
+				// update the neighborhood of the home bucket,
+				// because we moved the empty bucket closer
+				m.buckets[homeIdx].set(distance, false)
+				m.buckets[homeIdx].set(*emptyIdx-homeIdx, true)
+
+				// announce the new empty index
+				*emptyIdx = cIdx
+				return true
+			}
+
+			neighborhood = neighborhood >> 1
+		}
+	}
+	return false
+}
+
+// emplace adds the key-value pair to the map. It does not check
+// the occurrence, so it expects that the give key is not already
+// inserted. Futhermore a resize or rehash can happen to achieve
+// the neighborhood invariant.
+func (m *Hopscotch[K, V]) emplace(key K, val V, homeIdx uintptr) {
+	// linear probing for the next empty bucket
+	emptyIdx := homeIdx
+	for ; !m.buckets[emptyIdx].isEmpty(); emptyIdx++ {
+	}
+
+	for {
+		distance := emptyIdx - homeIdx
+		if distance < uintptr(m.neighborhoodSize) {
+			// we found an empty bucket within the neighborhood.
+			// we are finished and can emplace the key-value pair.
+			m.buckets[emptyIdx].occupy()
+			m.buckets[emptyIdx].key = key
+			m.buckets[emptyIdx].val = val
+			m.buckets[homeIdx].set(distance, true)
+			return
+		}
+
+		// try to move the empty bucket closer, so that it is within the
+		// neighborhood size of the home bucket.
+		if !m.moveCloser(&emptyIdx) {
+			break
+		}
+	}
+
+	// move closer does not work, we need to find another solution!
+	capacity := m.capMinus1 + 1
+	if m.neighborhoodSize < 32 {
+		m.neighborhoodSize = 2 * m.neighborhoodSize
+		m.rehash(capacity)
+	} else if m.neighborhoodSize < uint8(maxNeighborhoodSize-1) {
+		m.neighborhoodSize = uint8(maxNeighborhoodSize)
+		m.rehash(capacity)
+	} else {
+		// that is the last hope to achieve the neighborhood invariant,
+		// but this case should happen really rare.
+		// Note: it is also possible to change the hash function here!
+		m.rehash(capacity * 2)
+	}
+	newIdx := m.hasher(key) & m.capMinus1
+	m.emplace(key, val, newIdx)
+}
+
+// Put maps the given key to the given value. If the key already exists its
+// value will be overwritten with the new value.
+// Returns true, if the element is a new item in the hash map.
+func (m *Hopscotch[K, V]) Put(key K, val V) bool {
+	// check for resize
+	capacity := m.capMinus1 + 1
+	if m.length >= capacity/2 {
+		m.rehash(capacity * 2)
+	}
+
+	homeIdx := m.hasher(key) & m.capMinus1
+	idx, found := m.search(homeIdx, key)
+	if found {
+		// already inserted, update
+		m.buckets[idx].val = val
+		return false
+	}
+
+	// search for empty bucket in neighborhoodSize
+	m.length++
+	m.emplace(key, val, homeIdx)
+	return true
+}
+
+// Remove removes the specified key-value pair from the map.
+// Returns true, if the element was in the hash map.
+func (m *Hopscotch[K, V]) Remove(key K) bool {
+	homeIdx := m.hasher(key) & m.capMinus1
+	idx, found := m.search(homeIdx, key)
+	if !found {
+		return false
+	}
+
+	m.length--
+	distance := idx - homeIdx
+	m.buckets[homeIdx].set(distance, false)
+	m.buckets[idx].release()
+
+	return true
+}
+
+// Clear removes all key-value pairs from the map.
+func (m *Hopscotch[K, V]) Clear() {
+	for idx := range m.buckets {
+		m.buckets[idx].hopInfo = 0
+	}
+	m.length = 0
+}
+
+// Load return the current load of the hash map.
+func (m *Hopscotch[K, V]) Load() float32 {
+	return float32(m.length) / float32(len(m.buckets))
+}
+
+// Size returns the number of items in the map.
+func (m *Hopscotch[K, V]) Size() int {
+	return int(m.length)
+}
+
+// Copy returns a copy of this map.
+func (m *Hopscotch[K, V]) Copy() *Hopscotch[K, V] {
+	newM := &Hopscotch[K, V]{
+		buckets:   make([]hBucket[K, V], len(m.buckets)),
+		capMinus1: m.capMinus1,
+		length:    m.length,
+		hasher:    m.hasher,
+	}
+	copy(newM.buckets, m.buckets)
+	return newM
+}
+
+// Each calls 'fn' on every key-value pair in the hash map in no particular order.
+// If 'fn' returns true, the iteration stops.
+func (m *Hopscotch[K, V]) Each(fn func(key K, val V) bool) {
+	for _, current := range m.buckets {
+		if !current.isEmpty() {
+			if stop := fn(current.key, current.val); stop {
+				// stop iteration
+				return
+			}
+		}
+	}
+}
diff --git a/map_test.go b/map_test.go
index 52df25a..384d843 100644
--- a/map_test.go
+++ b/map_test.go
@@ -27,10 +27,19 @@ func setupMaps[K comparable, V comparable]() []hashmaps.IHashMap[K, V] {
 		robin     = hashmaps.NewRobinHood[K, V]()
 		unordered = hashmaps.NewUnordered[K, V]()
 		flat      = hashmaps.NewFlat[K, V]()
+		hopscotch = hashmaps.NewHopscotch[K, V]()
 	)
 	robin.MaxLoad(0.9)
 
 	return []hashmaps.IHashMap[K, V]{
+		{
+			Get:    hopscotch.Get,
+			Put:    hopscotch.Put,
+			Remove: hopscotch.Remove,
+			Size:   hopscotch.Size,
+			Each:   hopscotch.Each,
+			Load:   hopscotch.Load,
+		},
 		{
 			Get:    flat.Get,
 			Put:    flat.Put,
@@ -146,6 +155,7 @@ func TestCrossCheckInt(t *testing.T) {
 				return v, ok
 			}, t)
 		}
+		fmt.Println("size:", m.Size(), "Load", m.Load())
 	}
 }