pEOS Wallet already enabled staking and has private transactions using scatter allowing us to anonymize any peos balance.
.Using the power of the EOSIO Blockchain pEOS transactions are hundreds of times and can be thousands of times faster than Bitcoin.
pEOS allows for a privacy Bitcoin could never offer using ring signatures. pEOS can be traded for Steem/EOS and then Bitcoin
The world will have an insatiable apetite for privacy tokens once the private protocol is built into a wide range of eosio dapps from TELOS to PSO
pEOS will allow for private exchanges
Ever heard of Ring signatures? pEOS is like Monero but faster. Here’s some exerpts from pEOS White Paper for an a look on how pEOS works
“Would you openly share your entire financial history? If your answer is no, then you should avoid transacting with non privacy focused cryptocurrencies. Even though internet came with a strong privacy focused culture, we are now living in an age when some of the most successful internet business models involve trading personal information and user insights. In a future when mass adoption of non privacy focused cryptocurrencies occurs, the transaction history of people’s finances will be accessible to anyone with the technical capability to reveal it through blockchain analysis. As soon as they manage to match an ID with a cryptocurrency address they can start unravelling the ID’s entire transaction history.”– pEOS WhitePaper
Here’s some exciting pEOS Math for those that can understand it!
“So if we have a transaction with input amounts a1, a2,…an and output amounts b1, b2, …, bm , then the contract should be able to verify that: ∑ i ai − ∑ j bj = 0
We are able to verify that without revealing the actual amounts using Pedersen Commitments . Pedersen commitments have the property that if and are the 1 commitments of and respectively, then: Working with elliptic curve cryptography allows to define a commitment as . Since , the commitment is additively homomorphic as required.
We are able to verify that without revealing the actual amounts using Pedersen Commitments . Pedersen commitments have the property that if and are the 1 commitments of and respectively, then: C(a + b) = C(a) + C(b)
Working with elliptic curve cryptography allows to define a commitment as C(a) = aG
Since (a + b)G = aG + bG the commitment is additively homomorphic as required.
However, in order to remove the ability to correlate amounts to their commitments, we add a blinding factor. Consider a new EC generator point H such that H = γG with γ being an unknown scalar. Then we define the commitment of value to be C(x, a) = xG + a H where is the blinding factor. Therefore we disable the possibility to statistically derive from its commitment. “
pEOS.me 619 500 3748
Mon - Sun, 24/7