Show HN: I made an AI agent to interact with resume and make changes as you ask https://bit.ly/4qjzfpF

Show HN: I made an AI agent to interact with resume and make changes as you ask I built an agent that understands your resume content and make changes as you prompt with the real time resume preview. https://bit.ly/3MSrbOk December 20, 2025 at 08:29AM

Show HN: I Built an Image Captioning Tool Using Llama.cpp https://bit.ly/4j6tyJB

Show HN: I Built an Image Captioning Tool Using Llama.cpp Frustrated with the apparent lack of tools for tagging and describing images locally, I built a quick and dirty little tool. You start it up, start up llama-server, and point it at a directory of photos. It scans through them, captioning them one at a time, and provides the captions and tags in an editable interface for you. When you're happy with them, you can save them, which writes them to the exif metadata of the image, and moves onto the next one https://bit.ly/4b6dS6S December 19, 2025 at 10:49PM

Show HN: Misata – synthetic data engine using LLM and Vectorized NumPy https://bit.ly/4j6VBIN

Show HN: Misata – synthetic data engine using LLM and Vectorized NumPy Hey HN, I’m the author. I built Misata because existing tools (Faker, Mimesis) are great for random rows but terrible for relational or temporal integrity. I needed to generate data for a dashboard where "Timesheets" must happen after "Project Start Date," and I wanted to define these rules via natural language. How it works: LLM Layer: Uses Groq/Llama-3.3 to parse a "story" into a JSON schema constraint config. Simulation Layer: Uses Vectorized NumPy (no loops) to generate data. It builds a DAG of tables to ensure parent rows exist before child rows (referential integrity). Performance: Generates ~250k rows/sec on my M1 Air. It’s early alpha. The "Graph Reverse Engineering" (describe a chart -> get data) is experimental but working for simple curves. pip install misata I’d love feedback on the simulator.py architecture—I’m currently keeping data in-memory (Pandas) which hits a ceiling at ~10M rows. Thinking of moving to DuckDB for out-of-core generation next. Thoughts? https://bit.ly/49kC2JI December 16, 2025 at 03:38PM

Show HN: Daily Set Puzzle – I rebuilt it after setgame.com's SSL cert expired https://bit.ly/4pLzg61

Show HN: Daily Set Puzzle – I rebuilt it after setgame.com's SSL cert expired https://bit.ly/4pJ9MpL December 19, 2025 at 03:36AM

Show HN: Bithoven – A high-level, imperative language for Bitcoin Smart Contract https://bit.ly/3Y3CnKy

Show HN: Bithoven – A high-level, imperative language for Bitcoin Smart Contract Hey HN! I’m a researcher working on Bitcoin smart contracts, and today I’m releasing Bithoven—a high-level imperative language that compiles to native Bitcoin Script (Legacy, SegWit, and Taproot). The Goal: Raw Bitcoin Script is notoriously difficult to reason about. Writing raw Bitcoin Script today feels like writing Assembly in the 1970s. You have to mentally juggle the stack (`OP_SWAP`, `OP_ROT`), manually manage distinct execution branches, and pray you didn't leave a stack item unconsumed (which crashes the script). My goal was to bridge the gap between complex contract logic and raw opcodes, allowing developers to write readable, compile-time-safe code. Key Features: - Imperative Syntax: Write logic using familiar if/else and return statements instead of mental stack juggling. - Type Safety: First-class support for bool, signature, string, and number types to prevent runtime errors. - Targeted Compilation: Support for Legacy, SegWit, and Taproot compilation targets. - Native Primitives: Built-in keywords for timelocks (older, after) and cryptography (sha256, checksig). You can try it in the browser here (runs via WASM): https://bit.ly/3Y3O9Ez Here is an example of a Hashed Time-Locked Contract (HTLC): (condition: bool, sig_alice: signature) (condition: bool, preimage: string, sig_bob: signature) { if condition { // Relative locktime (Sequence) older 1000; return checksig (sig_alice, alice_pk); } else { // Hashlock verification verify sha256 sha256 preimage == hash; return checksig (sig_bob, bob_pk); } } The project is free open source and the academic paper is currently under review. I’d love to hear any feedback. Thanks for checking it out! https://bit.ly/490qUAt December 15, 2025 at 01:54PM

Show HN: Learning a Language Using Only Words You Know https://bit.ly/4aVwhTU

Show HN: Learning a Language Using Only Words You Know A proof-of-concept language learning app that uses LLMs to generate definitions of unknown words using only previously mastered vocabulary. https://bit.ly/4jp3x8B December 15, 2025 at 02:32PM

Show HN: Proxylity – serverless UDP services on AWS (one year in production) https://bit.ly/44zlD1m

Show HN: Proxylity – serverless UDP services on AWS (one year in production) https://bit.ly/4p4qtei December 18, 2025 at 01:22AM

Show HN: Largest Public Dataset of Electronic Circuit Files https://bit.ly/4ahaLJ8

Show HN: Largest Public Dataset of Electronic Circuit Files Introducing Open-Schematics: a large public dataset of electronic schematics with rendered images and structured metadata for ML, circuit understanding, retrieval, and validation. https://bit.ly/48UL3HX December 18, 2025 at 03:04AM

Show HN: Prompt-refiner – Lightweight optimization for LLM inputs and RAG https://bit.ly/494weTv

Show HN: Prompt-refiner – Lightweight optimization for LLM inputs and RAG Hi HN, While building RAG agents, I noticed a lot of token budget was wasted on formatting overhead (HTML tags, JSON structure, whitespace). Existing solutions felt too heavy (often requiring torch/transformers), so I wrote this lightweight, zero-dependency library to solve it. It includes strategies for context packing, PII redaction, and tool output compression. Benchmarks show it can save ~15% of tokens with negligible latency overhead (<0.5ms). Happy to answer any questions! https://github.com/JacobHuang91/prompt-refiner December 17, 2025 at 11:40PM

Show HN: C-compiler to compile TCC for live-bootstrap https://bit.ly/4s4zJls

Show HN: C-compiler to compile TCC for live-bootstrap https://bit.ly/3L8SXpg December 18, 2025 at 12:34AM

Show HN: Python packages for FastAPI apps – auth, logging, config, LLM, more https://bit.ly/48K1Y16

Show HN: Python packages for FastAPI apps – auth, logging, config, LLM, more https://bit.ly/3KLxQJD December 17, 2025 at 01:04AM

Show HN: AI Trolley Problem Arena https://bit.ly/44uYKfr

Show HN: AI Trolley Problem Arena I built a tool that presents custom trolley problems to GPT, Claude, Gemini, Llama, Grok, and DeepSeek simultaneously and streams their ethical reasoning in real-time. Some interesting findings: - The models are surprisingly split on classic dilemmas. - Models will protect their creator (Sam Altman vs Dario Amodei) - Criminals are not valued equally even when compared to itself Try it: https://bit.ly/4pDD893 https://bit.ly/4s18055 December 17, 2025 at 12:14AM

Show HN: PasteClean – Desktop app to strip tracking parameters from clipboard https://bit.ly/4aeWoFf

Show HN: PasteClean – Desktop app to strip tracking parameters from clipboard I built a small desktop tool called PasteClean to solve a personal annoyance: sharing URLs filled with tracking garbage (utm_source, fbclid, etc.). It runs in the background and automatically cleans URLs in your clipboard when you copy them. It handles 50+ tracking parameters and can also unshorten links (bit.ly, t.co) to reveal the destination and clean them before pasting. Tech stack is Electron/React/TypeScript. The core privacy features are free. I added a "Pro" lifetime license for some advanced features (unshortening, batch mode) to support development. https://bit.ly/48Veg5s December 16, 2025 at 02:13AM

Show HN: A visual reminder for ADHD brains https://bit.ly/4qvC7QL

Show HN: A visual reminder for ADHD brains Mozart Says is a floating reminder built specifically for ADHD brains that need to see things to remember them. If you're like me, notifications disappear into the void and todo apps get buried under 47 browser tabs. I used to plaster my monitor with post-its because out of sight = out of mind. So I built Mozart Says, a reminder that literally floats on top of everything until you deal with it. It's a free Mac app where you can write any message, customize how it looks (typography, colors), and drag it anywhere on screen. https://bit.ly/3MFwpwO December 16, 2025 at 12:50AM

Show HN: A Lightweight Hono and Preact Template for Cloudflare Workers https://bit.ly/4iTGJgC

Show HN: A Lightweight Hono and Preact Template for Cloudflare Workers https://bit.ly/4qd814j December 15, 2025 at 02:25AM

Show HN: Silly website to earn badges for touching grass https://bit.ly/4rVoc7Z

Show HN: Silly website to earn badges for touching grass I started giving away badges on X to people who touched grass just for fun and most of them loved it! So I decided to create a whole website about it. Process is simple: - Enter X username / url - Fetch Profile image and choose badge - Generates a badge page which can be shared with nice OG images The site is deployed on Vercel, with R2 and Browser rendering for OG images and data storage. https://bit.ly/4q8Z0Jq December 15, 2025 at 02:49AM

Show HN: Feedvote – A $149 lifetime alternative to Canny for Linear users https://bit.ly/3XXmjd9

Show HN: Feedvote – A $149 lifetime alternative to Canny for Linear users https://bit.ly/4j0xyLA December 14, 2025 at 09:28PM

Show HN: Tic Tac Flip – A new strategic game based on Tic Tac Toe https://bit.ly/4qbWm5N

Show HN: Tic Tac Flip – A new strategic game based on Tic Tac Toe The biggest problem with Tic-Tac-Toe is that it almost always ends in a draw. Tic Tac Flip tries to fix that! Learn the rules in Learning Mode or below: - Winning Criteria: 3 Ghosts (Flipped O or X, which can be a mixture). It's not just 3 Os or 3 Xs anymore! - Flipping Mechanic: When one or more lines having only O and X are formed, the minority of either all Os or all Xs get flipped to a Ghost, and the majority gets removed from the board. E.g., A line of 2 Os and 1 X leads to 1 X ghost and the removal of 2 Os. - Active Flip: You can actively flip your O/X to a Ghost (or flip a ghost back) once per game. - Placing Ghost Directly: You can place a "Ghost" piece directly as a final winning move (only once, and only when there are two existing ghosts in a line). I'm looking for feedback on the game balance and learning curve. Specifically: - Is the "Ghost" and "Flip" mechanic intuitive? - Is the Learning Mode helpful? - Is the game fair? Any rule adjustments needed? - Any bugs or issues? Any suggestions or comments would be much appreciated. Thank you in advance! https://bit.ly/4qbWmCP December 14, 2025 at 06:49AM

Show HN: Soup.lua: making Lua do what it shouldn't https://bit.ly/44vaD58

Show HN: Soup.lua: making Lua do what it shouldn't https://bit.ly/3KJMh0O December 13, 2025 at 08:03PM

Show HN: EdgeVec – Sub-millisecond vector search in the browser (Rust/WASM) https://bit.ly/48YXwdY

Show HN: EdgeVec – Sub-millisecond vector search in the browser (Rust/WASM) Hi HN, I built EdgeVec, a vector database that runs entirely in the browser. It implements HNSW (Hierarchical Navigable Small World) graphs for approximate nearest neighbor search. Performance: - Sub-millisecond search at 100k vectors (768 dimensions, k=10) - 148 KB gzipped bundle - 3.6x memory reduction with scalar quantization Use cases: browser extensions with semantic search, local-first apps, privacy-preserving RAG. Technical: Written in Rust, compiled to WASM. Uses AVX2 SIMD on native, simd128 on WASM. IndexedDB for browser persistence. npm: https://bit.ly/4ptTr8q GitHub: https://bit.ly/49efj0T This is an alpha release. Main limitations: build time not optimized, no delete operations yet. Would love feedback from the community! https://bit.ly/49efj0T December 12, 2025 at 11:39PM