marcus03
|
|
February 12, 2014, 06:50:01 PM |
|
Do we have a client configured for testnet that I could specify the new asset quantity and the fees separately?
1000 NXT is the minumum fee for issuing an asset.
|
|
|
|
|
|
|
|
|
"You Asked For Change, We Gave You Coins" -- casascius
|
|
|
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction.
|
|
|
|
Coinonaer
|
|
February 12, 2014, 06:55:57 PM |
|
Hi Gang, please send my some Test-Nxt for the Asset Exchange: 11843877519810994380 Thank you all!
|
|
|
|
farl4web
Legendary
Offline
Activity: 1205
Merit: 1000
|
|
February 12, 2014, 06:57:35 PM |
|
forget stupid nxt memes and doge copycats and concentrate on this. btc has technical troubles due to its transaction malleability issues. this is the time to strike with nxt promotion(hoping that it is solid ) +1 start our promotion and swarm actions!
|
|
|
|
rriky92
|
|
February 12, 2014, 06:58:08 PM |
|
Do we need this command everytime we start NRS, or forging is started automatically with the start of NRS? i think every time you start the client (not the GUI version but the java one) you have to run this command, so after a reboot or similar... but i'm not sure maybe Jean-Luc or CfB can answer better than me
|
|
|
|
wesleyh
|
|
February 12, 2014, 07:02:53 PM |
|
@CFB - one can buy with nxt cents, but can you also enter an amount such as 1.3 silver or is that restricted to round numbers?
|
|
|
|
Come-from-Beyond
Legendary
Offline
Activity: 2142
Merit: 1009
Newbie
|
|
February 12, 2014, 07:04:55 PM |
|
@CFB - one can buy with nxt cents, but can you also enter an amount such as 1.3 silver or is that restricted to round numbers?
Only whole numbers allowed for qty.
|
|
|
|
ChuckOne
Sr. Member
Offline
Activity: 364
Merit: 250
☕ NXT-4BTE-8Y4K-CDS2-6TB82
|
|
February 12, 2014, 07:05:25 PM |
|
Scripts will be slower and larger anyway.
Maybe, what do u suggest? Well, I believe that most people will use a high-level language to scipt their programs. I don't even know a high-level language without a concept that resembles functions and function calls. That does not necessarily mean anything because I will always know a limit amount of them. But, under this assumption, they will implement a stack anyway because they simply have to. Why not making it easier for compilers to provide such stack functionality? In case of an VM: most high-level languages in which such a VM could be written have libraries for data-structures like stacks and queues. In the case somebody wants to write a JIT (compile the script down to the actual machine): most modern processors provide a concept such as a stack pointer which would make such compiler easier, too. Are there some flaws or disadvantages when defining a stack on this low level?
|
|
|
|
iruu
|
|
February 12, 2014, 07:07:23 PM |
|
Ok, so what opcodes would u add to my set?
I'm not sure about your notation of addresses. So I'm going to assume 'm' is an address of m and [m] is a value under m. 1. All jump instruction with a constant or memory arguments. Why only memory? 2. All arithmetic and boolean operations with constants also. No point inputting constant values into temporary memory places. 3. call with arguments, push, pop, ret n instruction. 4. Allow indirect indexes. So you could write [m1+[m2]] meaning m1[m2] or [m1+constant]. This will shorten use of arrays considerably. 5. Allow shifting addresses by a constant, ie. multiplying by a power of 2. [m1+[m2]*2] or *4, 8. x86 does this also. This eliminates the need to create a temporary variable, shift it, and then use it as an index. 6. Allow different operand sizes, the way x86 and amd64 does it. Currently to input a byte you would need to first (1) mask your value with and, then (2) shift it, then (3) mask the output with and, then (4) or the value in place. Four instructions for a common operation. So a move instruction would look like: mov size[address], constant mov size[address], [address2] where size is one of: byte, word, dword, qword. Same for boolean and arithmetic operations. 7. An instruction which allows calculation of addresses generated by a (4)+(5) form. The equivalent in x86 is called lea. For stack: just designate memory at address 0 as a 32 bit stack pointer. Very simple to implement, and the scripting codes will be drastically shorter and faster due to that.
|
|
|
|
Anon136
Legendary
Offline
Activity: 1722
Merit: 1217
|
|
February 12, 2014, 07:09:46 PM |
|
wolfe?
|
Rep Thread: https://bitcointalk.org/index.php?topic=381041If one can not confer upon another a right which he does not himself first possess, by what means does the state derive the right to engage in behaviors from which the public is prohibited?
|
|
|
Come-from-Beyond
Legendary
Offline
Activity: 2142
Merit: 1009
Newbie
|
|
February 12, 2014, 07:12:21 PM |
|
Are there some flaws or disadvantages when defining a stack on this low level?
Yes, it's hard to predict how much memory u'll need if u heavily exploit stack by using recursions and similar stuff.
|
|
|
|
wesleyh
|
|
February 12, 2014, 07:14:27 PM |
|
@CFB - what is the nr of decimals allowed after comma for price?
2? or unlimited?
|
|
|
|
Come-from-Beyond
Legendary
Offline
Activity: 2142
Merit: 1009
Newbie
|
|
February 12, 2014, 07:20:45 PM |
|
Ok, so what opcodes would u add to my set?
I'm not sure about your notation of addresses. So I'm going to assume 'm' is an address of m and [m] is a value under m. 1. All jump instruction with a constant or memory arguments. Why only memory? 2. All arithmetic and boolean operations with constants also. No point inputting constant values into temporary memory places. 3. call with arguments, push, pop, ret n instruction. 4. Allow indirect indexes. So you could write [m1+[m2]] meaning m1[m2] or [m1+constant]. This will shorten use of arrays considerably. 5. Allow shifting addresses by a constant, ie. multiplying by a power of 2. [m1+[m2]*2] or *4, 8. x86 does this also. This eliminates the need to create a temporary variable, shift it, and then use it as an index. 6. Allow different operand sizes, the way x86 and amd64 does it. Currently to input a byte you would need to first (1) mask your value with and, then (2) shift it, then (3) mask the output with and, then (4) or the value in place. Four instructions for a common operation. So a move instruction would look like: mov size[address], constant mov size[address], [address2] where size is one of: byte, word, dword, qword. Same for boolean and arithmetic operations. 7. An instruction which allows calculation of addresses generated by a (4)+(5) form. The equivalent in x86 is called lea. For stack: just designate memory at address 0 as a 32 bit stack pointer. Very simple to implement, and the scripting codes will be drastically shorter and faster due to that. Let's try this way. I'll need some time to structurize all this stuff and then will publish another version of opcodes.
|
|
|
|
Come-from-Beyond
Legendary
Offline
Activity: 2142
Merit: 1009
Newbie
|
|
February 12, 2014, 07:21:10 PM |
|
@CFB - what is the nr of decimals allowed after comma for price?
2? or unlimited?
2
|
|
|
|
abctc
Legendary
Offline
Activity: 1792
Merit: 1038
|
|
February 12, 2014, 07:23:46 PM |
|
please send my some Test-Nxt for the Asset Exchange: 11843877519810994380
- 5k testNXT sent
|
██████████████████████████████████████████████████ ████████████████████████████████████████████████████ ██████████████████████████████████████████████████████ ████████████████████████████████████████████████████████ ████████████████████████████████████████████████████████ ████████████████████████████████████████████████████████████████████ ████████████████████████████████████████████████████████████ ██████████████████████████████████████████████████████████████ ████████████████████████████████████████████████████████████████ ██████████████████████████████████████████████████████████████████ ████████████████████████████████████████████████████████████████████ | , the Next platform. Magis quam Moneta (More than a Coin) |
|
|
|
tman10
Newbie
Offline
Activity: 21
Merit: 0
|
|
February 12, 2014, 07:48:33 PM |
|
Whats up with Bter...SCAM??
|
|
|
|
tman10
Newbie
Offline
Activity: 21
Merit: 0
|
|
February 12, 2014, 07:56:14 PM |
|
Whats up with Bter...SCAM??
whats goin on? its probly to do with whats happening to all the rest of the exchanges I have transactions pending for 2 days
|
|
|
|
SkillRoad
Member
Offline
Activity: 112
Merit: 10
|
|
February 12, 2014, 07:57:31 PM |
|
Whats up with Bter...SCAM??
Transactions are very long time
|
|
|
|
jl777
Legendary
Offline
Activity: 1176
Merit: 1132
|
|
February 12, 2014, 08:06:52 PM |
|
@CFB - what is the nr of decimals allowed after comma for price?
2? or unlimited?
2 How long would it take to add support for two types of Assets, fixed and variable, along with the ability to change the amount of variable Asset? If there was an Asset type field, with 0 for current one, 1 for dynamic, then we can always add other types later with new properties. I have a solution for fully automated gateways, but it requires people to trust the hardware + software that operates it, so the simpler the code is, the easier for people to understand that the code is clean.
|
|
|
|
iruu
|
|
February 12, 2014, 08:11:14 PM |
|
Regarding scripting: is this supposed to only apply to transactions? Perhaps accounts itself could be scripted in the same way? Instead of separate account control, just make it so that it's possible to set an account one script. Each outbound transaction would have to be accepted by the script. It would solve several problems at the same time: complicated escrow/multisig, account security (only allow one withdrawal address), allow a form of 2 factor authentication, allow pooled bets on assets/currencies on decentralized exchange, inheritance, possibly other things I didn't think about
Or was it supposed to apply to accounts from the start?
|
|
|
|
Eadeqa
|
|
February 12, 2014, 08:13:58 PM |
|
|
|
|
|
|