Talk:Directed acyclic graph

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Mathematics (Rated GA-class, Mid-importance)
WikiProject Mathematics
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of Mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Mathematics rating:
GA Class
Mid Importance
 Field: Discrete mathematics
WikiProject Computer science (Rated GA-class, High-importance)
WikiProject icon This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
 GA  This article has been rated as GA-Class on the project's quality scale.
 High  This article has been rated as High-importance on the project's importance scale.
 

Intelligibility[edit]

The introduction needs a major re-write to make it intelligible to the lay reader. It might make sense in a mathermatics text book but comes across as so much gobbledegook to someone wishing to know what a DAG is and how it might be used. LuciusAeliusSejanus (talk) 12:29, 28 October 2016 (UTC)

Although we have already taken significant efforts to make the article as accessible as possible, I'm sure more improvement is possible, and specific suggestions for improvement would be welcome. However, "as accessible as possible" does not and cannot mean "instantly understandable to the mathematically illiterate", and vague complaints without any specific ideas for improvement are not helpful. Please read the FAQ on Wikipedia talk:WikiProject Mathematicsfor more context concerning the type of complaint you seem to be making, which is not new (Royal Road#A metaphorical “Royal Road” in famous quotations) and is (as the link suggests) a frequently asked question on many mathematics articles. —David Eppstein (talk) 20:01, 28 October 2016 (UTC)


Blockchain[edit]

Probably should be added reference to some Blockchain technology such as Ethereum

Before you can find any blocks, however, your computer needs to go through a process called “building a DAG”. This DAG (short for “Directed Acyclic Graph”) is a large data structure (~1GB) required for mining, intended to prevent ASIC machines (“Application Specific Integrated Circuits”) from being mass manufactured for mining ether. Its goal is to protect miners like yourself, so that you will only ever need your home computer to remain competitive. The DAG should take about 10 minutes to generate and as soon as it finishes, Geth will start mining automatically. — Preceding unsigned comment added by 103.30.92.71 (talk) 20:00, 21 November 2016 (UTC)

The Ethereum article has no description on how it uses DAGs. Do you have published reliable sources that detail the connection between the blockchain data structure and the mathematical meaning described in this article? —David Eppstein (talk) 21:09, 21 November 2016 (UTC)