Skip to main content
Version: v1.0.4

Getting Started

Target audience

End users who only wish to quickly set up Taichi for simulation or high-performance numerical computation.


For developers who are interested in the compiler, computer graphics, or high-performance computing, and would like to contribute new features or bug fixes to the Taichi programming language, see the Developer installation for more information on building Taichi from source.



3.6/3.7/3.8/3.9/3.10 (64-bit)


Taichi recommends installing Python from Miniforge conda if you are on a MacBook with M1 chip.

Supported systems and backends

The following table lists the supported operating systems and the backends that Taichi supports on these platforms:

  • ✔️: supported;
  • N/A: not available


To get started with the Taichi Language, simply install it with pip:

python3 -m pip install taichi

There are a few of extra requirements depend on which operating system you are using:

On Arch Linux, you need to install ncurses5-compat-libs package from the Arch User Repository: yaourt -S ncurses5-compat-libs

See the Installation Troubleshooting if you run into any issues when installing Taichi.

Hello, world!

We introduce the Taichi programming language through a very basic fractal example.

Running the Taichi code below using either python3 or ti example fractal (you can find more information about the Taichi CLI in the Command line utilities section) will give you an animation of Julia set:

import taichi as ti


n = 320
pixels = ti.field(dtype=float, shape=(n * 2, n))

def complex_sqr(z):
return ti.Vector([z[0]**2 - z[1]**2, z[1] * z[0] * 2])

def paint(t: float):
for i, j in pixels: # Parallelized over all pixels
c = ti.Vector([-0.8, ti.cos(t) * 0.2])
z = ti.Vector([i / n - 1, j / n - 0.5]) * 2
iterations = 0
while z.norm() < 20 and iterations < 50:
z = complex_sqr(z) + c
iterations += 1
pixels[i, j] = 1 - iterations * 0.02

gui = ti.GUI("Julia Set", res=(n * 2, n))

i = 0
while gui.running:
paint(i * 0.03)
i = i + 1

Let's dive into this simple Taichi program.

import taichi as ti

Taichi is a domain-specific language (DSL) embedded in Python.

To make Taichi as easy-to-use as a Python package, we have done heavy engineering with this goal in mind - letting every Python programmer write Taichi programs with minimal learning effort.

You can even use your favorite Python package management system, Python IDEs and other Python packages together with Taichi.

# Initialize Taichi and run it on CPU (default)
# - `arch=ti.gpu`: Run Taichi on GPU and has Taichi automatically detect the suitable backend
# - `arch=ti.cuda`: For the NVIDIA CUDA backend
# - `arch=ti.metal`: [macOS] For the Apple Metal backend
# - `arch=ti.opengl`: For the OpenGL backend
# - `arch=ti.vulkan`: For the Vulkan backend
# - `arch=ti.dx11`: For the DX11 backend
  • With arch=ti.gpu, Taichi first tries to run on CUDA. If CUDA is not supported on your machine, Taichi falls back on Metal, OpenGL, Vulkan, or DX11.
  • If no GPU backend (CUDA, Metal, OpenGL, Vulkan, or DX11) is supported, Taichi falls back to the CPU backend.

When running on the CUDA backend on Windows or ARM devices (for example NVIDIA Jetson), Taichi allocates 1 GB GPU memory for field storage by default.

To override this behavior, do either of the following:

  • Initialize Taichi using ti.init(arch=ti.cuda, device_memory_GB=3.4) to allocate 3.4 GB GPU memory,
  • Initialize Taichi using ti.init(arch=ti.cuda, device_memory_fraction=0.3) to allocate 30% of the GPU memory.

On platforms other than Windows or ARM devices, Taichi relies on its on-demand memory allocator to allocate memory adaptively.


Taichi is a data-oriented programming language where dense or spatially-sparse fields are the first-class citizens.

In the code above, pixels = ti.field(dtype=float, shape=(n * 2, n)) allocates a 2D dense field named pixels of size (640, 320) and element data type float.

Functions and kernels

Computation resides in Taichi kernels and Taichi functions.

Taichi kernels are defined with the decorator @ti.kernel. They can be called from Python to perform computation. Kernel arguments must be type-hinted (if any).

Taichi functions are defined with the decorator @ti.func. They can only be called by Taichi kernels or other Taichi functions.

See syntax for more details about Taichi kernels and functions.

The language used in Taichi kernels and functions looks exactly like Python, yet the Taichi frontend compiler converts it into a language that is compiled, statically-typed, lexically-scoped, parallel and differentiable.


Taichi scope vs. Python scope:

Everything decorated with @ti.kernel and @ti.func is in the Taichi scope and hence will be compiled by the Taichi compiler. Everything else is in the Python scope. They are simply Python native code.

  • Taichi kernels must be called from the Python-scope.
  • Taichi functions must be called from the Taichi-scope.

For those who come from the world of CUDA, ti.func corresponds to __device__ while ti.kernel corresponds to __global__.

  • Nested kernels are not supported.
  • Nested functions are supported.
  • Recursive functions are not supported for now.

Parallel for-loops

For loops at the outermost scope in a Taichi kernel is automatically parallelized. For loops can have two forms:

  • range-for loops
  • struct-for loops.

Range-for loops are no different from the Python for loops, except that they are parallelized when used at the outermost scope. Range-for loops can be nested.

def fill():
for i in range(10): # Parallelized
x[i] += i
s = 0
for j in range(5): # Serialized in each parallel thread
s += j
y[i] = s

def fill_3d():
# Parallelized for all 3 <= i < 8, 1 <= j < 6, 0 <= k < 9
for i, j, k in ti.ndrange((3, 8), (1, 6), 9):
x[i, j, k] = i + j + k

It is the loop at the outermost scope that gets parallelized, not the outermost loop.

def foo():
for i in range(10): # Parallelized :-)

def bar(k: ti.i32):
if k > 42:
for i in range(10): # Serial :-(

Struct-for loops are particularly useful when iterating over (sparse) field elements. In the above, for i, j in pixels loops over all the pixel coordinates, i.e.,(0, 0), (0, 1), (0, 2), ... , (0, 319), (1, 0), ..., (639, 319).


Struct-for is the key to sparse computation in Taichi, as it will only loop over active elements in a sparse field. In dense fields, all elements are active.


Struct-for loops must live at the outer-most scope of kernels. It is the loop at the outermost scope that gets parallelized, not the outermost loop.

x = [1, 2, 3]

def foo():
for i in x: # Parallelized :-)

def bar(k: ti.i32):
# The outermost scope is a `if` statement
if k > 42:
for i in x: # Not allowed. Struct-fors must live in the outermost scope.

break is not supported in parallel loops:

def foo():
for i in x:
break # Error!

for i in range(10):
break # Error!

def foo():
for i in x:
for j in range(10):
break # OK!

GUI system

Taichi provides a CPU-based GUI system for you to render your results on the screen.

gui = ti.GUI("Julia Set", res=(n * 2, n))

for i in range(1000000):
paint(i * 0.03)

Still have issues?

If you encounter any issue that is not covered here, feel free to report it by opening an issue on GitHub and including the details. We are always there to help!