Data Flow and Dependancy Map
Copyright © 2014-2017 by David A. Falk



attempts to calculate a chronology in much the same way that a human being does. The program takes an anchor date and a list of kings with their reign lengths, and calculates the absolute dates for that list of kings. In the case of the short chronology, the chronologies are derived from the few firm dates which are earlier than the 5th century BCE. The two anchor dates used in this case by are the Battle of Carchemish (605 BCE) and the Death of Taharqo (664 BCE).

And like any human chronologist, calculates subsequent king lists from the lists that are already derived. This results in a data flow, where one list forms a dependancy for many subsequent lists. Where a two-way arrow is found, this is an indication that a recursive refining technique has been used, which increases the accuracy of the final results. From this dataflow, an entire low chronology of the ancient Near East can be constructed.

There has also been the suggestion that chronology owes its greatest contribute one particular discipline whether that be Assyriology or Egyptology (as it was suggested by Hornung, p.8). One of the capablities of is its ability to trace the routes of data dependancies that are used to create the entire chronology. Below is the output of the routing data, represented as an image:



The two anchor dates seed the chronologies of the Neo-Assyrian, Babylonian (8th Dynasty), and Egypt's Dynasty 25. As can be observed from the chart, the Neo-Assyrian chronology has the most impact upon extended king lists, influencing over half of the chronologies of the ancient Near East. Egypt and Babylon's scope appears to be more limited in effect. Given the relationship between the beginning of Egypt's Second Intermediate Period and the end of Egypt's Dynasty 13 is very uncertain, the chronology of Middle Kingdom Egypt cannot be inferred from the Egyptian data but must be derived from the synchronisms that Dynasty 13 had with the Babylonian 1st dynasty.