Unverified60% confidenceFactExact time
Git's commit history is, at the data structure level, a Merkle DAG (Directed Acyclic Graph), where each commit object contains the tree hash and the hashes of zero or more parent commits.
2
Sources
60%
Confidence
Long-term
Relevance
7/9/2026
First Seen
Sources
Git Hash Chain Malleability: How Fragile Is the Immutability You Trust?
hackernewshackernews7/7/2026
Related Claims
UnverifiedGit's underlying data structure is a directed acyclic graph (DAG), where each commit is an immutable node containing the hash of a tree object.76% similarUnverifiedIn the Git object model, every blob, tree, commit, and tag object uses a content hash as its unique identifier, and parent commit hashes are included in child commit content to form a chain structure74% similarUnverifiedGit records each commit using a directed acyclic graph data structure, with each commit pointing to its parent commit.72% similarVerifiedGit uses a directed acyclic graph (DAG) to organize commit history, where each commit node points to its parent node, and a branch is a movable pointer to a specific commit.72% similarUnverifiedGit中每一个commit、tree、blob对象都由其内容的SHA-1摘要唯一标识70% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/313758API
curl https://kongchang.com/api/v1/knowledge/claims/313758MCP
get_claim(id=313758)