Author

Topic: [ANN][BURST] Burst | Efficient HDD Mining | New 1.2.3 Fork block 92000 - page 675. (Read 2171078 times)

sr. member
Activity: 423
Merit: 250
Is this calculator still accurate? https://bchain.info/BURST/tools/calculator

Predicted output hasn't really changed that much regardless of the price of Burst bottoming out over the last couple weeks.
newbie
Activity: 42
Merit: 0
After a bunch of wasted hours I've finally managed to make dcct's miner work with dev's v2 pool.


So, first you have to download the original files from https://bchain.info/dcct_miner.tgz

After you extract them, replace the contents of mine.c with the following code:

Code:
/*
        Uses burstcoin plot files to mine coins
        Author: Markus Tervooren
        BURST-R5LP-KEL9-UYLG-GFG6T

With code written by Uray Meiviar
BURST-8E8K-WQ2F-ZDZ5-FQWHX

        Implementation of Shabal is taken from:
        http://www.shabal.com/?p=198

Usage: ./mine [ ..]
*/

#define _GNU_SOURCE
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include

#include "shabal.h"
#include "helper.h"

// Do not report results with deadline above this to the node. If you mine solo set this to 10000 to avoid stressing out the node.
#define MAXDEADLINE 5000000

// Change if you need
#define DEFAULT_PORT 8125

// These are fixed for BURST. Dont change!
#define HASH_SIZE 32
#define HASH_CAP 4096
#define PLOT_SIZE (HASH_CAP * HASH_SIZE * 2)

// Read this many nonces at once. 100k = 6.4MB per directory/thread.
// More may speedup things a little.
#define CACHESIZE 100000

#define BUFFERSIZE 2000

unsigned long long addr;
unsigned long long startnonce;
int scoop;

unsigned long long best;
unsigned long long bestn;
unsigned long long deadline;

unsigned long long targetdeadline;

char signature[33];
char oldSignature[33];

char nodeip[16];
int nodeport = DEFAULT_PORT;

unsigned long long bytesRead = 0;
unsigned long long height = 0;
unsigned long long baseTarget = 0;
time_t starttime;

int stopThreads = 0;

pthread_mutex_t byteLock;

#define SHARECACHE 1000

#ifdef SHARE_POOL
int sharefill;
unsigned long long sharekey[SHARECACHE];
unsigned long long sharenonce[SHARECACHE];
#endif

// Buffer to read the passphrase to. Only when SOLO mining
#ifdef SOLO
char passphrase[BUFFERSIZE + 1];
#endif

char readbuffer[BUFFERSIZE + 1];

// Some more buffers
char writebuffer[BUFFERSIZE + 1];

char *contactWallet(char *req, int bytes) {
int s = socket(AF_INET, SOCK_STREAM, IPPROTO_IP);

struct sockaddr_in ss;
ss.sin_addr.s_addr = inet_addr( nodeip );
ss.sin_family = AF_INET;
ss.sin_port = htons( nodeport );

struct timeval tv;
tv.tv_sec =  15;
tv.tv_usec = 0;  

setsockopt(s, SOL_SOCKET, SO_RCVTIMEO, (char *)&tv,sizeof(struct timeval));

if(connect(s, (struct sockaddr*)&ss, sizeof(struct sockaddr_in)) == -1) {
printf("\nError sending result to node                           \n");
fflush(stdout);
return NULL;
}

int written = 0;
do {
int w = write(s, &req[written], bytes - written);
if(w < 1) {
printf("\nError sending request to node                     \n");
return NULL;
}
written += w;
} while(written < bytes);

int bytesread = 0, rbytes;
do {
rbytes = read(s, &readbuffer[bytesread], BUFFERSIZE - bytesread);
if(bytes > 0)
bytesread += rbytes;

} while(rbytes > 0 && bytesread < BUFFERSIZE);

close(s);

// Finish read
readbuffer[bytesread] = 0;

// locate HTTP header end
char *find = strstr(readbuffer, "\r\n\r\n");

// No header found
if(find == NULL)
return NULL;

return find + 4;
}

void procscoop(unsigned long long nonce, int n, char *data, unsigned long long account_id) {
char *cache;
char sig[32 + 64];

cache = data;

int v;

memmove(sig, signature, 32);

for(v=0; v memmove(&sig[32], cache, 64);

shabal_context x;
shabal_init(&x, 256);
shabal(&x, sig, 64 + 32);

char res[32];

shabal_close(&x, 0, 0, res);

unsigned long long *wertung = (unsigned long long*)res;

// Sharepool: Submit all deadlines below threshold
// Uray_pool: Submit best deadline
// Solo: Best deadline, but not low quality deadlines

#ifdef SHARE_POOL
// For sharepool just store results for later submission
if(*wertung < targetdeadline * baseTarget && sharefill < SHARECACHE) {
sharekey[sharefill] = account_id;
sharenonce[sharefill] = nonce;
sharefill++;
}
#else
if(bestn == 0 || *wertung <= best) {
best = *wertung;
bestn = nonce;

#ifdef SOLO
if(best < baseTarget * MAXDEADLINE) { // Has to be this good before we inform the node
#endif


#ifdef URAY_POOL
                       int bytes = sprintf(writebuffer, "POST /burst?requestType=submitNonce&accountId=%llu&nonce=%llu HTTP/1.0\r\nConnection: close\r\n\r\n", account_id,bestn);
#else
int bytes = sprintf(writebuffer, "POST /burst?requestType=submitNonce&secretPhrase=%s&nonce=%llu HTTP/1.0\r\nConnection: close\r\n\r\n", passphrase, bestn);
#endif
char *buffer = contactWallet( writebuffer, bytes );

if(buffer != NULL) {
char *rdeadline = strstr(buffer, "\"deadline\":");
if(rdeadline != NULL) {
rdeadline += 11;
char *end = strstr(rdeadline, "}");
if(end != NULL) {
// Parse and check if we have a better deadline
unsigned long long ndeadline = strtoull(rdeadline, 0, 10);
if(ndeadline < deadline || deadline == 0)
deadline = ndeadline;
}
} else {
printf("\nWalet reported no deadline.\n");
}
#ifdef SOLO
// Deadline too high? Passphrase may be wrong.
if(deadline > MAXDEADLINE) {
printf("\nYour deadline is larger than it should be. Check if you put the correct passphrase to passphrases.txt.\n");
fflush(stdout);
}
#endif

}
#ifdef SOLO
}
#endif
}

#endif
nonce++;
cache += 64;
}
}


void *work_i(void *x_void_ptr) {
        char *x_ptr = (char*)x_void_ptr;

char *cache = (char*) malloc(CACHESIZE * HASH_SIZE * 2);

if(cache == NULL) {
printf("\nError allocating memory                         \n");
exit(-1);
}


DIR *d;
struct dirent *dir;
d = opendir(x_ptr);

if (d) {
while ((dir = readdir(d)) != NULL) {
unsigned long long key, nonce, nonces, stagger, n;

char fullname[512];
strcpy(fullname, x_ptr);

if(sscanf(dir->d_name, "%llu_%llu_%llu_%llu", &key, &nonce, &nonces, &stagger)) {
// Does path end with a /? If not, add it.
if( fullname[ strlen( x_void_ptr ) ] == '/' ) {
strcpy(&fullname[ strlen( x_void_ptr ) ], dir->d_name);
} else {
fullname[ strlen( x_void_ptr ) ] = '/';
strcpy(&fullname[ strlen( x_void_ptr ) + 1 ], dir->d_name);
}

int fh = open(fullname, O_RDONLY);

if(fh < 0) {
                                        printf("\nError opening file %s                             \n", fullname);
                                        fflush(stdout);
}

unsigned long long offset = stagger * scoop * HASH_SIZE * 2;
unsigned long long size = stagger * HASH_SIZE * 2;

for(n=0; n // Read one Scoop out of this block:
// start to start+size in steps of CACHESIZE * HASH_SIZE * 2

unsigned long long start = n * HASH_CAP * HASH_SIZE * 2 + offset, i;
unsigned long long noffset = 0;
for(i = start; i < start + size; i += CACHESIZE * HASH_SIZE * 2) {
unsigned int readsize = CACHESIZE * HASH_SIZE * 2;
if(readsize > start + size - i)
readsize = start + size - i;

int bytes = 0, b;
do {
b = pread(fh, &cache[bytes], readsize - bytes, i);
bytes += b;
} while(bytes < readsize && b > 0); // Read until cache is filled (or file ended)

if(b != 0) {
procscoop(n + nonce + noffset, readsize / (HASH_SIZE * 2), cache, key); // Process block

// Lock and add to totals
pthread_mutex_lock(&byteLock);
bytesRead += readsize;
pthread_mutex_unlock(&byteLock);
}

noffset += CACHESIZE;
}

if(stopThreads) { // New block while processing: Stop.
close(fh);
closedir(d);
free(cache);
return NULL;
}
}
close(fh);
}
}
closedir(d);
}
free(cache);
return NULL;
}

int pollNode() {

// Share-pool works differently
#ifdef SHARE_POOL
int bytes = sprintf(writebuffer, "GET /pool/getMiningInfo HTTP/1.0\r\nHost: %s:%i\r\nConnection: close\r\n\r\n", nodeip, nodeport);
#else
int bytes = sprintf(writebuffer, "POST /burst?requestType=getMiningInfo HTTP/1.0\r\nConnection: close\r\n\r\n");
#endif

char *buffer = contactWallet( writebuffer, bytes );

if(buffer == NULL)
return 0;

// Parse result
#ifdef SHARE_POOL
char *rbaseTarget = strstr(buffer, "\"baseTarget\": \"");
char *rheight = strstr(buffer, "\"height\": \"");
char *generationSignature = strstr(buffer, "\"generationSignature\": \"");
char *tdl = strstr(buffer, "\"targetDeadline\": \"");

if(rbaseTarget == NULL || rheight == NULL || generationSignature == NULL || tdl == NULL)
return 0;

char *endBaseTarget = strstr(rbaseTarget + 15, "\"");
char *endHeight = strstr(rheight + 11, "\"");
char *endGenerationSignature = strstr(generationSignature + 24, "\"");
char *endtdl = strstr(tdl + 19, "\"");

if(endBaseTarget == NULL || endHeight == NULL || endGenerationSignature == NULL || endtdl == NULL)
return 0;

// Set endpoints
endBaseTarget[0] = 0;
endHeight[0] = 0;
endGenerationSignature[0] = 0;
endtdl[0] = 0;

// Parse
if(xstr2strr(signature, 33, generationSignature + 24) < 0) {
printf("\nNode response: Error decoding generationsignature           \n");
fflush(stdout);
return 0;
}

height = strtoull(rheight + 11, 0, 10);
baseTarget = strtoull(rbaseTarget + 15, 0, 10);
targetdeadline = strtoull(tdl + 19, 0, 10);
#else
char *rbaseTarget = strstr(buffer, "\"baseTarget\":\"");
char *rheight = strstr(buffer, "\"height\":\"");
char *generationSignature = strstr(buffer, "\"generationSignature\":\"");
if(rbaseTarget == NULL || rheight == NULL || generationSignature == NULL)
return 0;

char *endBaseTarget = strstr(rbaseTarget + 14, "\"");
char *endHeight = strstr(rheight + 10, "\"");
char *endGenerationSignature = strstr(generationSignature + 23, "\"");
if(endBaseTarget == NULL || endHeight == NULL || endGenerationSignature == NULL)
return 0;

// Set endpoints
endBaseTarget[0] = 0;
endHeight[0] = 0;
endGenerationSignature[0] = 0;

// Parse
if(xstr2strr(signature, 33, generationSignature + 23) < 0) {
printf("\nNode response: Error decoding generationsignature           \n");
fflush(stdout);
return 0;
}

height = strtoull(rheight + 10, 0, 10);
baseTarget = strtoull(rbaseTarget + 14, 0, 10);
#endif

return 1;
}

void update() {
// Try until we get a result.
while(pollNode() == 0) {
printf("\nCould not get mining info from Node. Will retry..             \n");
fflush(stdout);
struct timespec wait;
wait.tv_sec = 1;
wait.tv_nsec = 0;
nanosleep(&wait, NULL);
};
}

int main(int argc, char **argv) {
int i;
if(argc < 3) {
printf("Usage: ./mine [ ..]\n");
exit(-1);
}

#ifdef SOLO
// Reading passphrase from file
int pf = open( "passphrases.txt", O_RDONLY );
if( pf < 0 ) {
printf("Could not find file passphrases.txt\nThis file should contain the passphrase used to create the plotfiles\n");
exit(-1);
}

int bytes = read( pf, passphrase, 2000 );

// Replace spaces with +
for( i=0; i if( passphrase[i] == ' ' )
passphrase[i] = '+';

// end on newline
if( passphrase[i] == '\n' || passphrase[i] == '\r')
passphrase[i] = 0;
}

passphrase[bytes] = 0;
#endif

// Check if all directories exist:
struct stat d = {0};

for(i = 2; i < argc; i++) {
if ( stat( argv[i], &d) ) {
printf( "Plot directory %s does not exist\n", argv[i] );
exit(-1);
} else {
if( !(d.st_mode & S_IFDIR) ) {
printf( "%s is not a directory\n", argv[i] );
exit(-1);
}
}
}

char *hostname = argv[1];

// Contains http://? strip it.
if(strncmp(hostname, "http://", 7) == 0)
hostname += 7;

// Contains Port? Extract and strip.
char *p = strstr(hostname, ":");
if(p != NULL) {
p[0] = 0;
p++;
nodeport = atoi(p);
}

printf("Using %s port %i\n", hostname, nodeport);

hostname_to_ip(hostname, nodeip);

memset(oldSignature, 0, 33);

pthread_t worker[argc];
time(&starttime);

// Get startpoint:
update();

// Main loop
for(;;) {
// Get scoop:
char scoopgen[40];
memmove(scoopgen, signature, 32);

char *mov = (char*)&height;

scoopgen[32] = mov[7]; scoopgen[33] = mov[6]; scoopgen[34] = mov[5]; scoopgen[35] = mov[4]; scoopgen[36] = mov[3]; scoopgen[37] = mov[2]; scoopgen[38] = mov[1]; scoopgen[39] = mov[0];

shabal_context x;
shabal_init(&x, 256);
shabal(&x, scoopgen, 40);
char xcache[32];
shabal_close(&x, 0, 0, xcache);

scoop = (((unsigned char)xcache[31]) + 256 * (unsigned char)xcache[30]) % HASH_CAP;

// New block: reset stats
best = bestn = deadline = bytesRead = 0;

#ifdef SHARE_POOL
sharefill = 0;
#endif

for(i = 2; i < argc; i++) {
if(pthread_create(&worker[i], NULL, work_i, argv[i])) {
printf("\nError creating thread. Out of memory? Try lower stagger size\n");
exit(-1);
}
}

#ifdef SHARE_POOL
// Collect threads back in for dev's pool:
                for(i = 2; i < argc; i++)
                       pthread_join(worker[i], NULL);

if(sharefill > 0) {
char *f1 = (char*) malloc(SHARECACHE * 100);
char *f2 = (char*) malloc(SHARECACHE * 100);

int used = 0;
for(i = 0; i used += sprintf(&f1[used], "%llu:%llu:%llu\n", sharekey[i], sharenonce[i], height);


int ilen = 1, red = used;
while(red > 10) {
ilen++;
red /= 10;
}


int db = sprintf(f2, "POST /pool/submitWork HTTP/1.1\r\nHost: %s:%i\r\nContent-Type: text/plain;charset=UTF-8\r\nContent-Length: %i\r\n\r\n%s\n", nodeip, nodeport, used + 1, f1);

printf("\nServer response: %s\n", contactWallet(f2, db));

free(f1);
free(f2);
}
#endif

memmove(oldSignature, signature, 32);

// Wait until block changes:
do {
update();

time_t ttime;
time(&ttime);
#ifdef SHARE_POOL
printf("\r%llu MB read/%llu GB total/%i shares@target %llu                 ", (bytesRead / ( 1024 * 1024 )), (bytesRead / (256 * 1024)), sharefill, targetdeadline);
#else
if(deadline == 0)
printf("\r%llu MB read/%llu GB total/no deadline                 ", (bytesRead / ( 1024 * 1024 )), (bytesRead / (256 * 1024)));
else
printf("\r%llu MB read/%llu GB total/deadline %llus (%llis left)           ", (bytesRead / ( 1024 * 1024 )), (bytesRead / (256 * 1024)), deadline, (long long)deadline + (unsigned int)starttime - (unsigned int)ttime);
#endif

fflush(stdout);

struct timespec wait;
// Query faster when solo mining
#ifdef SOLO
wait.tv_sec = 1;
#else
wait.tv_sec = 5;
#endif
wait.tv_nsec = 0;
nanosleep(&wait, NULL);
} while(memcmp(signature, oldSignature, 32) == 0); // Wait until signature changed

printf("\nNew block %llu, basetarget %llu                          \n", height, baseTarget);
fflush(stdout);

// Remember starttime
time(&starttime);

#ifndef SHARE_POOL
// Tell all threads to stop:
stopThreads = 1;
for(i = 2; i < argc; i++)
      pthread_join(worker[i], NULL);

stopThreads = 0;
#endif
}
}


and after that just follow the instructions from the original announcement made by dcct - https://bitcointalksearch.org/topic/m.8879760

Note 1: If anyone is wondering, the problem was in the way the data was submitted to the pool. The tip came from burstcoin in a post about Blago's miner.
Note 2: I'm not a C programmer, so I'm not really sure if the content-length header has been calculated right, so if not all of the shares are being counted by the pool this would be the main reason.
Note 3: The binaries provided in the archive are the original ones made by dcct and therefore won't work (the archive link is the one from his announcement post)... so you'll have to recompile the code.
Note 4: I've only compiled and tested the code on a 64 bit Linux, but the changes I've made shouldn't break anything.
Note 5: I've never used the v1 pool, nor I intend to use it, so if the original version wasn't working with it, this one won't work as well.
newbie
Activity: 19
Merit: 0
As the HDD is now bottleneck, there are two options:
  - Write to multiple disks at the same time (I will put this on the roadmap).

I modified an earlier version of your plotter to do this.  I've been using it for a couple of weeks or so, it seems to produce valid plots much faster.  Only tested on linux.

Code:
void CommandGenerate::help() const {
std::cerr << "Usage: ./gpuPlotGenerator generate ";
std::cerr << " ";
std::cerr << "
";
std::cerr << "[
...]" << std::endl;
std::cerr << "    - platformId: Id of the OpenCL platform to use (see [list] command)." << std::endl;
std::cerr << "    - deviceId: Id of the OpenCL device to use (see [list] command)." << std::endl;
std::cerr << "    - staggerSize: Stagger size." << std::endl;
std::cerr << "    - threadsNumber: Number of parallel threads for each work group." << std::endl;
std::cerr << "    - hashesNumber: Number of hashes to compute for each step2 kernel calls." << std::endl;
std::cerr << "    - path: Path to the plots directory." << std::endl;
std::cerr << "    - address: Burst numerical address." << std::endl;
std::cerr << "    - startNonce: First nonce of the plot generation." << std::endl;
std::cerr << "    - noncesNumber: Number of nonces to generate." << std::endl;
std::cerr << "With multiple [
] arguments " << std::endl;
std::cerr << "GPU calculation iterates through a stagger for each job and the results are " << std::endl;
std::cerr << "saved asynchronously.  This is intended to be used for plotting multiple " << std::endl;
std::cerr << "mechanical drives simultaneously in order to max out GPU bandwidth." << std::endl;
}
hero member
Activity: 588
Merit: 500
Any reaosnt o gov over 25k Stagger size? Anyone find a max?

I think pinballDude has a stagger of 60k, it's somewhere over on burstforum.com
legendary
Activity: 910
Merit: 1000
PHS 50% PoS - Stop mining start minting
Any reason to go over 25k Stagger size? Anyone find a max?
hero member
Activity: 588
Merit: 500
Buy hash power @ cryptomining.farm

http://cryptomining.farm/mining.html

 Grin


it's spelt "contract" not contact

also

https://burstforum.com/index.php?threads/cloud-mining-proposal.93/

where prices were @ ~$120/year/4tb --your deal is a ripoff
sr. member
Activity: 462
Merit: 250

GPU plot generator v3.0.0

This version comes with a multi-GPU support and greatly enhance the global memory consumption (on both CPU and GPU side). I hope that it will fix the bad performances of NVidia cards (I need some feedback on that point).
This version also add a [verify] command to verify a plotted file against a reference file (a C-plotted file for example).

Official link: https://burstforum.com/index.php?threads/gpu-plot-generator.45/page-6#post-1925

Getting the following error message some times:

Code:
[ERROR] std::exception

Running 5 devices, within their memory limits. Any ideas...?
sr. member
Activity: 397
Merit: 250
hero member
Activity: 588
Merit: 500
--Announcement--

new blockex, still has problems with the balance of assets showing up wrong, but value is right. Will keep making it better, this is just a start.

http://blockex.burstcoin.info
legendary
Activity: 1582
Merit: 1019
011110000110110101110010
C-CEX lost my deposit again. Over 6000 BURST. I wonder how long, if ever, it will take to get my coins back this time?

Come on C-CEX. No need of this.
sr. member
Activity: 420
Merit: 250
Hi all,

I've setup a BURST pool at http://tompool.org:82, it appears to be working however I'm not seeing the share tally change. I only have about 800GB plotted so far but the other miner has around 6TB. Is this simply a case of low plotting power meaning the shares are too insignificant to be counted in 2 decimal places or am I missing a setting?

The best share I've seen on the pool so far is 41 years :/

Greatly appreciate any help!

Bump :-)
legendary
Activity: 2002
Merit: 1051
ICO? Not even once.
GPU plot generator v3.0.0

Awesome!

Fooling around a bit with it, 2 x 780 Ti went over 60k n/m and I'm fairly certain they could have gone higher if it weren't for the I/O limitation.

The highest stagger I could reach was 16383 which is just below 4GB RAM which is the maximum it could allocate even though I have 16 GB. And that is completely regardless of VRAM amount.
legendary
Activity: 1820
Merit: 1001
Who ever the owner of http://burstpool.ddns.net/ needs to fix pool as I cant mine on it and constantly getting passphrase incorrect and no logner submitting shares

Just gone back onto http://burst-pool.cryptoport.io to check and this is working perfectly fine submitting and working
sr. member
Activity: 462
Merit: 250
GPU plot generator v3.0.0

This version comes with a multi-GPU support and greatly enhance the global memory consumption (on both CPU and GPU side). I hope that it will fix the bad performances of NVidia cards (I need some feedback on that point).
This version also add a [verify] command to verify a plotted file against a reference file (a C-plotted file for example).

Official link: https://burstforum.com/index.php?threads/gpu-plot-generator.45/page-6#post-1925

Thanks alot  Grin Have done some initial testing on nvidia, and I think it's faster but foremost it can handle much larger stagger sizes. And I'm just on tiny 750ti's

Donation incmming  Wink
member
Activity: 113
Merit: 10
GPU plot generator v3.0.0

This version comes with a multi-GPU support and greatly enhance the global memory consumption (on both CPU and GPU side). I hope that it will fix the bad performances of NVidia cards (I need some feedback on that point).
This version also add a [verify] command to verify a plotted file against a reference file (a C-plotted file for example).

A big thank you to Palad1n for his help on the qualification phase of this version.
With this new version, we hit the maximum bandwidth of a standard mechanical HDD (around 20k nonces/minutes ~= 83MB/s).
We made a test with a SSD disk too, with only one R9 290x we touch the 33k nonces/minutes.

As the HDD is now bottleneck, there are two options:
  - Use faster hardware (SSD). It is up to you to test it Wink Feel free to share your experience on the forum (hardware configuration, nonces/minutes obtained).
  - Write to multiple disks at the same time (I will put this on the roadmap).

Changelog:
  - Multi-GPU support.
  - [devices.txt] configuration file added.
  - verify command added.
  - list command split in two (listPlatforms and listDevices).
  - More details added in listDevices command.
  - Correlation between and removed.
  - OpenCL error codes displayed for better debugging.
  - Details added in usages.
  - README updated and improved.
  - CHANGELOG file added.
  - CREDITS file added.
  - LICENSE file added.

Please read the README provided with both the binaries and the sources. As this version introduce new concepts, please read it carefully, especially the [SETUP] part.

Here are the binaries and the source code :
  - Windows x86: https://mega.co.nz/#!vMUWjCZA!IXkIyupOek6t7bOu0qlrYlxvuzVfRS-N4T8sfJ08u-E
  - Windows x64: https://mega.co.nz/#!bEEmiAyK!IeEzk_TrVpLvFpbWGLvkl5tppmgGXDXI3xBbrh2CfGM
  - Linux x86: https://mega.co.nz/#!ud8HnboC!wVU9EwfYWU4mnc67QP1Pienqo4JRm_QJuaE3AJPw5J0
  - Linux x64: https://mega.co.nz/ #!bZExEDaQ!gygiHlkCVLNNbgIFuruQUnV3yrFz8m5pISXsikHPM_g (remove the space before #, link detected as suspicious...)
  - Sources: https://mega.co.nz/#!fBUEEJKD!e5KnEEVIGN0FK3aaHriS6YstfiDNO6lhRTGen8Dh8a8

If you like this software, support me Wink

Official link: https://burstforum.com/index.php?threads/gpu-plot-generator.45/page-6#post-1925

And you Cryo, very big thanks!
Version 3.0 came out great and at the moment it has everything you need to begin now to create a lot of plots without problems.

Steps for creating this version taken from the author is not a short time. Respect him for that!

I transferred to Cryo 5000 Burst. Good people, I will always support!
hero member
Activity: 518
Merit: 500
GPU plot generator v3.0.0

This version comes with a multi-GPU support and greatly enhance the global memory consumption (on both CPU and GPU side). I hope that it will fix the bad performances of NVidia cards (I need some feedback on that point).
This version also add a [verify] command to verify a plotted file against a reference file (a C-plotted file for example).

A big thank you to Palad1n for his help on the qualification phase of this version.
With this new version, we hit the maximum bandwidth of a standard mechanical HDD (around 20k nonces/minutes ~= 83MB/s).
We made a test with a SSD disk too, with only one R9 290x we touch the 33k nonces/minutes.

As the HDD is now bottleneck, there are two options:
  - Use faster hardware (SSD). It is up to you to test it Wink Feel free to share your experience on the forum (hardware configuration, nonces/minutes obtained).
  - Write to multiple disks at the same time (I will put this on the roadmap).

Changelog:
  - Multi-GPU support.
  - [devices.txt] configuration file added.
  - verify command added.
  - list command split in two (listPlatforms and listDevices).
  - More details added in listDevices command.
  - Correlation between and removed.
  - OpenCL error codes displayed for better debugging.
  - Details added in usages.
  - README updated and improved.
  - CHANGELOG file added.
  - CREDITS file added.
  - LICENSE file added.

Please read the README provided with both the binaries and the sources. As this version introduce new concepts, please read it carefully, especially the [SETUP] part.

Here are the binaries and the source code :
  - Windows x86: https://mega.co.nz/#!vMUWjCZA!IXkIyupOek6t7bOu0qlrYlxvuzVfRS-N4T8sfJ08u-E
  - Windows x64: https://mega.co.nz/#!bEEmiAyK!IeEzk_TrVpLvFpbWGLvkl5tppmgGXDXI3xBbrh2CfGM
  - Linux x86: https://mega.co.nz/#!ud8HnboC!wVU9EwfYWU4mnc67QP1Pienqo4JRm_QJuaE3AJPw5J0
  - Linux x64: https://mega.co.nz/ #!bZExEDaQ!gygiHlkCVLNNbgIFuruQUnV3yrFz8m5pISXsikHPM_g (remove the space before #, link detected as suspicious...)
  - Sources: https://mega.co.nz/#!fBUEEJKD!e5KnEEVIGN0FK3aaHriS6YstfiDNO6lhRTGen8Dh8a8

If you like this software, support me Wink

Official link: https://burstforum.com/index.php?threads/gpu-plot-generator.45/page-6#post-1925

Would it be more beneficial for hdds to run in RAID arrays now, ie. RAID0? As for ssds, that not a very cost efficient alternative...lol.....I'll send you some burst and thank you for all the efforts, more likely the middle to end of next week.
full member
Activity: 164
Merit: 100
GPU plot generator v3.0.0

This version comes with a multi-GPU support and greatly enhance the global memory consumption (on both CPU and GPU side). I hope that it will fix the bad performances of NVidia cards (I need some feedback on that point).
This version also add a [verify] command to verify a plotted file against a reference file (a C-plotted file for example).

A big thank you to Palad1n for his help on the qualification phase of this version.
With this new version, we hit the maximum bandwidth of a standard mechanical HDD (around 20k nonces/minutes ~= 83MB/s).
We made a test with a SSD disk too, with only one R9 290x we touch the 33k nonces/minutes.

As the HDD is now bottleneck, there are two options:
  - Use faster hardware (SSD). It is up to you to test it Wink Feel free to share your experience on the forum (hardware configuration, nonces/minutes obtained).
  - Write to multiple disks at the same time (I will put this on the roadmap).

Changelog:
  - Multi-GPU support.
  - [devices.txt] configuration file added.
  - verify command added.
  - list command split in two (listPlatforms and listDevices).
  - More details added in listDevices command.
  - Correlation between and removed.
  - OpenCL error codes displayed for better debugging.
  - Details added in usages.
  - README updated and improved.
  - CHANGELOG file added.
  - CREDITS file added.
  - LICENSE file added.

Please read the README provided with both the binaries and the sources. As this version introduce new concepts, please read it carefully, especially the [SETUP] part.

Here are the binaries and the source code :
  - Windows x86: https://mega.co.nz/#!vMUWjCZA!IXkIyupOek6t7bOu0qlrYlxvuzVfRS-N4T8sfJ08u-E
  - Windows x64: https://mega.co.nz/#!bEEmiAyK!IeEzk_TrVpLvFpbWGLvkl5tppmgGXDXI3xBbrh2CfGM
  - Linux x86: https://mega.co.nz/#!ud8HnboC!wVU9EwfYWU4mnc67QP1Pienqo4JRm_QJuaE3AJPw5J0
  - Linux x64: https://mega.co.nz/ #!bZExEDaQ!gygiHlkCVLNNbgIFuruQUnV3yrFz8m5pISXsikHPM_g (remove the space before #, link detected as suspicious...)
  - Sources: https://mega.co.nz/#!fBUEEJKD!e5KnEEVIGN0FK3aaHriS6YstfiDNO6lhRTGen8Dh8a8

If you like this software, support me Wink

Official link: https://burstforum.com/index.php?threads/gpu-plot-generator.45/page-6#post-1925

Awesome!
Are we able to plot with large stagger sizes in this version?
legendary
Activity: 1820
Merit: 1001
Not sure what going on made few shares and now {"result":"Passphrase does not match reward recipient"}  any idea why keep on continuing to get problem after problem with this anyone know how to resolve this problem as I had working didn't change anything at all and now get this problem

If that just happened once or twice and you didn't change anything it's possible the pool did a rescan on the blockchain. If that is the case, the pool wasn't caught up, and gave the wrong result for ~15 seconds, and everything is probably fine.

I am continuing to get this result when submitting shares to pool

{"baseTarget":"2505256","height":"19128","generationSignature":"469ccf5b7cfcc776
69154100c5d04a602a6d74744e073b02b54f3b55d99e7a7f"}
New best: 17160993207923721836:2650
Submitting share
{"result":"Passphrase does not match reward recipient"}
{"baseTarget":"2505256","height":"19128","generationSignature":"469ccf5b7cfcc776
69154100c5d04a602a6d74744e073b02b54f3b55d99e7a7f"}
sr. member
Activity: 280
Merit: 250
Not sure what going on made few shares and now {"result":"Passphrase does not match reward recipient"}  any idea why keep on continuing to get problem after problem with this anyone know how to resolve this problem as I had working didn't change anything at all and now get this problem

If that just happened once or twice and you didn't change anything it's possible the pool did a rescan on the blockchain. If that is the case, the pool wasn't caught up, and gave the wrong result for ~15 seconds, and everything is probably fine.
Jump to: