v1.0.0 · MIT License
Enables users to search public job listings and retrieve details for individual postings from inside AI assistants, including ranked results, filters, and pagination. It is read-only and requires no account, authentication, or API key.
v0.1.0 · MIT License
Enables AI agents to read and write a local-first Markdown/Obsidian notebook via a single capture call that routes text into the right notebook, board, or daily journal entry and returns related notes, alongside search, note and card management, and numeric metric series. Access is governed by per-agent tokens with read/write/admin scopes, optional folder restrictions, and an audit log of every action.
— · MIT License
Enables AI agents and LLMs to persist facts, preferences, and observations in a local SQLite store and to build and traverse subject-predicate-object knowledge graphs across sessions. It provides fuzzy keyword search and graph queries so assistants retain context and recall prior project history without repeating prompts.
— · MIT License
Enables an AI agent to drive a remote Linux machine over the LAN through a single TCP connection, exposing tools for shell commands, jobs, interactive PTYs, file read/write/search/transfer, process and service management, networking, packages, and power control, with optional multi-host switching. Operates without SSH or any Linux-side installation beyond one stdlib-only Python daemon, using a state-free binary protocol.
— · MIT License
Enables AI clients to search Korean court auction real estate by court, region, usage, sale date, appraisal/minimum price, and failure count; fetch case details; collect and resume jobs; and export results to Excel, CSV, and JSONL.
— · MIT License
Enables AI agents to store decisions as a versioned history, linking each new decision to the one it replaces so that recall always resolves to the decision currently in force instead of obsolete ones. It runs fully locally on a single SQLite file with BM25 search, and can optionally detect replacements automatically via an LLM or heuristic linker.