Back to browse
GitHub Repository

Glyphh HDC model for the Berkeley Function Calling Leaderboard (BFCL). Zero tokens, sub-10ms function routing.

5 starsPython

HDC-based function caller ranks #2 on BFCL V4 – $2.08 vs. Opus at $87

by timmetime·Mar 11, 2026·2 points·0 comments

AI Analysis

●●●BangerWizardryBig BrainZero to One

HDC vector routing beats Opus at 1/40th the cost — deterministic, sub-ms, zero tokens.

Strengths
  • HDC handles function routing deterministically — zero LLM tokens, sub-millisecond inference time
  • 74.50% BFCL V4 overall score at $2.08 eval cost versus Opus at $87
  • Transparent about weaknesses: multi-turn at 53.75%, engineered for 128 BFCL functions
Weaknesses
  • Multi-turn performance lags significantly at 53.75% — not ready for complex agentic workflows
  • Specifically engineered for BFCL benchmark — generalization to arbitrary APIs unproven
Category
Target Audience

ML engineers building function-calling systems, AI infrastructure developers

Similar To

Gorilla · LangChain Tools · OpenAI Function Calling

Post Description

I've been building Glyphh, a hyperdimensional computing runtime, for two years. This is the first HDC-based entry on the Berkeley Function Calling Leaderboard (BFCL V4), to my knowledge. The idea: LLMs run at build time to generate intent exemplars. At runtime, function routing is pure HDC vector math — sub-ms, zero tokens, deterministic. Claude Haiku handles argument extraction only. The model code is fully open source. Results: 74.50% overall (#2 behind Opus), 83.30% agentic (best on board, beating Opus), 88.71% non-live AST (top 3). Total eval cost: $2.08. Opus runs the same eval at $87 (results not yet verified by bfcl team). The README is transparent about where it struggles (multi-turn: 53.75%) and where the LLM does the work vs HDC. There's also an independent code review in the repo. Happy to answer anything about the architecture (https://glyphh.ai)

Similar Projects

Developer Tools●●Solid

Visualizing persistent vectors in the browser using Rust and WASM

Dragging the timeline reveals how splits, concats and shared nodes evolve across versions, which makes an abstract data structure palpably understandable. Running the implementation in-browser via Rust→WASM is a neat technical demo, but it's primarily educational — more inline explanations or scenarios would make it genuinely useful beyond hobbyist exploration.

WizardryNiche Gem
araz
113mo ago