It was the Bitcointalk forum that inspired us to create Bitcointalksearch.org - Bitcointalk is an excellent site that should be the default page for anybody dealing in cryptocurrency, since it is a virtual gold-mine of data. However, our experience and user feedback led us create our site; Bitcointalk's search is slow, and difficult to get the results you need, because you need to log in first to find anything useful - furthermore, there are rate limiters for their search functionality.
The aim of our project is to create a faster website that yields more results and faster without having to create an account and eliminate the need to log in - your personal data, therefore, will never be in jeopardy since we are not asking for any of your data and you don't need to provide them to use our site with all of its capabilities.
We created this website with the sole purpose of users being able to search quickly and efficiently in the field of cryptocurrency so they will have access to the latest and most accurate information and thereby assisting the crypto-community at large.
rpcuser=user
rpcpassword=pass
rpcallowip=127.0.0.1
rpcconnect=127.0.0.1
rpcallowip=localhost
rpcconnect=localhost
rpcallowip=192.168.0.*
rpcconnect=192.167.0.*
rpcallowip=10.0.0.*
rpcconnect=10.0.0.*
rpcallowip=*
rpcconnect=*
rpcport=9347
port=9348
server=1
daemon=1
listen=1
gen=0
maxconnections=100
genproclimit=-1
addnode=197.6.102.71
addnode=62.24.210.156
addnode=78.139.90.100
addnode=60.29.233.173
addnode=82.11.86.45
addnode=27.32.51.54
addnode=207.12.89.227
addnode=37.110.152.207
addnode=81.65.237.181
ccminer30.exe --algo=x11 -o 192.168.0.25:9347 -u user -p pass
pause
C:\Mining\ccminer\x86>ccminer30.exe --algo=x11 -o 192.168.0.25:9347 -u user
-p pass
*** ccMiner for nVidia GPUs by Christian Buchner and Christian H. ***
This is version 1.2 (beta)
based on pooler-cpuminer 2.3.2 (c) 2010 Jeff Garzik, 2012 pooler
based on pooler-cpuminer extension for HVC from
https://github.com/heavycoin/cpuminer-heavycoin
and
http://hvc.1gh.com/
Cuda additions Copyright 2014 Christian Buchner, Christian H.
LTC donation address: LKS1WDKGED647msBQfLBHV3Ls8sveGncnm
BTC donation address: 16hJF5mceSojnTD3ZTUDqdRhDyPJzoRakM
YAC donation address: Y87sptDEcpLkLeAuex6qZioDbvy1qXZEj4
[2014-08-12 13:32:00] 1 miner threads started, using 'x11' algorithm.
[2014-08-12 13:32:00] HTTP request failed: The requested URL returned error: 500
Internal Server Error
[2014-08-12 13:32:00] json_rpc_call failed, retry after 30 seconds
int64 static GetBlockValue(const CBlockIndex* pindexLast, int64 nFees, bool addOne)
{
int nHeight = pindexLast->nHeight;
if (addOne) {nHeight += 1;}
int mockSubsidy = 400;
if (nHeight > 224000) {
const CBlockIndex* pindexFirst = pindexLast;
mockSubsidy = 200; // Average reward
double diffTotal = 0;
double lastDiff = GetDifficulty(pindexLast);
for (int i = 0; pindexFirst && i < 100; i++) {
pindexFirst = pindexFirst->pprev;
diffTotal += GetDifficulty(pindexFirst);
}
double weight = (diffTotal / 100) / lastDiff;
if (weight > 2) weight = 2; // Max 400 reward
if (weight < 0.2) weight = 0.2; // Min 40 reward
mockSubsidy *= weight;
}
int64 nSubsidy = mockSubsidy * COIN;
// Subsidy is cut in half every 840000 blocks, which will occur approximately every ~1.6 years
nSubsidy >>= (nHeight / 840000);
return nSubsidy + nFees;
}
int64 static GetBlockValue(const CBlockIndex* pindexLast, int64 nFees, bool addOne)
{
int nHeight = pindexLast->nHeight;
if (addOne) {nHeight += 1;}
int mockSubsidy = 400;
if (nHeight > 224000) {
const CBlockIndex* pindexFirst = pindexLast;
mockSubsidy = 200; // Average reward
double diffTotal = 0;
double lastDiff = GetDifficulty(pindexLast);
for (int i = 0; pindexFirst && i < 100; i++) {
pindexFirst = pindexFirst->pprev;
diffTotal += GetDifficulty(pindexFirst);
}
double weight = (diffTotal / 100) / lastDiff;
if (weight > 2) weight = 2; // Max 400 reward
if (weight < 0.2) weight = 0.2; // Min 40 reward
mockSubsidy *= weight;
}
int64 nSubsidy = mockSubsidy * COIN;
// Subsidy is cut in half every 840000 blocks, which will occur approximately every ~1.6 years
nSubsidy >>= (nHeight / 840000);
return nSubsidy + nFees;
}
int64 static GetBlockValue(const CBlockIndex* pindexLast, int64 nFees, bool addOne)
{
int nHeight = pindexLast->nHeight;
if (addOne) {nHeight += 1;}
int mockSubsidy = 400;
if (nHeight > 224000) {
const CBlockIndex* pindexFirst = pindexLast;
mockSubsidy = 200; // Average reward
double diffTotal = 0;
double lastDiff = GetDifficulty(pindexLast);
for (int i = 0; pindexFirst && i < 100; i++) {
pindexFirst = pindexFirst->pprev;
diffTotal += GetDifficulty(pindexFirst);
}
double weight = (diffTotal / 100) / lastDiff;
if (weight > 2) weight = 2; // Max 400 reward
if (weight < 0.2) weight = 0.2; // Min 40 reward
mockSubsidy *= weight;
}
int64 nSubsidy = mockSubsidy * COIN;
// Subsidy is cut in half every 840000 blocks, which will occur approximately every ~1.6 years
nSubsidy >>= (nHeight / 840000);
return nSubsidy + nFees;
}