Home Projects haft
haft
Go

haft

Engineering decisions engine that know when they're stale. Frame, compare, decide — with evidence decay and parity enforcement. For Claude Code, Cursor, Gemini CLI, Codex and more.

by m0n0x41d · GitHub
Stars
Forks
Trending
Created
Last commit
Category
Language
ai-agentsai-codinganthropicGo
View on GitHub
In plain words

Make informed engineering decisions by tracking evidence and comparisons in your AI projects.

You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
haft — GitHub preview card
📈 Star history
1.39k1.37k
2026-07-202026-08-31
📈 Track haft

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

Engineering decisions engine that know when they're stale. Frame, compare, decide — with evidence decay and parity enforcement. For Claude Code, Cursor, Gemini CLI, Codex and more.

haft has 1.4k stars on GitHub. It has been forked 102 times. haft is written mainly in Go. It has been in active development since 2025. Its main topics are ai-agents, ai-coding, anthropic, claude.

Frequently asked questions

What is haft?

Engineering decisions engine that know when they're stale. Frame, compare, decide — with evidence decay and parity enforcement. For Claude Code, Cursor, Gemini CLI, Codex and more.

Is haft open source?

haft is an open-source project.

Is haft free?

Yes. haft is free and open source — you can use, modify and self-host it.

What language is haft written in?

haft is written mainly in Go.

🏅 Maintainer of this project?
olud.ai badge — haft

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=m0n0x41d-haft)](https://olud.ai/project/m0n0x41d-haft.html)
More badge options →
🧬 Shares DNA with🧬 View the DNA map →

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.