A personal AI tutor with long-term memory and tool use.
Project description
dint
The tutor that refuses to give you the answer.
When you ask ChatGPT, any AI ,whoever it is about how to write a bubble sort, They say: "Oh, here's your code!", you edit it and think you learned it., then after that you can't even remember what you did.
dint is the opposite. You ask dint how to write a bubble sort, he will push you back, then refuse to give you code. He will guide you step by step, eventually you will derive a bubble sort yourself,remembering it for rest of your life.
dint just don't give you,he let you build it yourself.
What a session actually looks like
You: write me a binary search, come on
dint: No.
I could. You said "come on" like that's an argument. It's not. It's impatience wearing a costume.
Here's what I'll do instead. Five numbers. Sorted. On a table.
[2, 7, 13, 21, 35]I'm looking for 13. A five-year-old could look for 13 — just check them one by one. 2? No. 7? No. 13? There it is. Three tries. Fine.
Now. Same list. But it has a million numbers. And you're checking them one by one. You're still on number 47 and I've already found mine and I'm getting coffee.
So. You have the list. It's sorted. You know that. You're using that. Where do you look first? Not "what's the algorithm." You're standing in front of a million sorted numbers and you need 13. Where does your finger go?
You: move from start one by one and get to 13, just that simple
dint: Yeah. One by one. "Just that simple."
Okay. You're checking one by one. You're on number four hundred thousand. Still going. "Is this 13? No. Is this 13? No."
And here's me. I looked at ONE number. The one right in the middle. Position 500,000. It's the number 4,999,872.
The list is sorted. Small to big. I just checked the middle and it's way bigger than 13. Do I need to look at positions 500,001 through 1,000,000?
What's true about the right half?
You: no no, we just throw away the right half, and back to see the left half
dint: Right. You do the same thing again. Check the middle of what's left. Kill half. Repeat.
And that's the whole trick. That's literally all binary search is. You just invented it.
(...dint then walks through the failure case — what happens when you've halved down to a single number and it's not the target. The learner tries "check the right half," gets corrected: there IS no right half. You're standing in an empty room holding the number 12 and it's not the number you want...)
You: 13 just don't exist, not right and not left, so it's not there, stop!
dint: Yeah. There it is. "Stop." That's the whole termination condition. The search space is empty. Nothing left to halve. You're done. Not found.
Look at what you just built. All of it. In like four messages.
✓ linear search as baseline ✓ exploiting sorted order ✓ midpoint check and half elimination ✓ repeated halving until found ✓ termination condition
That's binary search. You invented it. Now here's the thing you just built, written down. Read it. Does it match what you were thinking?
def binary_search(arr, target): lo, hi = 0, len(arr) - 1 while lo <= hi: mid = (lo + hi) // 2 if arr[mid] == target: return mid elif arr[mid] < target: lo = mid + 1 else: hi = mid - 1 return -1 # not there. stop.
lo <= hi— that's your "there's still something to look at." The momentlo > hi, the search space is empty. Your "not right and not left, stop." That's line 3.
hi = mid - 1— that's your "throw away the right half."lo = mid + 1— the other direction. Same idea.
return -1— "13 just don't exist."You didn't need me to write that. You already had it. I just translated your words into Python.
Go edit it. Come back if the code breaks.
Quick start
pip install dint
dint
Open http://localhost:7070. Set your API key in Settings.
Works with any OpenAI-compatible API — OpenAI, OpenRouter, Groq, Together, or a local Ollama server.
Multi-user mode
Want to host dint for your friends,even a classroom?
dint --multi-user
Each visitor registers an account and gets a fully isolated learning
environment — their own memory, skills, knowledge graph, and sessions.
The operator's API key stays hidden from tenants. Per-user data lives under
users/<username>/.
What dint actually does
|
Socratic dialogue Decomposes every topic into small, concrete concepts. Grounds each one in something you can hold in your head — five numbers, three cards, one sticky note. Asks you to predict, trace, and decide before revealing anything. The code shows up last, as confirmation. Not as the lesson. |
Spaced repetition (SM-2) Schedules review questions for skills you've demonstrated. Come back three days later and it opens with "quick — what's the base case in recursion?" Get it right, the next review moves further out. Get it wrong, it circles back tomorrow. Knowledge that isn't revisited decays. dint doesn't let it. |
Knowledge graph Every concept gets added to an interactive force-directed graph — nodes and edges, how ideas connect. Pan, zoom, drag nodes, right-click to rename or delete. "Binary search" links to "sorted array" links to "comparison." The graph grows as you learn. |
|
Long-term memory Remembers you across sessions. Your goals, what you already know, how you like to be taught, the mistakes you keep making. Reads its notes before each session so he never re-teaches what you've already demonstrated. |
Background reflection After every exchange, a quiet analysis pass updates dint's model of you — skill confidence, knowledge links, durable memories. He detects when you claim to understand but your behavior says otherwise, and corrects he's own stale beliefs. You don't see any of this. |
Memory consolidation Every ~10 turns, dint reviews he's entire inventory of memories, skills, and concepts. Near-duplicates get merged. Stale entries get pruned. The model stays compact and honest over months of use. You can also trigger it manually from Settings. |
|
Adaptive teaching dint watches how you think, not just what you know. He notices you skip steps when tracing algorithms. He notices you learn better from analogies than formal definitions. He adjusts its approach per learner, per session, per concept. |
Multi-user isolation Run |
Bilingual (EN / 中文) Full UI localization in English and Chinese. Toggle with one click. The teaching persona adapts to whatever language you write in. dint teaches you in your language, not its own. |
The loop:
You send a message
│
▼
┌─────────────────────────────────────────────┐
│ Agent assembles context: │
│ persona + memories + skills + knowledge │
│ + skills due for review (SM-2) │
└─────────────────┬───────────────────────────┘
▼
┌─────────────────────────────────────────────┐
│ LLM responds, calling tools as needed: │
│ memory · skills · knowledge · search · │
│ concept tracking · review scheduling │
└─────────────────┬───────────────────────────┘
▼
┌─────────────────────────────────────────────┐
│ Reply streams back token by token (SSE) │
└─────────────────┬───────────────────────────┘
▼
┌─────────────────────────────────────────────┐
│ Background reflection (async, non-blocking)│
│ → skill confidence · knowledge edges · │
│ durable memories · overclaiming check · │
│ belief correction · SM-2 scheduling │
└─────────────────┬───────────────────────────┘
▼
┌─────────────────────────────────────────────┐
│ Consolidation check (10% per turn) │
│ → merge duplicates · prune stale entries · │
│ keep the model compact and honest │
└─────────────────────────────────────────────┘
Configuration
| Variable | Description | Default |
|---|---|---|
OPENAI_API_KEY |
API key for your provider | (required) |
OPENAI_BASE_URL |
OpenAI-compatible endpoint | https://api.openai.com/v1 |
DINT_MODEL |
Model for teaching (must support tool calling) | gpt-4o-mini |
REFLECT_MODEL |
Model for background reflection | (same as DINT_MODEL) |
DATABASE_URL |
SQLite database path | dint.db |
MAX_TOOL_ROUNDS |
Max tool-call rounds per turn | 8 |
WEB_SEARCH_RESULTS |
Results per web search | 5 |
DINT_TEMPERATURE |
Sampling temperature | 0.7 |
All settings are also editable at runtime through the Settings panel in the web UI. Changes take effect immediately.
In multi-user mode, the API key and base URL are operator-owned and hidden from tenants. Each user can configure their own model, temperature, and behaviour knobs.
CLI options
dint [--host HOST] [--port PORT] [--multi-user]
| Flag | Description | Default |
|---|---|---|
--host |
Bind address | 0.0.0.0 |
--port |
Port to listen on | 7070 |
--multi-user |
Enable multi-user mode with accounts | (single-user) |
Requirements
- Python 3.10+
- An OpenAI-compatible API key (OpenAI, OpenRouter, Groq, Ollama, etc.)
- The model must support tool / function calling
The name
dint — as in "by dint of." Through force of your own effort.
You don't learn by being told. You learn by dint of thinking.
Also, it mean "dint is not a tool" too.
MIT Licensed
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file dint-1.3.1.tar.gz.
File metadata
- Download URL: dint-1.3.1.tar.gz
- Upload date:
- Size: 20.7 MB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: uv/0.11.28 {"installer":{"name":"uv","version":"0.11.28","subcommand":["publish"]},"python":null,"implementation":{"name":null,"version":null},"distro":{"name":"Fedora Linux","version":"43","id":"","libc":null},"system":{"name":null,"release":null},"cpu":null,"openssl_version":null,"setuptools_version":null,"rustc_version":null,"ci":null}
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
85f5abb5880635bbf55f42ec657bdc904b1e27a6eddcd42b8318465765cecfd9
|
|
| MD5 |
08134800d13f051e812cd10f418468aa
|
|
| BLAKE2b-256 |
0efb4648423cd81359c49df17bddd87d03b13e30f306b89ea457633c169f8b34
|
File details
Details for the file dint-1.3.1-py3-none-any.whl.
File metadata
- Download URL: dint-1.3.1-py3-none-any.whl
- Upload date:
- Size: 93.5 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: uv/0.11.28 {"installer":{"name":"uv","version":"0.11.28","subcommand":["publish"]},"python":null,"implementation":{"name":null,"version":null},"distro":{"name":"Fedora Linux","version":"43","id":"","libc":null},"system":{"name":null,"release":null},"cpu":null,"openssl_version":null,"setuptools_version":null,"rustc_version":null,"ci":null}
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
0e58b01a0ea9f3b2fced22e0c62d21aa0fa23ea547494257dd06fdd72c7d66d6
|
|
| MD5 |
4320a986286a1d02e31d5dc76bd061b2
|
|
| BLAKE2b-256 |
70c323aab237120071e49559d9efba319f7892045075b41f5863bc75086e967f
|