Did you have coin in this wallet?
I mean why don't you start again from an empty .anoncoin data directory?
CS
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.
Value getdifficulty(const Array& params, bool fHelp)
{
if (fHelp || params.size() != 0)
throw runtime_error(
"getdifficulty\n"
"\nReturns the proof-of-work required difficulty now at the tip of the block chain.\n"
"\nResult:\n"
"n.nnn (numeric) The minimum difficulty is defined as 1 and this result is linear relative to that value.\n"
" Smaller values indicate harder, larger an easier difficulty and all blocks will have a value < 1.\n"
"\nExamples:\n"
+ HelpExampleCli("getdifficulty", "")
+ HelpExampleRpc("getdifficulty", "")
);
LOCK(cs_main);
return GetDifficulty();
}
(...)
//! Returns the floating point number that represents a multiple of the minimum
//! difficulty that was required, and found within the given block index entries
//! nBits field. If the block index pointer given is NULL, then we use the active
//! chain tip block index as the one for which this evaluation is made.
//! minimum difficulty = 1.0, and the value goes down when difficulty is harder,
//! and up when the difficulty is easier.
double GetDifficulty(const CBlockIndex* blockindex)
{
if (blockindex == NULL)
{
if (chainActive.Tip() == NULL)
return 1.0;
else
blockindex = chainActive.Tip();
}
uint256 uintBlockDiff;
uintBlockDiff.SetCompact( blockindex->nBits );
return 1.0 / GetLinearWork( uintBlockDiff, Params().ProofOfWorkLimit( CChainParams::ALGO_SCRYPT ) );
}