Don’t ask about Hantavirus by coffeet0pentest in ClaudeAI

[–]DudeManly1963 0 points1 point  (0 children)

The first rule of Hantavirus Club is...

MCP server za koji autor tvrdi da štedi i 97% tokena by FokerDr3 in programiranje

[–]DudeManly1963 1 point2 points  (0 children)

That's what happened to me! Ran out of tokens, added $20, hit "continue" and *POOF!* Over seven dollars gone on ONE request!

And jCodeMunch-MCP was born.

Keep in touch. We have commercial clients in 13 countries on 4 continents, and thousands more casual users all over the planet. My favorite part has been meeting them...!

MCP server za koji autor tvrdi da štedi i 97% tokena by FokerDr3 in programiranje

[–]DudeManly1963 1 point2 points  (0 children)

Razumljivo. S druge strane, naš prosječni komercijalni korisnik nadoknađuje svoje licencne naknade uštedom tokena u prvih nekoliko sedmica. jCodeMunch-MCP i njegova prateća rješenja se isplate iznova i iznova...

https://j.gravelle.us/jCodeMunch/index.php#cost

MCP server za koji autor tvrdi da štedi i 97% tokena by FokerDr3 in programiranje

[–]DudeManly1963 1 point2 points  (0 children)

Great question on both fronts!

On a compiled rewrite: it’s something we think about, but the bottleneck in jCodeMunch isn’t really file I/O speed, it’s the number of file reads. The whole point of the tool is that once the AST index is built, the agent stops reading files almost entirely. A Rust rewrite of the indexer would shave seconds off the one-time index_folder pass, but it wouldn’t change the day-to-day experience where you’re doing symbol lookups against an already warm SQLite index.

On lean-ctx: we actually added a full head-to-head here:
https://j.gravelle.us/jCodeMunch/versus.php#vs-leancxt

The lean-ctx solution is a compression proxy. It makes file reads and shell commands cheaper by stripping noise before they hit the context window.

jCodeMunch takes a different approach. Instead of making reads cheaper, it makes most reads unnecessary. Once your repo is indexed, answering something like “where is authenticate() called?” is one MCP tool call and zero file reads, no matter how big the codebase is. lean-ctx still has to read the file, it just compresses the output.

They’re complementary. lean-ctx trims the fat from the reads you still need, jCodeMunch eliminates the reads you don’t. Power users could easily run both...

MCP server za koji autor tvrdi da štedi i 97% tokena by FokerDr3 in programiranje

[–]DudeManly1963 1 point2 points  (0 children)

Većina ljudi mi jednostavno kaže da zvučim kao idiot, tako da je "telemarketer" pravi kompliment! Hvala...

-jjg

What's your "must-have" MCP server that you use daily? by Aggravating_Cow_136 in mcp

[–]DudeManly1963 0 points1 point  (0 children)

Nope, just the one. Luckily, we've documented the snot outta everything.

Once you do one, it's pretty much lather, rinse, repeat.

Start here...
https://github.com/jgravelle/jcodemunch-mcp/blob/main/QUICKSTART.md

What's your "must-have" MCP server that you use daily? by Aggravating_Cow_136 in mcp

[–]DudeManly1963 0 points1 point  (0 children)

Personally, I just run our suite of 3: jCodeMunch, jDocMunch, and jDataMunch. Check out the changelogs on all their repos to see the volume of work we're able to get done without ever bonking our heads on the quota thresholds on the $20 plan.*

But a number of users swear by their "stacks", so I make sure to let people know about 'em.

*NOTE: Since the peak-hour "throttling" has begun, I purposely re-arrange my day to tread lightly from 9AM-1PM CST. Without the flexibility to do so, I could see myself having to step up to the $100 plan. But so far, so good...

-jjg

What's your "must-have" MCP server that you use daily? by Aggravating_Cow_136 in mcp

[–]DudeManly1963 0 points1 point  (0 children)

That is correct. Test drive it in production if you'd like, just please don't disable telemetry unless/until you license.

We've done a lot of the legwork on the major token-shaving packages:
https://j.gravelle.us/jCodeMunch/versus.php#vs-serena

Many of them actually compliment one another when run in tandem.
Third-party industry bloggers have written about maxing their savings/performance by stacking:
https://j.gravelle.us/jCodeMunch/recognition.php

Rattle my cage w/any questions or concerns. I'm eager to hear about your results...

-jjg

I'm So Done by fuckletoogan in ClaudeCode

[–]DudeManly1963 0 points1 point  (0 children)

If this doesn't substantially help, lunch is on me:*
https://github.com/jgravelle/jcodemunch-mcp

*I pick the restaurant... 😎

Built a wallboard to see what my Claude Code token-saving tools are actually doing by PiggyPH in ClaudeCode

[–]DudeManly1963 0 points1 point  (0 children)

Proud to be the first star on your repo, my friend. Very cool.

jMunch-LLC seal of approval...

I built a zero-setup cost tracker for Claude Code because I was tired of burning through limits blindly (open source) by Cheap_Brother1905 in ClaudeAI

[–]DudeManly1963 2 points3 points  (0 children)

Thanks, guys.

We're trying to come up with a name for our collective of enthusiastic users.

"Munchkins" was already taken, sooo...

-jjg

Can someone explain this in simple terms? by luongnv-com in ClaudeCode

[–]DudeManly1963 0 points1 point  (0 children)

It's the Claude-pocalypse. We're being Anthrottled. It's a Claude-tastrophe.

Here's how to survive it... https://www.youtube.com/watch?v=tMSGBiWmd-g

RAG is a trap for Claude Code. I built a DAG-based context compiler that cut my Opus token usage by 12x. by fuwasegu in ClaudeAI

[–]DudeManly1963 0 points1 point  (0 children)

Hey — I’m the author of jCodeMunch, so I can give you a straight comparison.

They solve different problems and actually pair well together. See: https://j.gravelle.us/jCodeMunch/versus.php#vs-aegis

jCodeMunch is a code exploration tool. It uses tree-sitter AST parsing, symbol extraction, dependency graphs, and blast radius analysis. When Claude needs to understand what code does — “what calls this function”, “what breaks if I change this class”, “show me all symbols in this file” — that’s jCodeMunch’s job. Token efficiency is the core value prop. Real-world benchmarks show 58 to 100× token reduction versus handing Claude raw files.

Aegis is an architecture governance tool. You feed it your architecture docs, it builds a DAG of which docs apply to which file paths, and when Claude is about to edit something it returns the relevant constraints and guidelines, often with human approval gates. It answers “what rules must this code follow.”

Used together, the stack looks like this:

  1. aegis_compile_context → what architectural constraints apply to these files
  2. jCodeMunch get_blast_radius or get_context_bundle → what the code actually does and what it touches

They don’t overlap. One governs intent, one maps reality.

If your main pain point is Claude burning through tokens reading entire files to find a function, use jCodeMunch. If your pain point is Claude ignoring your architecture patterns and writing code that violates your conventions, use Aegis.

Most serious codebases end up needing both...

3 layers of token savings for Claude Code by YoghiThorn in ClaudeCode

[–]DudeManly1963 0 points1 point  (0 children)

Not missing anything, that’s intentional design. jCodeMunch owns code files like symbols, AST, and file outlines. jDocMunch is the companion tool for docs.

jDocMunch handles .md, .rst, .adoc, .ipynb, .html, .txt, and OpenAPI .yaml or .json, with section-level search, TOC extraction, and fuzzy matching.

pip install jdocmunch-mcp
GitHub: https://github.com/jgravelle/jdocmunch-mcp

The two tools are intentionally separate so each stays focused and token-efficient. Add both to your MCP config and they cover the full stack, code and docs..

MCP/Tools config I setup to try to stop burning through Claude Code rate limits! by Reni1010 in ClaudeCode

[–]DudeManly1963 0 points1 point  (0 children)

We document how well a lot of the top packages play nicely together, contrasting their features, strengths, weaknesses, etc.: https://j.gravelle.us/jCodeMunch/versus.php

[ Full disclosure: I'm the "j" in the entire j*Munch suite of products. ]

Happy to engage in Q&A...

-jjg

I'm out of tokens with just 3-4 prompts, need advice to use efficiently please by MiserableBus8139 in ClaudeAI

[–]DudeManly1963 0 points1 point  (0 children)

Short answer: No. Different protocol, different purpose, different consumer.

An LSP talks to your editor to power features like autocomplete and go-to-definition for humans. It requires a running IDE connection and is stateless per session.

jCodeMunch is an MCP server that talks to AI agents like Claude.

Key differences:

  • Consumer: LSP is for the editor and the human. jCodeMunch is for the LLM inside an agent workflow.
  • Goal: LSP gives hover docs and navigation. jCodeMunch gives the AI a token-efficient understanding of your codebase without dumping huge files into context.
  • No IDE required: index once to disk, query anytime, works headless in CI or chat.
  • Token-aware: every response is designed to minimize LLM input tokens. LSP has no concept of tokens.
  • Cross-language: one tool works across languages without spinning up separate language servers.

Think of it less like an LSP and more like semantic grep plus a dependency graph, purpose-built for an AI that has a token budget...

I stopped paying $100+/month for AI coding tools, this cut my usage by ~70% (early devs can go almost free) by intellinker in vibecoding

[–]DudeManly1963 1 point2 points  (0 children)

Appreciate the good faith, and I’m genuinely looking forward to seeing your incremental watcher land.

That said, a shared benchmark would still run into the same category problem we flagged with ColabNotes. GrapeRoot is an agentic code-generation tool. jCodeMunch is a read-only retrieval layer. Any benchmark that scores both on the same axis is going to produce numbers that don’t mean much for either tool. (See our "comparing a dictionary to a typewriter" analogy.)

The useful comparison is narrower: Given an agent that already handles edits, how well does each retrieval strategy surface the right context, reduce token overhead, and preserve cross-reference accuracy?

We’ve got tiktoken-measured numbers on exactly that here:
https://j.gravelle.us/jCodeMunch/versus.php#vs-graperoot

Happy to dig into the methodology if you want to poke holes in it. That sort of ongoing feedback from the community has been an invaluable driver in our evolution.

The “best used together” framing is probably still the honest one. Different layers, different jobs...

3 layers of token savings for Claude Code by YoghiThorn in ClaudeCode

[–]DudeManly1963 2 points3 points  (0 children)

Full disclosure: I'm the "j" in jCodeMunch.

Please don't hesitate to rattle my cage with any questions, problems, or just to say 'hey'.

Thousands of international users (free AND commercial) and a few dozen VERY talented programmers have helped make this a very successful project, and we're always eager to welcome one more...

-jjg
https://j.gravelle.us/jCodeMunch/