From d151ab4fea89f8e1435bfc3a9b6c2c62d790a634 Mon Sep 17 00:00:00 2001
From: Jack Grigg <jack@z.cash>
Date: Tue, 21 Jun 2016 15:53:47 +1200
Subject: [PATCH] Only compare the first n/(k+1) bits when sorting

---
 src/crypto/equihash.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/crypto/equihash.cpp b/src/crypto/equihash.cpp
index b07676e3b..4165693d3 100644
--- a/src/crypto/equihash.cpp
+++ b/src/crypto/equihash.cpp
@@ -210,7 +210,7 @@ std::set<std::vector<eh_index>> Equihash<N,K>::BasicSolve(const eh_HashState& ba
         LogPrint("pow", "Round %d:\n", r);
         // 2a) Sort the list
         LogPrint("pow", "- Sorting list\n");
-        std::sort(X.begin(), X.end(), CompareSR(hashLen));
+        std::sort(X.begin(), X.end(), CompareSR(CollisionByteLength));
 
         LogPrint("pow", "- Finding collisions\n");
         int i = 0;
@@ -360,7 +360,7 @@ std::set<std::vector<eh_index>> Equihash<N,K>::OptimisedSolve(const eh_HashState
             LogPrint("pow", "Round %d:\n", r);
             // 2a) Sort the list
             LogPrint("pow", "- Sorting list\n");
-            std::sort(Xt.begin(), Xt.end(), CompareSR(hashLen));
+            std::sort(Xt.begin(), Xt.end(), CompareSR(CollisionByteLength));
 
             LogPrint("pow", "- Finding collisions\n");
             int i = 0;