This is actually wrong. This project seems like its run by scammers or copycats. There aren’t real pictures of the people (just cartoons) and I don’t think there was an attempt to even reach out to the Hashgraph guys - just to make a quick buck creating an ICO based on technology that wasn’t theirs.
"Small changes" do not make a protocol unique and all DAGs are not created equal, nor are they all similar. I have read the white paper and patents and the innovation of the Swirlds Hashgraph was virtual voting and gossip about gossip. These are actually very substantial innovations and differentiate it completely from other DAGs e.g. IOTA, DAGchain, Byteball etc. It is what allows the Swirlds Hashgraph to have the speed, fairness and security properties that it has. These characteristics make it very unique, which is why a patent was awarded in the first place.
You cannot simply “get around” innovation / patents with “small changes” like the people behind this project suggest above. You would most likely still be breaking the patent but that is not even the main problem - the main problems are:
1) By making "small changes" to an innovative technology you didn’t create, instead of inventing your own, you are indicating to the market that you cannot be innovative yourselves, because you want a quick cash grab from an ICO.
2) You are launching what is essentially an ICO based on someone else's hard work.
3) You are launching an ICO which could be illegal.
4) If you guys do get into a lawsuit, there goes the value of the project
In summary, you cannot simply make “small changes” and say “see it just looks like other DAGs" and have a new protocol. DAGs have different properties, and the Hashgraph one is especially different. Ask a lawyer and you’ll see I’m right.
And more importantly, this isn’t the way legitimate projects work. Be innovative and ICO that. Don’t be copycats just trying to get around patents and making "small changes" to a technology that you didn't invent. I would never buy into an ICO like that.
You have missed the whole concept here.. sorry. It will not be a copy of anything. We are moving away from using a hashgraph, it will not be used anymore. We are creating our own consensus protocol and it will unique in crypto. If you want a technical discussion i can take that anytime with you on slack. DAG currencies share the same basic principles, how you handle consensus is a different issue. Please join slack and i will explain how it works because you obviosly dont have a clue.
I see that you also are somewhat affiliated with Swirlds. You can tell them that we wont use their work... gossip protocols have been around for ages. If you look at their work its based on someone elses. We have studied this a lot and have
several lawyers involved. Please dont suggest anything else that we dont know what we are talking about here.
We will not use their hashgraph, because we dont need to. We will use our own implementation, period. White paper, website and all of the branding will be redone during the upcoming weeks. Second, swirlds patent might actually break rules as well. We have found papers dating back to 2014 that is very very similar to their work, its nothing unique. I think you can imagine that the crypto community will not receive a closed source or a closed ledger cryptocurrency that is patented very well... people just dont trust their money with it. Actually its hilarious. Our version will be open source, it will be similar in efficiency.
Second, show me a open source cryptocurrency that is leaderless and is based on a DAG that got high performance tx speeds and is performance efficient... this is what Prisma is.
Third, do you really think that our PhDs in our team would risk their academic reputation by creating something like a scam?
Before you join our slack, read up on DAGs and this paper
"Scalable and leaderless Byzantine consensus in cloud computing environments.", if you recognize anything from this paper, let me know.
Authors:
JongBeom Lim
·
Taeweon Suh
·
JoonMin Gil
·
Heonchang Yu
/Joey - lead developer