Thank you for letting me know about the Cuckoo Cycle algorithm. I remember hearing it once, but never did a deeper digging on how it works. Will definitely now.

After some research I have concluded that the original TSP does not fit as PoW since verifying the solutions requires NP time.

However, in a modified version of TSP where we try to find a route < GIVEN_LENGTH the solution verification can be done in P time.

Hi

I'm just wondering if the Travelling salesman problem could be used as a PoW algorithm?

Hi

Just wanted to share this project of mine: a super simple blockchain implementation in 200 lines of code

https://github.com/lhartikk/naivechain

We were having a brief shortage of SHA256 genesis blocks.

Well.. it would require some implementation and there is not too much demand for that...

Support for x11 algorithm added.

I guess the "risk" lies more on the side of "creating a raw transaction in command line" rather than in the "delayed transaction" concept itself.

Haha.

Broadcast and pray.

Yeah. The "owner" of the destination address must broadcast the transaction.

The steps to create a delayed bitcoin transaction:

http://blog.coincreator.net/jekyll/update/2015/03/07/delayed_transaction.html

Yeah.. I guess it can't solve the genesisblock of e.g. PeerCoin. There are some different "magic numbers" in the block, at least the CBigNum(4) -> CBigNum(9999)

https://github.com/bitcoin/bitcoin/blob/0.8/src/main.cpp#L2779
https://github.com/ppcoin/ppcoin/blob/master/src/main.cpp#L2272

Can you be more specific?
The script accepts a value parameter:

Remember to add the server=1 in your conf file so the qt wallet opens the rpc port.

>bitcoin derivative services
>accepting fiat

whatttt

Thanks for the response. I set the sequence number to 0 and after that my bitcoind didn't broadcast the transaction until the given block height was reached:


After the block height was reached I finally got the transaction in the block chain as expected:
https://blockchain.info/tx/d61839fb690395ba638ba804c5af4bf0111ff269ca1e0b251cff737ca6189557


I hope all nodes will relay (now and in future) transactions with custom nLockTimes and sequences!

Hhhm.. the nLockTime is not working.

I created a transaction with locktime = 630000 but it is still included in the blockchain

https://blockchain.info/tx/18b598bd76110151d6bea797d3c10bcfdc44454303da6d74fbd3f15c5e851d0a

I'm trying to create create a delayed transaction for myself. I'm using nLockTime and the following steps. The situation what I'm trying to reach is that there are 1 BTC that is not reachable until 10 000 blocks are found.

Are the following steps correct?

1. I create a new key-address pair. (KEY1 1Address1)
2. I send 1BTC to address 1Adddress1
3. I create new key-address pair. (KEY2 1Address2)
4. I create a transaction with nLockTime (currentblockheight + 10000). The input is 1Address1 and output 1Address2. I sign it with KEY1. HOWEVER, I do not broadcast the transaction.
5. I destroy KEY1.
6. Now I have a transaction, which is now valid until 10 000 blocks are found and I store it. After 10 000 blocks are found I broadcast the transaction and unlock the bitcoins with KEY2.

Does this work or can I just replace the nLockTime in the transaction with 0, so the transaction becomes instantly valid?

Unlike most altcoins, there would be no reward halving: e.g. every block will _always_ contain 1000 coins.

This way, there is really no "incentive" to mine and hold coins. But they can be spent e.g. for voting or injecting stuff to the blockchain.

Just popping some ideas here..

The coins would be traced to the block they were created in. If that block is e.g. "1000 blocks old" the coins are invalid.

Added X11/X13/X15 support.

Altcoin where coins become unusable after some time? (so you have to use them)

Are there any?