i not want to go into AI / not even talk about it
but still read about it.
on 31.3.2026 try a mini AI ( on RPI4 )
see video:
https://www.youtube.com/watch?v=jGsfVJfzduI
using:
https://github.com/deepseek-ai/deepseek-r1
via:
https://ollama.com/
install:
curl -fsSL https://ollama.com/install.sh | sh
https://ollama.com/library/deepseek-r1
ollama run deepseek-r1:1.5b --verbose
and for test ( example 2 from video ):
>>> Write a Python function to check if a number is prime.
pi@rpi4:~/Projects $ mkdir AI
pi@rpi4:~/Projects $ cd AI
pi@rpi4:~/Projects/AI $ touch setup.txt
pi@rpi4:~/Projects/AI $ nano setup.txt
pi@rpi4:~/Projects/AI $ curl -fsSL https://ollama.com/install.sh | sh
>>> Installing ollama to /usr/local
>>> Downloading ollama-linux-arm64.tar.zst
######################################################################## 100.0%
>>> Creating ollama user...
>>> Adding ollama user to render group...
>>> Adding ollama user to video group...
>>> Adding current user to ollama group...
>>> Creating ollama systemd service...
>>> Enabling and starting ollama service...
Created symlink '/etc/systemd/system/default.target.wants/ollama.service' â '/etc/systemd/system/ollama.service'.
>>> The Ollama API is now available at 127.0.0.1:11434.
>>> Install complete. Run "ollama" from the command line.
WARNING: No NVIDIA/AMD GPU detected. Ollama will run in CPU-only mode.
pi@rpi4:~/Projects/AI $
pi@rpi4:~/Projects/AI $ ollama run deepseek-r1:1.5b --verbose
pulling manifest
pulling aabd4debf0c8: 100% 1.1 GB
pulling c5ad996bda6e: 100% 556 B
pulling 6e4c38e1172f: 100% 1.1 KB
pulling f4d24e9138dd: 100% 148 B
pulling a85fe2a2e58e: 100% 487 B
verifying sha256 digest
writing manifest
success
>>> Send a message (/? for help)
Write a Python function to check if a number is prime.
cpu 99% temp 84degC (here RPI4 4GB RAM no cooler)
total duration: 30m10s
eval rate: 2.24 tokens/s
in video see for RPI5 8GB
total duration: 5m24s
eval rate: 6.6 token/sec
result:
import math
def is_prime(n):
# Check if the input is an integer
if not isinstance(n, int):
return False
# Handle numbers less than or equal to 1
if n <= 1:
return False
# Check if the number is 2 (the smallest prime)
if n == 2:
return True
# If even and greater than 2, it's not a prime
if n % 2 == 0:
return False
# Determine the maximum divisor to check up to sqrt(n), inclusive
max_divisor = int(math.sqrt(n))
# Check for odd divisors from 3 to max_divisor (inclusive)
for i in range(3, max_divisor + 1, 2):
if n % i == 0:
return False
# If no divisors found, the number is prime
return True
(untested)
can also try:
https://openclaw.ai/
curl -fsSL https://openclaw.ai/install.sh | bash
