Rare Not Random: Using Token Efficiency for Secrets Scanning
Entropy often struggles with generic secrets and short strings. We look at how token efficiency can better identify strings that don’t look like normal text. Category: Guides & Best Practices
Read the full articleYou might also wanna read
Token efficiency varies 2.6x across programming languages, impacting LLM-generated code
Comparing token efficiency across 19 popular programming languages using RosettaCode data - from Clojure to C, there's a 2.6x difference.
Building a Minimal RAG System from Scratch: PDF to Highlighted Answers in ~100 Lines of Python
Enterprise Document Intelligence [Vol. 1 #1] The smallest version of RAG that actually works, on a real PDF, with grounded answers and the s
Technical Analysis: Computational Complexity and Accuracy Tradeoffs in Schema-Guided Document Extraction
An analysis of the computational and accuracy tradeoffs behind schema guided document extraction, based on real world evals on complex docum
Efficiently Generating a Number in a Range
The vast majority of my posts about random number generation have focused on looking at the properties of different generation schemes. But,
Analyzing SSH Protocol Inefficiency: Why Single Keystrokes Generate Excessive Network Packets
I made my next game twice as fast by forking go's crypto library
Search-Augmented Agents Cut Token Usage by 36% and Outperform Raw File Processing
Same model, same questions. Search cut tokens 36% and won 75% of blind comparisons.

Comments
Sign in to join the conversation.
No comments yet. Be the first.