Tag

Vibe-Coding-Instruct

Curates ~1.1M instruction–response examples for 'vibe coding' scenarios where developers prompt LLMs to produce implementation plans, architecture choices, and deployment steps. Covers conversation memory, prompt templates, model routing, streaming responses, and scaling considerations; Apache-2.0.

Ponytail

Provides a ruleset and skills that make AI coding agents prefer the simplest correct implementation: reuse existing code, prefer stdlib/native features, and only write minimal new code. Cuts generated LOC, tokens, cost and time while preserving validation and safety.

Qwable-v1

Open-weights agentic coding model that layers Claude Fable‑5 tool‑use SFT onto a reasoning‑distilled Qwen3.6 base; emits <tool_use> XML for file edits, shell commands and reads when prompted as an agent. Designed for agentic coding workflows; AGPL‑3.0 licensed.

microsoft/FastContext-1.0-4B-SFT

Provides a lightweight repository-exploration subagent for LLM coding agents: invoked on demand to run parallel read-only READ/GLOB/GREP calls and return compact file-path plus line-range citations so the main solver gets focused evidence instead of noisy reads.

nodeterm

Manages real tmux-backed terminals and AI agents as draggable nodes on an infinite pan/zoom canvas, with a Trello-style kanban view, persistent sessions that survive restarts, mobile companion support, and a browser Server Edition for self-hosting.

GLM-5.2

Provides a large language model optimized for long-horizon agentic tasks and end-to-end coding workflows — with a stable 1,000,000-token context, IndexShare sparse-attention and multi-level thinking-effort modes. MIT-licensed and designed for deployments that need sustained long-context reasoning and coding.

LoopCoder-v2: Only Loop Once for Efficient Test-Time Computation Scaling

Uses Parallel Looped Transformers (PLT) to make loop count a practical knob for code models, finding two loops give the best test-time gains. Trains 7B models on 18T tokens and attributes saturation beyond two loops to a gain–cost tradeoff from positional mismatch.

GameCraft-Bench: Can Agents Build Playable Games End-to-End in a Real Game Engine?

Assesses whether coding agents can generate complete, playable games end-to-end inside the Godot engine. Implements an interaction-grounded evaluation (replayed demonstrations + rubric-guided multimodal judging) across 140 tasks and 15 game families; top agents score ~41%.

GLM-5.2-FP8

Provides FP8-quantized weights of GLM-5.2 — a 744B long-context LLM tuned for sustained 1M-token engineering, coding and agentic workflows; compatible with vLLM, Transformers, SGLang and Ascend NPU deployments.

GLM-5.2 (Unsloth GGUF)

Provides GGUF-quantized GLM-5.2 builds for local text-generation with a solid 1M-token context, dynamic 1-/2-bit quant options, and Unsloth runtime integrations — targeted at long-horizon coding, reasoning and agent workflows. MIT licensed.

Claude Fable-5 Code

Contains 603 coding and math prompt–response pairs produced by Claude Fable‑5 (generated 2026-06-10), provided as a JSONL subset for fine-tuning, evaluation, and behavior analysis. Responses are 'non-thinking' (no chain-of-thought); small, anonymized, and lacking an explicit license.

Gemma4-12B v2 — Coding + Agentic Edition (GGUF)

A local, quantized Gemma 4 12B fine-tune packaged as GGUF quants that runs on ~4.5 GB VRAM. Optimized for coding and multi-step agentic tool use (read→reason→act→verify), ships multiple quant sizes (Q3_K_M–Q8_0) and MTP draft support; English-centric with trade-offs versus generalist models.