From 42abeb2fa5e334dd1587f489fd7309b5de14fafd Mon Sep 17 00:00:00 2001
From: James Nobis <quel@quelrod.net>
Date: Tue, 9 Nov 2010 13:37:13 -0600
Subject: [PATCH] change distrrtgen client to not store start points or sort
 the resulting result changes by PowerBlade and inspired by Sc00bz decreases
 result size from 9,000,000 bytes to 5,000,000 bytes

---
 .../distrrtgen/distrrtgen.cpp                  | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/BOINC software/BOINC client apps/distrrtgen/distrrtgen.cpp b/BOINC software/BOINC client apps/distrrtgen/distrrtgen.cpp
index 5ecd8cf..69621d2 100644
--- a/BOINC software/BOINC client apps/distrrtgen/distrrtgen.cpp	
+++ b/BOINC software/BOINC client apps/distrrtgen/distrrtgen.cpp	
@@ -223,21 +223,21 @@ int main(int argc, char **argv) {
 	unsigned int nFileLen;
 	
 	// Round to boundary
-	nDataLen = nDataLen / 18 * 18;
-	if (nDataLen == nRainbowChainCount * 18)
+	nDataLen = nDataLen / 10 * 10;
+	if ((int)nDataLen == nRainbowChainCount * 10)
 	{		
 		std::cerr << "precomputation of this rainbow table already finished" << std::endl;
 		fclose(outfile);
 		return 0;
 	}
-	nChainStart += (nDataLen / 18);
+	nChainStart += (nDataLen / 10);
 	fseek(outfile, nDataLen, SEEK_SET);
 	size_t nReturn;
 	CChainWalkContext cwc;
 	uint64 nIndex[2];
 	time_t tStart = time(NULL);
 //	std::cout << "Starting to generate chains" << std::endl;
-	for(uint32 nCurrentCalculatedChains = nDataLen / 18; nCurrentCalculatedChains < nRainbowChainCount; nCurrentCalculatedChains++)
+	for(uint32 nCurrentCalculatedChains = nDataLen / 10; nCurrentCalculatedChains < nRainbowChainCount; nCurrentCalculatedChains++)
 	{		
 		uint32 cpcheck = 0;
 		unsigned short checkpoint = 0;
@@ -265,7 +265,7 @@ int main(int argc, char **argv) {
 
 		nIndex[1] = cwc.GetIndex();
 		// Write chain to disk
-		if ((nReturn = fwrite(nIndex, 1, 16, outfile)) != 16)
+		if ((nReturn = fwrite(&nIndex[1], 1, 8, outfile)) != 8)
 		{
 			std::cerr << "disk write fail" << std::endl;
 			fclose(outfile);
@@ -280,7 +280,7 @@ int main(int argc, char **argv) {
 //		fflush(file);
 	}
 	//std::cout << "Generation completed" << std::endl;
-    fseek(outfile, 0, SEEK_SET);
+/*    fseek(outfile, 0, SEEK_SET);
 	nFileLen = GetFileLen(outfile);
 	nRainbowChainCount = nFileLen / 18;
 
@@ -305,18 +305,18 @@ int main(int argc, char **argv) {
 		}
 
 		// Sort file
-		QuickSort(pChain, 0, nRainbowChainCount - 1);
+		//QuickSort(pChain, 0, nRainbowChainCount - 1);
 
 		// Write file
 		fseek(outfile, 0, SEEK_SET);
 		for(uint32 i = 0; i < nRainbowChainCount; i++)
 		{
-			fwrite(&pChain[i], 1, 16, outfile);
+			fwrite(&pChain[i].nIndexE, 1, 8, outfile);
 			fwrite(&pChain[i].nCheckPoint, 2, 1, outfile);
 		}
 		delete[] pChain;
 	}
-
+*/
 	fclose(outfile);
     
 	// main loop - read characters, convert to UC, write
-- 
2.39.2