Quote from: German Klimenko on January 10, 2018, 01:12:06 PM

It is hard to understand what is really scam and what is just FUD. I remember it was scam alrerts on DeepOnion or Worldcore and I see how much profit have gain the people who invest money and time to this "scam projects"

Here is the proof:

Quote from: Bitcoin Forum

A reply of yours, quoted below, was deleted by the starter of a self-moderated topic. There are no rules of self-moderation, so this deletion cannot be appealed. Do not continue posting in this topic if the topic-starter has requested that you leave.

You can create a new topic if you are unsatisfied with this one. If the topic-starter is scamming, post about it in Scam Accusations.

Quote

Quote from: felixando on January 06, 2018, 02:05:00 AM

Hi Stone supporters, apologies for the variance in communication over the last two days, a little technical insight into what stage right now, and what is currently filling my time.

https://i.imgur.com/eG6RWdn.png https://i.imgur.com/IWXBH9V.png
A DAG G Transitive reduction of G

If G is a DAG, its transitive closure is the graph with the most edges that represents the same reachability relation. It has an edge u → v whenever u can reach v. That is, it has an edge for every related pair u ≤ v of distinct elements in the reachability relation of G, and may therefore be thought of as a direct translation of the reachability relation ≤ into graph-theoretic terms. The same method of translating partial orders into DAGs works more generally: for every finite partially ordered set (S, ≤), the graph that has a vertex for each member of S and an edge for each pair of elements related by u ≤ v is automatically a transitively closed DAG, and has (S, ≤) as its reachability relation. In this way, every finite partially ordered set can be represented as the reachability relation of a DAG.

The transitive reduction of a DAG G is the graph with the fewest edges that represents the same reachability relation as G. It is a subgraph of G, formed by discarding the edges u → v for which G also contains a longer path connecting the same two vertices. Like the transitive closure, the transitive reduction is uniquely defined for DAGs. In contrast, for a directed graph that is not acyclic, there can be more than one minimal subgraph with the same reachability relation.

With the 'Transitive reduction of G' it will bring some sense of privacy ontop of zk-SNARK's, which effectively will make it more secure than ZCash Cool

Whilst i don't want to make any promises right now, i'm looking at getting another developer onboard, with the development funds provided, to get the project completed quicker, as its proving to be quite the task and larger than originally expected, are we all happy for this to go ahead? I'm also looking to get a roadmap out the door at some stage!, possibly within the next two weeks, i have quite the treat prepared in terms of a roadmap, just need to get it projected onto a graphic.

I appreciate all the donators so far, and i will be responding to PM's when i can, i will just need a little longer than usual, thank you.

felixando

I'm "specialized" in DAG and here is just a copy and paste from wikipedia. .

https://en.wikipedia.org/wiki/Transitive_reduction

I participated in writing this Wikipedia page and transitive reduction has nothing to do with privacy.

I don't know whether the project is a scam or not but it's clearly very poorly documented and i'm not even sure you understand what DAG and the math behind are.

If you are legit, and just need help to understand stuff, then you can contact me.

So you copy-paste random things from Wikipedia, you make conclusion which are no sense, you get challenged, and you just delete the post instead of explaning how it will work.

That's a SCAM 100% sure !!!!