![]() | Directed acyclic graph has been listed as one of the
Mathematics good articles under the
good article criteria. If you can improve it further,
please do so. If it no longer meets these criteria, you can
reassess it. Review: May 26, 2016. ( Reviewed version). |
![]() |
Daily pageviews of this article
A graph should have been displayed here but
graphs are temporarily disabled. Until they are enabled again, visit the interactive graph at
pageviews.wmcloud.org |
![]() | A fact from Directed acyclic graph appeared on Wikipedia's
Main Page in the
Did you know column on 8 June 2016 (
check views). The text of the entry was as follows:
| ![]() |
![]() | This ![]() It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||
|
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)
this webpage has a much much better description of what a DAG is and how it differs from other graphs https://medium.com/fantomfoundation/an-introduction-to-dags-and-how-they-differ-from-blockchains-a6f703462090 — Preceding unsigned comment added by 50.245.17.105 ( talk) 22:03, 2 January 2020 (UTC)
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)
In Bitcoin there are two important DAGs:
-- Nanite ( talk) 19:52, 16 July 2018 (UTC)
Since the blockchain comment above there have been several DLTs that specifically use DACs as a core technology, distinct from blockchain (a series of blocks). The most notable of these is IOTA [1]. The Iota Foundation has released some academic papers [2] and there has been considerable discussion of the DAC technology in the crypto press and outside. Rather than just jumping in and adding a "contentious" DLT section to the main page, I wonder if there could be some discussion here first? Shhh101 ( talk) 17:27, 24 August 2019 (UTC)
Although it was conceived by Aho and Ullman [1]as an acronym, dag was written in lower case (like radar). In this form, it has become a standard computer-science term. I am accordingly changing the article's peculiar upper-case DAG to dag. Mdmi ( talk) 16:48, 10 December 2019 (UTC)
References
I didn't notice the loss of special characters in the preview. My apologies; I should have done a diff. Unlike other commenters, I have always seen the word in lower case. It's in the authoritative algorithms textbook by Cormen, Leiserson, Rivest and Stein, for example. The only hint of DAG that I have encountered is a curious occurrence in the title of a paper by Diomidis Spinellis et al, the body of which consistently uses dag! Given our divergent experiences, it is clear that the article should mention both forms. Agreed? Mdmi ( talk) 02:38, 12 December 2019 (UTC)
"DAG", not "dag", is what I've seen, but it is not used in graph theory aside from the computer science side, and it is an inaccurate name, as it is not an acyclic graph that is directed. The proper descriptive name, generally used in graph theory, is "acyclic directed graph" (or digraph), as it is a digraph without (directed) cycles. Zaslav ( talk) 03:46, 4 May 2022 (UTC)
I did my own MathSciNet search. I got different numbers, possibly because of a different search. Here are my conclusions, starting with the preliminaries.
Final conclusion: I was not convinced by your data (about 2:1 for the dags) but I am convinced by my data (about 6:1 for dags). Objection withdrawn. Zaslav ( talk) 00:35, 7 August 2022 (UTC)
![]() | Directed acyclic graph has been listed as one of the
Mathematics good articles under the
good article criteria. If you can improve it further,
please do so. If it no longer meets these criteria, you can
reassess it. Review: May 26, 2016. ( Reviewed version). |
![]() |
Daily pageviews of this article
A graph should have been displayed here but
graphs are temporarily disabled. Until they are enabled again, visit the interactive graph at
pageviews.wmcloud.org |
![]() | A fact from Directed acyclic graph appeared on Wikipedia's
Main Page in the
Did you know column on 8 June 2016 (
check views). The text of the entry was as follows:
| ![]() |
![]() | This ![]() It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||
|
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)
this webpage has a much much better description of what a DAG is and how it differs from other graphs https://medium.com/fantomfoundation/an-introduction-to-dags-and-how-they-differ-from-blockchains-a6f703462090 — Preceding unsigned comment added by 50.245.17.105 ( talk) 22:03, 2 January 2020 (UTC)
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)
In Bitcoin there are two important DAGs:
-- Nanite ( talk) 19:52, 16 July 2018 (UTC)
Since the blockchain comment above there have been several DLTs that specifically use DACs as a core technology, distinct from blockchain (a series of blocks). The most notable of these is IOTA [1]. The Iota Foundation has released some academic papers [2] and there has been considerable discussion of the DAC technology in the crypto press and outside. Rather than just jumping in and adding a "contentious" DLT section to the main page, I wonder if there could be some discussion here first? Shhh101 ( talk) 17:27, 24 August 2019 (UTC)
Although it was conceived by Aho and Ullman [1]as an acronym, dag was written in lower case (like radar). In this form, it has become a standard computer-science term. I am accordingly changing the article's peculiar upper-case DAG to dag. Mdmi ( talk) 16:48, 10 December 2019 (UTC)
References
I didn't notice the loss of special characters in the preview. My apologies; I should have done a diff. Unlike other commenters, I have always seen the word in lower case. It's in the authoritative algorithms textbook by Cormen, Leiserson, Rivest and Stein, for example. The only hint of DAG that I have encountered is a curious occurrence in the title of a paper by Diomidis Spinellis et al, the body of which consistently uses dag! Given our divergent experiences, it is clear that the article should mention both forms. Agreed? Mdmi ( talk) 02:38, 12 December 2019 (UTC)
"DAG", not "dag", is what I've seen, but it is not used in graph theory aside from the computer science side, and it is an inaccurate name, as it is not an acyclic graph that is directed. The proper descriptive name, generally used in graph theory, is "acyclic directed graph" (or digraph), as it is a digraph without (directed) cycles. Zaslav ( talk) 03:46, 4 May 2022 (UTC)
I did my own MathSciNet search. I got different numbers, possibly because of a different search. Here are my conclusions, starting with the preliminaries.
Final conclusion: I was not convinced by your data (about 2:1 for the dags) but I am convinced by my data (about 6:1 for dags). Objection withdrawn. Zaslav ( talk) 00:35, 7 August 2022 (UTC)