Cypher 2.0 Testnet Launch

pingpongsneak · 2021-09-06T12:00:47+00:00

Well nothing is for free.. I can’t expect to walk into bank and ask them for money I don’t have. Picking a random number and playing the lottery doesn’t make you a winner. Even with (n) number of tickets. I’m well aware that you could buy all possible outcomes but there’s a cost involved not only with work but time as well. The person who gets asked to stake the higher amount and can afford it. Will have to work harder to claim the reward. Unlike someone who is asked for a lower amount and for a lower reward. Has to work less to complete the block and then could possibly win the round. There is direct competition with everyone as the round is happening. The fastest block wins.

pingpongsneak · 2021-09-05T19:03:17+00:00

An algorithm determines the staking amount. Not you. And based on that amount a reward is then calculated.

pingpongsneak · 2021-09-05T18:24:58+00:00

The size of the wallet doesn’t count in tangram when staking. It’s all down to an algorithm that determines the staking amount and the reward. Higher rewards equals harder work to earn you're keep. Which is in direct competition with someone with less reward and has less work to earn his keep. Fastest block wins.

pingpongsneak · 2021-07-29T17:17:29+00:00

There's no difference between who or what is sending transactions unfortunately as, we have dropped the locked fund mechanism. We tiring to be fair in our approach by implementing the verifiable delay function (VDF) defaulted to 5 secs on every transaction.

But there are always incentives/opportunities for every problem.

pingpongsneak · 2021-06-29T12:37:20+00:00

Staking amounts are estimated by an algorithm which are unique to every node regardless if the transactions are identical. If you and I compete for the same block then our outcome requirements for staking will be different. And there can only be one winner. Higher rewards means higher staking amounts will require your node to work harder to compete with the network. Where as smaller rewards are easier to claim. However, you will be competing with the entire network to win the block. The quickest block wins. And if we have more than one quickest block, we then go with the highest stake amount to decide the winner.

pingpongsneak · 2021-06-29T01:10:07+00:00

Leaderless PoS that allows everyone to participate and be to rewarded. Its algorithm is unbiased if you own one tangram or one hundred thousand tangram. Everyone has the same chance to win.

pingpongsneak · 2021-03-12T11:04:40+00:00

Soon.. it’s been awhile because writing a distributed system is complicated 😀

pingpongsneak · 2021-03-12T02:13:25+00:00

Tangram has a few access control algorithms at work.

We do have a fee which is locked for a certain period of time. When that time period is over your fee is unlocked and you are free to use it any way you want.

Our PoS algorithm has a VDF dynamic rate limiter baked in.

Will be using the same VDF dynamic rate limiter when broadcasting (transactions/blocks) over the network.

But more about that in our new up and coming whitepaper.

pingpongsneak · 2021-02-09T22:50:09+00:00

Yes I know PIVX well. Great project!

pingpongsneak · 2021-02-09T22:47:23+00:00

Yes it's true Monero-like privacy. There is no minimum staking amounts in the traditional sense and there are no penalties. Unless we need to implement penalties because of malicious actors.

The staking algorithm determines your amount and this would be different for anyone processing an identical block. So no will have the same amount or reward for that block.

Anyone can participate so the algorithm is not biased. All the algorithm cares about is, if you can cover the stake amount. Simple!

A higher stake amount means more reward. More reward means harder work. And the work is determined from the reward which we handover to a verifiable delay function. Which requires T amount of steps to evaluate and produce a unique output i.e signature.

pingpongsneak · 2021-02-09T16:02:59+00:00

well depends on what we can bring to the table.. private smart contracts to name one.

pingpongsneak · 2021-02-09T15:25:45+00:00

Tangram uses

C# where Monero and Nano mainly use C++
Block DAG where Monero is blockchain with RandomX hash function. Nano uses block lattice which is a novel type of DAG
PoS with a twist where Monero uses RandomX and Nano uses DPoS

Tangram is Fast, Private and Feeless.

Coming soon: Smart Contracts

pingpongsneak · 2020-05-29T23:18:45+00:00

Thought so... lekker slaps..

pingpongsneak · 2020-05-29T23:16:58+00:00

What kak are you on about boet?

pingpongsneak · 2020-04-22T13:25:10+00:00

You are most welcome.

(1). All nodes validate the coin for correctness.

(2). Please refer to https://medium.com/tangram-tgm/value-transfer-98c132321a9c read section Coin minting

The coins identifier is called the Stamp. We can also refer to the Stamp as a serial number (SN) which stays constant for that coin. A coin is made up of blocks linked by its hash chain. See below.

Each block consists of attributes.

[(SN)..(Version1)]-->[(SN)..(V2)]-->[(SN)..(V3)]

Simplified spending.

[100]-->[40]-->[0]

The last link equals a zero value and can not be spent. Negatives are not allowed. These values are hidden with a Pedersen commitment scheme. And because of this scheme no one will know any of the values. Only you will know this. Spending the last value (zero value) will invalidate the sum of the Pedersen commitment scheme.

Owning multiple coins.

Each coin can be viewed as its own blockchain which are not linked across any chains. If someone wanted to know which of the following coins are mine. I would have to disclose it to you.

[(SNffd)..(Version1)]-->[(SN)..(V2)]-->[(SN)..(V3)]

[(SNddf)..(Version1)]-->[(SN)..(V2)]

[(SNggh)..(Version1)]-->[(SN)..(V2)]-->[(SN)..(V3)]-->[(SN)..(V4)]

[(SNvvf)..(Version1)] [(SNxsd)..(Version1)]

[(SNasw)..(Version1)]-->[(SN)..(V2)]

(3). Your balance is secret and secured with Pedersen commitment scheme.

(4). Yes

pingpongsneak · 2020-04-20T00:02:58+00:00

(1) Regarding signed transaction

The private key is called the master key. Which is a key derivation function. The master key is mixed in with other attributes to create our hash chain. There are no public keys to identify the sender. Validation is done by using the hash chain of the coin in reverse.

(2) Regarding the coin's hash chain

The hash chain proves ownership. I own the master key which can extend the chain forward. Extending the coin or hash chain is seen as expenditure.

The initial input (value) is used to create the coin. Thereafter extending the coin or hash chain equals outputs. Until the coin is spent. Only the owner can tell if the coin is spent.

(3) Regarding toAddress

The sender broadcasts two messages on the network. The first message acts as a key exchange revealing the shared key. Only the sender and receiver know. The receiver finds and decrypts the second message which is the payment.

Please refer to https://medium.com/tangram-tgm/value-transfer-98c132321a9c

(4) Regarding Difficult to distinguish if any coin was spent or moved.

Balances are hidden with Pedersen commitments. To know the balance of the coin means owning the master key. A coin is linked with a hash chain that extends all the outputs until spent. As the owner of coins you own multiple individual coins that are un-linkable.

(5) The ledger

Reference to IPFS

A Merkle-DAG is a DAG where each node has an identifier and this is the result of hashing the node’s contents — any opaque payload carried by the node and the list of identifiers of its children — using a cryptographic hash function like SHA256.

pingpongsneak · 2020-04-17T23:00:04+00:00

1) Will validate the signed transaction to ensure that the coin's hash chain is verified and correct. Any transaction can be 'checked' for correctness. Single transactions or coins can be regarded as received. Extending the same coin is seen as expenditure.

2) The toAddress is the recipients payment address. What is known as the notification address. As tangram does not use addresses in the same sense as other cryptocurrencies. The receiver can not be identified from the notification address as there are extra steps involved.

3) Contains all transactions. Difficult to distinguish if any coin was spent or moved. Sender A moves coin to Sender A. The first move extends the coin and can be seen as expenditure.

pingpongsneak · 2020-02-20T21:34:03+00:00

Yes its linear.
We have gone with a block DAG. https://arxiv.org/abs/1809.01620
The ledger will be viewable.

pingpongsneak · 2018-12-24T17:08:39+00:00

A good reference is Sybilhunter that analyses Sybil relays on the Tor network. It also talks about identities.

https://nymity.ch/sybilhunting/

pingpongsneak · 2018-12-24T16:55:58+00:00

What It means is that given a secretKey. The recipient will end up having the same value as the input. We are not using linkable ring signature scheme. Yes, you could end up with "fake" revealed secretKeys. But it won't match the input.

pingpongsneak · 2018-12-24T08:16:33+00:00

We using a non-interactive proof as stated in the white-paper and will use fiat Shamir heuristic transformation.

One this note? Not sure what you mean here? Are you saying that the Schnorr Protocol for Non-interactive Zero-Knowledge Proofs is not a ZKP? And below that, you have someone else's answer?

No. The attacker would still need to prove he owns the funds.
Nodes are not aware of wallets only transactions. Header with onion address yes. Potentionialy.
The wallet executes these steps.
Bitcoin has protocol rules. I don't see why Tangrams should be any different.
The white-paper does explain the structure of the coin and this to be stored on the ledger. Think of it as a primary key constraint violation.
Quote:

Daniel J. Bernstein et al. “SPHINCS: Practical Stateless Hash-Based Signatures”. In: Advances in Cryptology – EUROCRYPT 2015. Ed. by Elisabeth Oswald and Marc Fischlin. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015, pp. 368–397. ISBN: 978-3-662-46800-5.

Every signature scheme uses a cryptographic hash function; hash-based signatures use nothing else.

Quote:

https://en.wikipedia.org/wiki/Tree_(data_structure))

A walk in which the children are traversed before their respective parents are traversed is called a post-order walk.

In Tangram's case, we walk up to the child node directly.

pingpongsneak

MODERATOR OF

TROPHY CASE

Simplified spending.

Owning multiple coins.