It currently has one interpreter, written in pure C.

01

02

03

04

05

06

07

08

02

03

04

05

06

07

08

![prime?]^n:

,^d: ?<dn

?%nd @+d1

0 1. 2.

\L [filter]

;[prime?]

[range]2$99.

,^d: ?<dn

?%nd @+d1

0 1. 2.

\L [filter]

;[prime?]

[range]2$99.

Above krrp program calculates all primes below a hundred. Try it online!

I mainly golf on codegolf.stackexchange.com which is also home to other programming puzzles.

Some answers of mine include:

- Detect heat waves (C)
- Make Gimbap cutter (krrp)
- Life and Death of Trees (C / Python 2)
- Is the matrix centrosymmetricâ€¦ and so is the code? (C)
- Generate TeX to typeset Sierpinski Triangle Fractal (C)
- When Fibonacci meets the Queens (Python 2)

My most recent contribution to the OEIS is sequence A325902:

Numbers whose neighbor's prime factors with multiplicity can be partitioned into two multisets of equal sum.

OEIS Userpage.