A shell-native cd-compatible directory jumper using power-law frecency
Get picks like this daily. Today's launch numbers, the top launches, AI and tech news, and a daily opportunity pick, straight to your inbox.
Want to reach these readers? Sponsor an issue.
I have used this tool privately since 2011 to manage directory jumping. While it is conceptually similar to tools like z or zoxide, the underlying ranking model is different. It uses a power-law convolution with the time series of cd actions to calculate a history-aware "frecency" metric instead of the standard heuristic counters and multipliers.This approach moves away from point-estimates for recency. Most tools look only at the timestamp of the last visit, which can allow a "one-off" burst of activity to clobber long-term habits. By convolving a configurable history window (typically the last 1,000+ events), the score balances consistent habits against recent flukes.On performance: Despite the O(N) complexity of calculating decay for 1,000+ events, query time is ~20-30ms (Real Time) in ksh/bash, which is well below the threshold of perceived lag.I intentionally chose a Logical Path (pwd -L) model. Preserving symlink names ensures that the "Name" remains the primary searchable key. Resolving to physical paths often strips away the very keyword the user intends to use for searching.
HN · launched Mar 4, 2026 · 26 upvotes (top 22%) · 0 views
Niche: command line productivity tools · 85 launches, 3 in the last 7 days ▼ -50% · Explore this niche →
Category and tags
- Horizontal
- Dev tools
- Developer
- Not AI
- Hobby / open-source project
Visit website ↗ Source listing ↗
More like this: all 85 launches in command line productivity tools →
Could you build this?
Partial While basic directory jumping shell scripts are simple, implementing a custom power-law convolution frecency algorithm in a low-latency native binary requires rigorous mathematical and systems programming.
What it would actually take: The tool requires an ultra-low-latency native binary (written in C, Rust, or Go) executed on every shell prompt hook without perceptible delay (<5ms). It requires implementing a discretized power-law kernel convolution over timestamped directory transitions, managing atomic binary file persistence to prevent concurrent terminal race conditions, and shell integration across zsh/bash/fish. Mathematical modeling of decay processes and systems-level POSIX shell profiling are required.
Discussion
16 comments analyzed.
Competitors mentioned: zoxide, z, CDPATH with manual aliases, pushd/popd, CTRL-R shell history search
Concerns raised: Requires learning new commands vs. standard cd behavior, 9-30ms latency overhead per cd action, Complexity not justified for users with small, stable project sets, Power-law ranking may not matter in practice vs. simpler heuristics
Feature requests: O(1) frecency computation instead of O(N) window recomputation, Interactive directory selection with fzf integration, Configurable power-law exponent and attention span tuning
Competitors
Other products that read as similar to this one : 146 launches clear the similarity bar, closest 8 shown.
Attention rank: #33 of 147 (itself plus its competitors, highest first, normalized so YC and Product Hunt are compared fairly).
Launched 117 days after the earliest competitor.
- Ze.sh · hn · 2026-06-22 · 5 upvotes · similarity 0.69
- gash · github · 2026-11-06 · 100 upvotes · similarity 0.47
- hop · github · 2026-09-11 · 7 upvotes · similarity 0.43
- fsearch · github · 2026-10-08 · 1945 upvotes · similarity 0.42
- Kosh · hn · 2026-08-28 · 7 upvotes · similarity 0.41
- disktree · github · 2026-10-17 · 15 upvotes · similarity 0.41
- FinderSearch · github · 2026-10-09 · 657 upvotes · similarity 0.41
- jev-shell-history · github · 2026-09-18 · 100 upvotes · similarity 0.40
The niche, labels, vibe code rating and competitor comparison on this page are analysis by Nicheloom. If you use them, please credit nicheloom.com. How you may use our data.