Resolve documentation ownership, edit roots, checks, and human handoffs before an agent edits code.
Nothing to run from here
K2 Study Decks & Algorithm is installed from its publisher's own source and answers where it runs, so this marketplace is not in the path of a single call. There is no address here to send one to, and a panel that pretended otherwise would be showing you an answer we made up. Install it and call it from your own client — the Installation tab has the entry for each one.
96/100
tool-list score
7
tools declared
remote
at its publisher
—
calls last 7d
What it does
Study decks for 8 languages plus the K2 spaced-repetition engine, runnable on your items.
Quickstart
# 1 — add it to Claude Code
claude mcp add --scope user --transport http k2-study-decks-algorithm-mcp https://k2kanji.com/api/mcp
# 2 — ask your agent for something these tools do
# list_decks, search_deck, get_entry and 4 more
K2 Study Decks & Algorithm costs nothing on mcprush: there is no plan to choose here, no cap to set and nothing mcprush can bill you for.
Publishernot claimed
K2All 1 server
k2kanji1 server
1 category
Collected from a public index. Nobody has claimed this account, so nothing here was written by its author — claim it if it is yours.
Installation
Where are you running it?
Every route below installs the same thing and ends at the same approval screen. Nothing here runs on your machine and nothing runs on ours: this server answers at its publisher’s own address, and what you install is the connection straight to it.
Claude Codedeclared by this listing
This is a public server: it answers at its publisher’s own address and this marketplace is not in the path. Claude Code registers it in one command; --scope user makes it available in every project. The transport below is http, as the publisher's own manifest declares it.
claude mcp add --scope user --transport http k2-study-decks-algorithm-mcp https://k2kanji.com/api/mcpReconnect, or start a new session, and the tools appear in the model’s tool list.
Free on mcprush, and it answers at its publisher’s own address: this marketplace is not in the path, so there is no key of ours to hold and no card to add.
What it writes
One config entry pointing straight at the publisher’s own address — this marketplace is not in the path, and nothing from this listing executes on your machine.
What you approve
7 tools, with what each one reads, writes and reaches shown before you agree — the same list on every route above. Read the tool surface.
Tool surface
What the model actually sees. Descriptions are diffed on every release — see version history.
The catalog of K2 study decks: eight curated datasets spanning Japanese kanji and vocabulary, HSK Chinese, Korean Hangul, Spanish, French, classical Latin and medical Latin. Returns each deck id (the value other tools take), what it teaches, how many entries it has, and what its fields mean. Call this before search_deck.
No parameter schema on file.
Search one deck. query substring-matches the term, its reading/pronunciation, its English meanings, and its category, so "bone" finds entries glossed as bone and "ㄱ" finds that jamo. Narrow with category (exact, from list_decks) or difficulty (1-5; for the kanji deck this is the school grade). Paginated via offset.
| Parameter | Type | Required | Notes |
|---|---|---|---|
| deck | string | yes | Deck id from list_decks |
| query | string | no | Substring to match against term, reading, meanings, category |
| category | string | no | Exact category filter (see list_decks) |
| difficulty | number | no | Exact difficulty/grade filter (1-5; kanji deck = grade 1-6) |
| limit | number | no | Max results (default 20, max 50) |
| offset | number | no | Skip this many matches (paging) |
One deck entry in full, matched on the exact term (the kanji, hanzi, jamo, or word itself). Case-insensitive. Returns every field the deck carries, including the deck-specific extras: stroke counts and JLPT level for kanji, component kanji for compounds, declension and English derivatives for Latin, IPA and pronunciation audio for French.
| Parameter | Type | Required | Notes |
|---|---|---|---|
| deck | string | yes | Deck id from list_decks |
| term | string | yes | Exact term to fetch |
Rubik's cube last-layer algorithm sets used by the K2 cube trainer: full OLL (57 cases), full PLL (21), the two-look beginner subsets, and full ZBLL. Each case returns its primary algorithm plus alternates, with sources and finger-trick notes where recorded. Every algorithm in these sets is verified against a cube simulator by the repo's audit script (app/cube/scripts/audit-algorithms.mjs), run be
| Parameter | Type | Required | Notes |
|---|---|---|---|
| set | string | yes | Algorithm set id |
| case_id | string | no | Single case id, e.g. 'oll-21' or 'pll-t' |
| group | string | no | Case group filter, e.g. 'T Shapes', 'OCLL' |
| limit | number | no | Max cases (default 20, max 50) |
The K2 spaced-repetition engine, described. K2 stores no review dates: each item holds a probability p that halves on a correct answer and doubles on a wrong one, and items are drawn by Monte Carlo rejection sampling, so the pool self-organizes around current weaknesses and expands when it cools. Returns the update rule (including the deliberate hinted-answer exception), the selection and pool-exp
No parameter schema on file.
Run the real K2 engine over your own items. Give it a list of terms (any strings — your flashcards, cube cases, anything), a study mode, and a sequence of answers, and it returns the p-value trajectory per answer, which items are now mastered, when the pool expanded, and the probability distribution over what K2 would serve next. Use this to drive your own drilling with K2 as the scheduler instead
| Parameter | Type | Required | Notes |
|---|---|---|---|
| terms | array | yes | The item pool. Any strings; the engine only needs identity. |
| mode | string | no | Which dimension is being drilled (each carries its own p). |
| steps | array | yes | Answers in order. outcome is correct | incorrect | hinted (hinted = answered with the crutch visible; cools more weakly). |
| starting_level | number | no | Treat the first N terms as already known (pre-cooled), as the app's head-start option does. Default 0. |
What K2 is, which apps it runs, what this server does and does not expose, and every machine-readable surface. Also returns the full capability map — every tool, prompt, and resource — so a client with a stale or tools-only roster can still see the whole surface.
No parameter schema on file.
Free
$0 forever
- Every tool — any call limit is its publisher’s, not ours
- No card, and mcprush charges nothing for it
- Runs at its publisher’s own address — this marketplace is not in the path
- Nothing to cap, because mcprush bills nothing
What counts against your monthly calls
| Tool | Unit | Calls used | Out of the allowance |
|---|
Nothing here is billable: mcprush charges nothing to install K2 Study Decks & Algorithm or to call it, at any volume.
Call allowance · this installenforced at the gateway
Monthly allowance, in calls
—
—
Alert at 80% · then the tool returns a normal MCP error
Used this month: —
ATool-list grade · score 96 / 100
Release 1.1.0 · scanned 24 Oct 2026
Graded from the tools this server lists, not from its source code.
Two independent axes, because powerful and malicious are different questions. The grade is threat only. The capability level is blast radius, and it is never a penalty on the grade — it is priced as one subtract-only term in the score, where you can see it.
Threat score100
Client score96
Findings0 threat · 0 capability
Capabilityminimal
Coveragemanifest
Verificationnot in this report
Surface digestac8a5b1a5f8f48e1615fb6a61bdab1e89ebaef51f8e7a0889f1e096eb6dfde24
Score vectorthreat 100 → client 96
| Term | Level | What it prices | Points |
|---|---|---|---|
| capability-exposure | minimal | capability blast radius (minimal) — client exposure if the model is manipulated | −0 |
| coverage-honesty | manifest | inspection depth (manifest) — how much of the target the scan could see | −4 |
score = clamp(round(threatScore − E_cap − E_ver − E_cov), 0, 100). No model, no opinion, no network call at scoring time: the same methodology version against the same bytes always produces this number, and every line above is a field of the report rather than a summary of it.
What the scan could actually read
A grade is only as meaningful as its coverage, so the scanner publishes its own depth before it publishes its result.
The scan read each tool’s name, description, input schema and annotations exactly as the server listed them the last time it answered us; no code was reviewed. We ask the server again about once a month, and a list that changed is graded again.
Tool surfaceread
Implementation sourcenot available
Package metadatanot available
Live transportnot available
The implementation source was not read — this reflects the declared tool metadata only.
Capability — what it could do if the model were manipulated
Tags derived from each tool’s schema and the implementation, not from what the tool calls itself. minimal is the level these add up to.
| Tool | Capability tags | Why the tag was assigned |
|---|---|---|
| list_decks | no tags | |
| search_deck | no tags | |
| get_entry | no tags | |
| get_cube_algorithms | no tags | |
| explain_k2_algorithm | no tags | |
| simulate_k2_session | no tags | |
| get_site_info | no tags |
Toxic-flow graph
The lethal trifecta, checked as a graph rather than as a checklist: untrusted input, a sensitive source and an external sink have to meet before there is a path worth worrying about.
The public result for this release does not print the flow graph, so there is nothing to show here. That is not the same as "no paths were found": what the scan did read is above, under coverage.
Supply chain and provenance
Integrityfirst-seen
Surface digestac8a5b1a5f8f48e1
Scanned2026-10-24
This is the first scan of this surface here, so there is nothing yet to compare it against.
Every result on this tab comes from one deterministic pass over the published package — offline, rule by rule, and auditable line by line above. Same methodology version, same bytes, same score.
Release history
This is an address its publisher runs: which release it serves is theirs to choose, so there is nothing here to pin. The history below is for reading; the current release on file is 1.1.0.
1.1.0
undated
latestNo release note was published with this version.
—
no reviews yet
Who can review
One review per account, from a signed-in account that does not publish this listing. Nothing else is asked — you can say what you think before you install it. Publishers can reply once per review, and a review can be edited or deleted by whoever wrote it.
Sign in to write one
Any signed-in account that does not publish K2 Study Decks & Algorithm can review it, once — before installing it or after. A review from an account that has installed it is marked as one.
No reviews yet
Nobody has reviewed this listing. The rating on the card is the mean of the reviews written here and nothing else, so there is no rating until somebody writes the first — which takes a signed-in account that does not publish it, and nothing else.