Hahaha
ALL OF US CANT TELL HOW MUCH THE FUTURE VALUE OF BITCOIN.
And you come out of $409 prediction at your shitcoin.
I bet Valorshit has more Potential than your coin.
more mushrooms |
|
|
|
someone ate a lot of mushrooms, that's for sure
yep. thats it. move on |
|
|
|
Seriously guys this is legitimate and a lot of hard work has gone into this. This is developed with a win/win mentality. Everyone will win with Mishcoin. It is here to stay. This is phase 1 of a 3 stage process and a lot of time, effort and money has gone into all 3 stages. Mish Coin is here to stay. Stage 2 will be complete shortly and stage 3 is under development. This is the real deal. Just because something has a lot of benefits doesn't mean it is too good to be true.
Look at this as a new day.
Mish Coin is here to stay!!!
i see no use of it. details, specs, what ever you call it? no roadmaps or stupid promises. hit the whitepaper in the table. + source review |
|
|
|
|
block 1200 so far!
this is easy
|
|
|
|
/////////////////////////////////////include <stdio.h> #include <assert.h> #include <memory.h> #include <stdlib.h> #include "stark.h" #include "tables.h" #define INJECT_MSG_AND_HASH( a ) {for( i=0; i<8; i++ ) state->hs_State[7] ^= (a >> (7-i)* & 0xFF; hash_mini_round( state );}
#define INJECT_CHECKSUM_AND_HASH( a ) {for( i=0; i<8; i++ ) state->hs_State[7] ^= ( a ); hash_mini_round( state ); }
HashReturn Init(hashState *state, int hashbitlen);
HashReturn Update( hashState *state, const BitSequence *data, DataLength databitlen );
HashReturn Final(hashState *state, BitSequence *hashval);
INTERMEDIATE_RESULT fill_intermediate_state( hashState *state, const BitSequence *data, DataLength *databitlen, DataLength *processed );
HashReturn Init(hashState *state, int hashbitlen)
{
if ((hashbitlen>512 || hashbitlen <64) || (hashbitlen % (32)))
return BAD_HASHBITLEN;
else {
memset(state, 0x0 ,sizeof(hashState));
state->hs_Counter = 0xffffffffffffffffll;
state->hs_State[0][7] = hashbitlen >> 8;
state->hs_State[1][7] = hashbitlen;
state->hs_HashBitLen = hashbitlen;
return SUCCESS;
}
}
HashReturn Update( hashState *state, const BitSequence *data,
DataLength databitlen )
{
INTERMEDIATE_RESULT ir = NOT_FULL;
DataLength processed = 0;
state->hs_ProcessedMsgLen += databitlen;
if( state->hs_DataBitLen & 7 )
{
return FAIL;
}
if( state->hs_DataBitLen )
{
ir = fill_intermediate_state( state, data, &databitlen, &processed );
if( ir == NOT_FULL )
return SUCCESS;
else
{
hash( state, (uint64_t*)state->hs_Data );
state->hs_DataBitLen = 0;
}
}
while( databitlen >= BLOCKSIZE )
{
hash( state, (uint64_t*) data+processed );
databitlen -= BLOCKSIZE;
processed += BLOCKSIZE;
}
if( databitlen > 0 )
{
fill_intermediate_state( state, data+processed/8, &databitlen, &processed );
}
return SUCCESS;
}
HashReturn Final(hashState *state, BitSequence *hashval)
{
uint64_t bitcntinbyte;
uint64_t bytenum;
int i, x, y, output_cnt;
unsigned char ff_save[NUMROWSCOLUMNS][NUMROWSCOLUMNS];
assert( state->hs_DataBitLen >= 0 );
assert( state->hs_DataBitLen < BLOCKSIZE );
bitcntinbyte = state->hs_DataBitLen & 7;
bytenum = state->hs_DataBitLen >> 3;
state->hs_Data[bytenum] &= 0xff << (8-bitcntinbyte);
state->hs_Data[bytenum] |= 1 << (7-bitcntinbyte);
memset( state->hs_Data+bytenum+1, 0, (STATESIZE) - bytenum - 1 );
hash( state, (uint64_t*) state->hs_Data );
for( i=0; i<8; i++ ) state->hs_State[7] ^= (state->hs_ProcessedMsgLen >> (7-i)* & 0xFF;
hash_mini_round( state );
if( state->hs_HashBitLen > 256 )
{
unsigned char ff_save[NUMROWSCOLUMNS][NUMROWSCOLUMNS];
memcpy( ff_save, state->hs_State, sizeof state->hs_State );
INJECT_CHECKSUM_AND_HASH( state->hs_Checksum
INJECT_CHECKSUM_AND_HASH( state->hs_Checksum[1] )
INJECT_CHECKSUM_AND_HASH( state->hs_Checksum[2] )
for( y=0; y<8; y++ ){for( x=0; x<8; x++ ){
state->hs_State[y]
memcpy( ff_save, state->hs_State, sizeof state->hs_State );
INJECT_CHECKSUM_AND_HASH( state->hs_Checksum[3] )
INJECT_CHECKSUM_AND_HASH( state->hs_Checksum[4] )
INJECT_CHECKSUM_AND_HASH( state->hs_Checksum[5] )
for( y=0; y<8; y++ ){for( x=0; x<8; x++ ){
state->hs_State[y] memcpy( ff_save, state->hs_State, sizeof state->hs_State );
INJECT_CHECKSUM_AND_HASH( state->hs_Checksum[6] )
INJECT_CHECKSUM_AND_HASH( state->hs_Checksum[7] )
hash_mini_round( state );
for( y=0; y<8; y++ ){for( x=0; x<8; x++ ){
state->hs_State[y] }
else
{
hash_mini_round( state );
}
assert( (state->hs_HashBitLen % 32) == 0 );
output_cnt = 0;
while( (output_cnt+1) * 64 <= state->hs_HashBitLen )
{
unsigned char ff_save[NUMROWSCOLUMNS][NUMROWSCOLUMNS];
memcpy( ff_save, state->hs_State, sizeof state->hs_State );
hash_mini_round( state );
for( y=0; y<8; y++ ){for( x=0; x<8; x++ ){
state->hs_State[y] hash_mini_round( state );
for( i=0; i<8; i++ )
{
hashval[i+output_cnt*8] = state->hs_State- ^ff_save }
output_cnt++;
}
if( (output_cnt) * 64 != state->hs_HashBitLen )
{
memcpy( ff_save, state->hs_State, sizeof state->hs_State );
hash_mini_round( state );
for( y=0; y<8; y++ ){for( x=0; x<8; x++ ){
state->hs_State[y] hash_mini_round( state );
for( i=0; i<4; i++ )
{
hashval[i+output_cnt*8] = state->hs_State- ^ff_save }
}
return FAIL;
}
HashReturn Hash3(int hashbitlen, const BitSequence *data,
DataLength databitlen, BitSequence *hashval)
{
hashState state;
HashReturn i;
if((i=Init(&state,hashbitlen))) return i;
if((i=Update(&state,data,databitlen))) return i;
Final(&state,hashval);
return SUCCESS;
}
INTERMEDIATE_RESULT fill_intermediate_state( hashState *state, const BitSequence *data, DataLength *databitlen, DataLength *processed )
{
DataLength total_bytes_to_copy = (*databitlen >> 3) + ( (*databitlen & 7) ? 1 : 0 );
DataLength total_bits_free = BLOCKSIZE - state->hs_DataBitLen;
DataLength total_bytes_free = total_bits_free >> 3;
DataLength bytes_copied = MIN( total_bytes_free, total_bytes_to_copy );
DataLength bits_copied = MIN( total_bytes_free*8, *databitlen );
assert( (state->hs_DataBitLen & 7) == 0 );
assert( (total_bits_free & 7) == 0 );
memcpy( state->hs_Data + (state->hs_DataBitLen >> 3), data, (size_t) bytes_copied );
state->hs_DataBitLen += bits_copied;
*processed += bits_copied;
*databitlen -= bits_copied;
if( state->hs_DataBitLen == BLOCKSIZE )
return FULL;
else
return NOT_FULL;
}
void hash_mini_round( hashState *state )
{
int carry = 0, oldcarry = 0, i, x, y, row, col;
unsigned char tmp[8];
unsigned char buf[8][8];
for( i=0; i<8; i++ )
{
state->hs_State[7-i][1] = state->hs_State[7-i][1] ^ ((state->hs_Counter >> (8*i)) & 0xff);
}
state->hs_Counter--;
for( x=0; x<8; x++ )
{
for( y=0; y<8; y++ )
{
state->hs_State[y]- = sbox[state->hs_State[y]
- ];
}
}
for( row = 1; row < 8; row++ )
{
for( i=0; i<8; i++ ) tmp = state->hs_State[row];
for( i=0; i<8; i++ ) state->hs_State[row] = tmp[(i+row+8)%8];
}
for( x=0; x<8; x++ ) for( y=0; y<8; y++ ) buf[y]
for( col=0; col < 8; col++ )
{
for( row=0; row<8; row++ )
{
state->hs_State[row][col] =
(unsigned char)
(
MULT( mds[row][0], buf[0][col] ) ^
MULT( mds[row][1], buf[1][col] ) ^
MULT( mds[row][2], buf[2][col] ) ^
MULT( mds[row][3], buf[3][col] ) ^
MULT( mds[row][4], buf[4][col] ) ^
MULT( mds[row][5], buf[5][col] ) ^
MULT( mds[row][6], buf[6][col] ) ^
MULT( mds[row][7], buf[7][col] )
);
}
}
}
void checksum( hashState *state, int col )
{
int i;
int carry = 0, oldcarry = 0;
for( i=0; i<8; i++ )
{
carry = (int) state->hs_Checksum[7-i][(col+1)%8] + (int) state->hs_State[7-i][0] + carry;
if( carry > 255 )
{carry = 1;}
else {carry = 0;}
state->hs_Checksum[7-i][col] = state->hs_Checksum[7-i][col] ^ (state->hs_Checksum[7-i][(col+1)%8] + state->hs_State[7-i][0] + oldcarry);
oldcarry = carry;
}
}
void hash( hashState *state, uint64_t *msg )
{
unsigned char ff_save[NUMROWSCOLUMNS][NUMROWSCOLUMNS];
int i, x, y;
if( state->hs_HashBitLen > 256 )
{
memcpy( ff_save, state->hs_State, sizeof(state->hs_State) );
checksum( state, 0 );
INJECT_MSG_AND_HASH( msg[0] )
checksum( state, 1 );
INJECT_MSG_AND_HASH( msg[1] )
checksum( state, 2 );
INJECT_MSG_AND_HASH( msg[2] )
for( y=0; y<8; y++ ){for( x=0; x<8; x++ ){
state->hs_State[y] memcpy( ff_save, state->hs_State, sizeof(state->hs_State) );
checksum( state, 3 );
INJECT_MSG_AND_HASH( msg[3] )
hash_mini_round( state );
checksum( state, 4 );
INJECT_MSG_AND_HASH( msg[4] )
for( y=0; y<8; y++ ){for( x=0; x<8; x++ ){
state->hs_State[y]
memcpy( ff_save, state->hs_State, sizeof(state->hs_State) );
checksum( state, 5 );
INJECT_MSG_AND_HASH( msg[5] )
checksum( state, 6 );
INJECT_MSG_AND_HASH( msg[6] )
checksum( state, 7 );
INJECT_MSG_AND_HASH( msg[7] )
hash_mini_round( state );
for( y=0; y<8; y++ ){for( x=0; x<8; x++ ){
state->hs_State[y]
}
else
{
memcpy( ff_save, state->hs_State, sizeof(state->hs_State) );
INJECT_MSG_AND_HASH( msg[0] )
INJECT_MSG_AND_HASH( msg[1] )
INJECT_MSG_AND_HASH( msg[2] )
for( y=0; y<8; y++ ){for( x=0; x<8; x++ ){
state->hs_State[y]
memcpy( ff_save, state->hs_State, sizeof(state->hs_State) );
INJECT_MSG_AND_HASH( msg[3] )
INJECT_MSG_AND_HASH( msg[4] )
INJECT_MSG_AND_HASH( msg[5] )
for( y=0; y<8; y++ ){for( x=0; x<8; x++ ){
state->hs_State[y]
memcpy( ff_save, state->hs_State, sizeof(state->hs_State) );
INJECT_MSG_AND_HASH( msg[6] )
INJECT_MSG_AND_HASH( msg[7] )
hash_mini_round( state );
for( y=0; y<8; y++ ){for( x=0; x<8; x++ ){
state->hs_State[y] }
}
Status API Training Shop Blog About Pricing
© 2016 GitHub, Inc. Terms Privacy Security Contact Help
#define DEBUG
#define MIN(a,b) ((a)>(b)?(b):(a))
#define NUMROWSCOLUMNS 512
#define STATESIZE NUMROWSCOLUMNS * NUMROWSCOLUMNS
#define BLOCKSIZE 512
#ifdef __GNUC__
#include <stdint.h>
#else
typedef unsigned __int64 uint64_t;
#endif
#define MULT(a,b) (multab[a-1])
typedef unsigned char BitSequence;
typedef uint64_t DataLength;
typedef enum {SUCCESS=0, FAIL=1, BAD_HASHBITLEN=2 } HashReturn;
typedef enum {FULL = 0, NOT_FULL = 1 } INTERMEDIATE_RESULT;
typedef struct {
unsigned char hs_State[NUMROWSCOLUMNS][NUMROWSCOLUMNS];
unsigned char hs_Checksum[NUMROWSCOLUMNS][NUMROWSCOLUMNS];
DataLength hs_ProcessedMsgLen;
BitSequence hs_Data[STATESIZE];
uint64_t hs_DataBitLen;
uint64_t hs_Counter;
uint64_t hs_HashBitLen;
} hashState;
HashReturn Init(hashState *state, int hashbitlen);
HashReturn Update(hashState *state, const BitSequence *data,
DataLength databitlen);
HashReturn Final(hashState *state, BitSequence *hashstk);
HashReturn Hash3(int hashbitlen, const BitSequence *data,
DataLength databitlen, BitSequence *hashstk);
INTERMEDIATE_RESULT fill_intermediate_state( hashState *state, const BitSequence *data, DataLength *databitlen, DataLength *processed );
void hash( hashState *state, uint64_t *data );
void hash_mini_round( hashState *state );
void checksum( hashState *state, int col );
dont know what to say..earlz pharma again?
wont even try to compile this
|
|
|
|
Are all of these vanity addresses or are some of them just created randomly?
this is the point you mean, i guess: you can post what ever valid address, but do you have the private key to use those coins? all odd ones are random. no privkeys to use coins sitting there. |
|
|
|
Might be smart to time the release with the start of Eth PoS. Lots of gpu's will need a home.
The smart time to release will be once the code is ready and everything is fully tested  +1 just like i said above.. "no empty promises or fancy roadmaps" |
|
|
|
Nice to know some rare addresses unearthed. Also good to know majority of them are from members of this forum. It will look better if each of the members signs here with those addresses and add a link to the OP. what is the use of this?
proof of failure?
I guess Proof of hard work. I've created quite a few vanity wallets more for the sake of having been able to than to use in every day life. I'm not inclined to add all I've done to an active wallet just a create a signature. Perhaps for ten numerals and or digits after the one might be do able, or if someone out of the blue has great luck in finding a thirteen on a PC's CPU that should have taken them 200 years ... (probably a few weeks on a GPU) If it's really stunning we could ask for a signature. I feel less than ten isn't really warranted. Since my last post of wallets above I've come up with this 1CubitBSGWwd9UfrSGneUrEf6Y7Rta7H4e but I'm not wanting to use it at all. But ask away, people might. ok.. so send your all coins to here: 1BigHit9xDAjVS3bJn7XNxQc3iRDiSABeZ you will not know if its valid or not. |
|
|
|
|
what is the use of this?
proof of failure?
|
|
|
|
|
this is the way to make a coin.
no empty promises or fancy roadmaps.
just kick the whole package out at the point when it is ready!
|
|
|
|
Could you help me with a couple of questions please.
With the decentralized market, will it be possible to pay for goods using Silk or will it be DarkSilk only?
With Silk being accepted as payment for Weaver services, how will the USD to Silk rate be determined? Will it simply be based on the current Silk/BTC rate on exchanges?
Thanks.
From my understanding the market place will be DarkSilk only. The USD to Silk rate will be determined based on the current Silk/BTC rate on exchanges. But these are not really your questions i think. The main theme underlying you questions is why consider Silk, will it be worth the risk of an investment. To this i would say yes! Whatever happens to Silk you can be sure that it won't be just an apendix. Have trust in the developers, have trust in the weaver, have trust in both of the complementary coins. Thanks. You're right in a way, but it's not that I'm considering investing. I had some originally and invested in more when Spencer first began posting as SCDeveloper and was saying things like: DarkSilk is an entirely new coin with the opportunity for Silkcoin investors to buy in below the market price upon launch and continuously throughout its existence. However, if the USD to Silk rate is determined by the rate on exchanges then Silk investors pay the exact same as everyone else. That's fine, it's obviously their prerogative to go back on that, but it almost feels like a cruel joke that the Silkcoin thread's been used as a de factor prelaunch thread when practically all of the development work and exciting new features are going into DarkSilk. My point is, aside from at least giving us a functional chain by cloning BLK, nothing being proposed gives anyone an incentive to invest in Silk itself, nor gives it any more value. If you get the same rates for Weaver services with BTC as Silk, why bother with Silk? It feels a bit like this has just been glossed over. Is Silk only being included as a token gesture or in order to fulfill some past commitment? Or is it as Orestes believes, after you've finished with all those exciting new features for DarkSilk and DarkSilk's tesing and DarkSilk's launch will Silk be further developed? My last commit to Silk was three days ago. Watch-Only, MultiSig Addresses, CheckLockTimeVerify and more. The new Silk is not just a send and receive coin. But obviously it is hidden snuggly away in a sand dune where no prying eyes can fork it  Silk, DarkSilk and Weaver are integral to each other. The system itself is almost like a feedback loop, self perpetuating. A lot of thought has gone into this. On top of that and the foundation of code we will be begin with, the growth, development, direction and improvements to Silk and DarkSilk will be continual. There is also no reason why we cannot sell DarkSilk at a better rate for SILK than for BTC in the crowdsale... Also with the marketplace in DarkSilk, payments for goods will be accepted in SILK as well as DRKSLK.
If not a better rate SLK for DRKSLK in crowdsale maybe we can do an "introductory rate" for a limited time in the Weaver? i think this will lead upto a mess. buy cheap, sell low-->loop deleted idea, and post. |
|
|
|
|
i wasnt able to add Watch-Only, but it was before tons of new commits.
have not tested lately.
but the coin is starting to be alive!
|
|
|
|
again compiling DS latest commits for native win..
Error with txleveldb on start. A commit broke it. We are thinking its pubkey.cpp and the Ckey changes and should just be key. We are going to make the changes and test. this is one i was going to point out, caused client crash. lets try if you located it right. lets compile again.. edit: looking better(native win wallet), send was a success, no crash, debug is normal;(still some errors..), cpu usage 1% when staking&pow mining, mem 80-110mb old wallet.dat did not work with latest client, so i just created new one. db error is caused sometimes by client not to close properly, it keeps hanging in the backround.(must terminate manually) im going to move thinking about what is wrong with win compile when new algos. |
|
|
|
|
again compiling DS latest commits for native win..
|
|
|
|
|
again compiling DS latest commits for native win..
can say windows is just PURE EVIL!
compile succes but, no, you must leave least one error message when compiling more deps or windows will not be happy.
|
|
|
|
I finally got my silk wallet back up and running and staking away.
Thanks for the advice Spencer
Happy the advice worked out for you Hi SL, What are you recommending for a wallet? and when is the swap feature going to be available? Thanks...Looking forward to this. R When you say what do I recommend for a wallet? Do you mean what hardware to run it on, what type of wallet i.e. headless, core, mobile etc. or do you mean Silk or DarkSilk? Little unsure on the question. Swap will be available from the second Silk launches. Ok...so right now I want to move my Silk from Polo to a local wallet. I'm not sure on how to go about swap Silk for Darksilk but I'm assuming that I should have Silk on my own personal wallet. Im sure you have a FAQ on how to convert Silk to Darksilk...so I'd like to read up on that asap before you guys launch. So for now...what local wallet on a windows PC do you recommend using? Thanks. I'm a bit confused. Is the swap SILK for SLK, or SILK for DRKSLK, or both? xD Thanks The swap is SILK for SLK. DRKSLK willbe a new coin with fresh start. |
|
|
|
Would SILKCOIN could be compared to Verge coin or BATA coin? if yes, what are the advantages?
Those two coins do not even compare to the work involved in Silk, DarkSilk and Weaver. Just because they support I2P and Tor doesn't mean they are anything like Silk, let alone DarkSilk. Go and take a look at the work going into DarkSilk and do some research - https://github.com/scdeveloper/darksilk-release-candidateOr simply wait for the official new thread and OP for all the information. right place to quote... but send me more money!!! more than one node...lots of it! (master chain) D5Vc7sZxmAB3sskMk68zwnnvkvuMRVE9fM im also mining the pow at master br. |
|
|
|
do we have a miner for argon?
No not released yet. and the wallet has no miner.. No realised it is my RPC changes. Argon2d isn't the algo in the Master branch. yep, but argon branch has as i see: uint256 GetPoWHash() const { return hashArgon2d(UVOIDBEGIN(nVersion)); } is there a live chain for it? |
|
|
|
do we have a miner for argon?
No not released yet. and the wallet has no miner.. |
|
|
|
|
do we have a miner for argon?
|
|
|
|
|
Show Posts
