Repository files navigation

Cranberry

A small deep learning framework in Rust and Python

Unit TestsGitHub Stars

Overview

Cranberry is an educational project exploring how a tensor library, automatic differentiation, and a Rust-backed storage layer fit together. The Python front-end intentionally stays simple while the Rust extension supplies fast contiguous kernels and view manipulation utilities. Everything targets 32-bit floating point tensors and now offers optional CUDA acceleration for pointwise kernels alongside the CPU path.

Highlights

  • Python-first Tensor API backed by the StorageView PyO3 module.
  • Reverse-mode autograd with topological traversal, supporting gradient tracking through broadcasting and reshape/expand/permute transforms.
  • Contiguous CPU kernels for unary/binary ops plus sum/max reductions, with broadcasting handled in Python.
  • Optional CUDA backend for contiguous unary and binary operations when an NVIDIA GPU and toolkit are available.
  • Basic neural-network building blocks (nn.Linear, nn.ReLU, nn.Sequential) and stochastic gradient descent in optim.SGD.
  • Visualization helpers for autograd graphs (cranberry.features.visualize) and an MNIST downloader with caching (cranberry.features.datasets).

Current Status

Tensor & Autograd

  • Tensor stores data in a Rust StorageView and exposes .requires_grad, .grad, .backward().
  • backward() runs on scalar outputs; higher-rank tensors need manual reduction to a scalar loss.
  • Broadcasting, chaining, and reshape/expand/permute operations participate in autograd; gradients are accumulated in contiguous buffers.
  • Optional NumPy interoperability via Tensor.numpy() and Tensor.grad when the numpy extra is installed.

Operations

  • Unary: neg, sqrt, relu, exp, log plus derived helpers (sigmoid, tanh, gelu).
  • Binary: add, sub, mul, div with broadcasting semantics.
  • Reductions: sum, max, mean (derived from sum), softmax, log_softmax.
  • Movement: reshape, expand, permute, flatten, transpose, view.
  • Other helpers: 1D/2D matmul, linear, and sparse_categorical_crossentropy.

Random & Initialization

  • Deterministic RNG via Tensor.manual_seed.
  • Initializers: Tensor.randn, Tensor.uniform, Tensor.kaiming_uniform.

Neural Network Utilities

  • Modules: nn.Linear, nn.ReLU, nn.Sequential.
  • Optimizer: optim.SGD with in-place parameter updates and zero_grad() convenience.

Data & Visualization

  • features.datasets.fetch caches downloads under $XDG_CACHE_HOME (or ~/Library/Caches / ~/.cache) and falls back gracefully when caching is disabled.
  • features.datasets.mnist() returns tensors shaped (N, 1, 28, 28) for images and (N,) for labels.
  • features.visualize.plot_graph renders autograd graphs via Graphviz when the viz extra is installed.

Rust Extension

  • StorageView exposes contiguous tensor storage, reshaping, expanding, permuting, and random fills.
  • CPU backend implements SIMD-accelerated unary/binary kernels and reduction routines.
  • CUDA backend (via cudarc) mirrors the contiguous unary/binary kernels when a CUDA device is detected.
  • Views currently support up to rank-4 tensors; non-contiguous reshape/permute paths are under construction.

Limitations & Work in Progress

  • CUDA backend currently covers only contiguous unary/binary kernels; Metal remains stubbed out.
  • Autograd requires scalar losses and does not yet handle slicing/indexing/in-place mutations.
  • Views must be contiguous for most kernels; slicing and advanced indexing are not implemented.
  • Only float32 tensors are supported; dtype promotion and mixed precision are future work.
  • Batched matrix multiplication, convolutions, and additional operators are not yet implemented.
  • optim.SGD is the only optimizer; schedulers, Adam, and other training utilities are on the roadmap.

Installation

Requirements: Python 3.11 and a Rust toolchain (see rust-toolchain.toml).

Using uv:

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
uv python install 3.11
uv sync --dev
# Build the native extension in editable mode
uv run maturin develop

Using pip (requires Rust for the build step):

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
pip install -e .[numpy]

Optional extras:

  • pip install -e .[viz] for autograd visualization (requires Graphviz system binary).
  • pip install -e .[datasets] for download progress via tqdm.
  • pip install -e .[all] to include every extra.

CUDA backend

  • Requires an NVIDIA driver and CUDA toolkit (NVRTC must be discoverable via CUDA_HOME, CUDA_PATH, or the default /usr/local/cuda).
  • No separate nvcc build step is needed—the crate compiles its kernels at runtime using NVRTC.
  • At runtime pass device="cuda" when creating tensors/storage; contiguous unary and binary ops will execute on the GPU and fall back with a runtime error if no device is present.

Quickstart

importnumpyasnpfromcranberryimportnn, optim, Tensorfromcranberry.featuresimportdatasets# Download and reshape MNISTX_train, Y_train, X_test, Y_test=datasets.mnist()
X_train, X_test=X_train.flatten(1), X_test.flatten(1)
model=nn.Sequential(
nn.Linear(784, 128), nn.ReLU(),
nn.Linear(128, 64), nn.ReLU(),
nn.Linear(64, 10),
)
optimizer=optim.SGD(model.parameters(), lr=1e-3)
batch_size, epochs=128, 1N=X_train.shape[0]
X_train_np, Y_train_np=X_train.numpy(), Y_train.numpy()
forepochinrange(epochs):
perm=np.random.permutation(N)
forstartinrange(0, N, batch_size):
end=min(start+batch_size, N)
inputs=Tensor(X_train_np[perm[start:end]], requires_grad=False)
labels=Tensor(Y_train_np[perm[start:end]], requires_grad=False)
optimizer.zero_grad()
logits=model(inputs)
loss=logits.sparse_categorical_crossentropy(labels)
loss.backward()
optimizer.step()

More examples live in examples/.

Development

  • uv run pytest runs the Python test suite (requires the Rust extension to be built).
  • cargo test exercises the Rust core components.

License

MIT License (see LICENSE).

About

Deep learning framework in Rust and Python

Resources

Stars

10 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Add copy buttons to all
 blocks\n(function() {\n function addCopyButtons() {\n document.querySelectorAll('pre code').forEach(function(codeBlock) {\n if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;\n codeBlock.parentElement.setAttribute('data-copy-added', 'true');\n \n var btn = document.createElement('button');\n btn.textContent = 'Copy';\n btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';\n btn.onmouseover = function() { this.style.opacity = '1'; };\n btn.onmouseout = function() { this.style.opacity = '0.7'; };\n btn.onclick = function() {\n navigator.clipboard.writeText(codeBlock.textContent).then(function() {\n btn.textContent = 'Copied!';\n setTimeout(function() { btn.textContent = 'Copy'; }, 1500);\n });\n };\n codeBlock.parentElement.style.position = 'relative';\n codeBlock.parentElement.appendChild(btn);\n });\n }\n \n addCopyButtons();\n \n // Re-run on dynamic content\n var observer = new MutationObserver(addCopyButtons);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Add Copy Buttons to Code Blocks");
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
Skip to content

Repository files navigation

Cranberry

A small deep learning framework in Rust and Python

Unit TestsGitHub Stars

Overview

Cranberry is an educational project exploring how a tensor library, automatic differentiation, and a Rust-backed storage layer fit together. The Python front-end intentionally stays simple while the Rust extension supplies fast contiguous kernels and view manipulation utilities. Everything targets 32-bit floating point tensors and now offers optional CUDA acceleration for pointwise kernels alongside the CPU path.

Highlights

  • Python-first Tensor API backed by the StorageView PyO3 module.
  • Reverse-mode autograd with topological traversal, supporting gradient tracking through broadcasting and reshape/expand/permute transforms.
  • Contiguous CPU kernels for unary/binary ops plus sum/max reductions, with broadcasting handled in Python.
  • Optional CUDA backend for contiguous unary and binary operations when an NVIDIA GPU and toolkit are available.
  • Basic neural-network building blocks (nn.Linear, nn.ReLU, nn.Sequential) and stochastic gradient descent in optim.SGD.
  • Visualization helpers for autograd graphs (cranberry.features.visualize) and an MNIST downloader with caching (cranberry.features.datasets).

Current Status

Tensor & Autograd

  • Tensor stores data in a Rust StorageView and exposes .requires_grad, .grad, .backward().
  • backward() runs on scalar outputs; higher-rank tensors need manual reduction to a scalar loss.
  • Broadcasting, chaining, and reshape/expand/permute operations participate in autograd; gradients are accumulated in contiguous buffers.
  • Optional NumPy interoperability via Tensor.numpy() and Tensor.grad when the numpy extra is installed.

Operations

  • Unary: neg, sqrt, relu, exp, log plus derived helpers (sigmoid, tanh, gelu).
  • Binary: add, sub, mul, div with broadcasting semantics.
  • Reductions: sum, max, mean (derived from sum), softmax, log_softmax.
  • Movement: reshape, expand, permute, flatten, transpose, view.
  • Other helpers: 1D/2D matmul, linear, and sparse_categorical_crossentropy.

Random & Initialization

  • Deterministic RNG via Tensor.manual_seed.
  • Initializers: Tensor.randn, Tensor.uniform, Tensor.kaiming_uniform.

Neural Network Utilities

  • Modules: nn.Linear, nn.ReLU, nn.Sequential.
  • Optimizer: optim.SGD with in-place parameter updates and zero_grad() convenience.

Data & Visualization

  • features.datasets.fetch caches downloads under $XDG_CACHE_HOME (or ~/Library/Caches / ~/.cache) and falls back gracefully when caching is disabled.
  • features.datasets.mnist() returns tensors shaped (N, 1, 28, 28) for images and (N,) for labels.
  • features.visualize.plot_graph renders autograd graphs via Graphviz when the viz extra is installed.

Rust Extension

  • StorageView exposes contiguous tensor storage, reshaping, expanding, permuting, and random fills.
  • CPU backend implements SIMD-accelerated unary/binary kernels and reduction routines.
  • CUDA backend (via cudarc) mirrors the contiguous unary/binary kernels when a CUDA device is detected.
  • Views currently support up to rank-4 tensors; non-contiguous reshape/permute paths are under construction.

Limitations & Work in Progress

  • CUDA backend currently covers only contiguous unary/binary kernels; Metal remains stubbed out.
  • Autograd requires scalar losses and does not yet handle slicing/indexing/in-place mutations.
  • Views must be contiguous for most kernels; slicing and advanced indexing are not implemented.
  • Only float32 tensors are supported; dtype promotion and mixed precision are future work.
  • Batched matrix multiplication, convolutions, and additional operators are not yet implemented.
  • optim.SGD is the only optimizer; schedulers, Adam, and other training utilities are on the roadmap.

Installation

Requirements: Python 3.11 and a Rust toolchain (see rust-toolchain.toml).

Using uv:

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
uv python install 3.11
uv sync --dev
# Build the native extension in editable mode
uv run maturin develop

Using pip (requires Rust for the build step):

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
pip install -e .[numpy]

Optional extras:

  • pip install -e .[viz] for autograd visualization (requires Graphviz system binary).
  • pip install -e .[datasets] for download progress via tqdm.
  • pip install -e .[all] to include every extra.

CUDA backend

  • Requires an NVIDIA driver and CUDA toolkit (NVRTC must be discoverable via CUDA_HOME, CUDA_PATH, or the default /usr/local/cuda).
  • No separate nvcc build step is needed—the crate compiles its kernels at runtime using NVRTC.
  • At runtime pass device="cuda" when creating tensors/storage; contiguous unary and binary ops will execute on the GPU and fall back with a runtime error if no device is present.

Quickstart

importnumpyasnpfromcranberryimportnn, optim, Tensorfromcranberry.featuresimportdatasets# Download and reshape MNISTX_train, Y_train, X_test, Y_test=datasets.mnist()
X_train, X_test=X_train.flatten(1), X_test.flatten(1)
model=nn.Sequential(
nn.Linear(784, 128), nn.ReLU(),
nn.Linear(128, 64), nn.ReLU(),
nn.Linear(64, 10),
)
optimizer=optim.SGD(model.parameters(), lr=1e-3)
batch_size, epochs=128, 1N=X_train.shape[0]
X_train_np, Y_train_np=X_train.numpy(), Y_train.numpy()
forepochinrange(epochs):
perm=np.random.permutation(N)
forstartinrange(0, N, batch_size):
end=min(start+batch_size, N)
inputs=Tensor(X_train_np[perm[start:end]], requires_grad=False)
labels=Tensor(Y_train_np[perm[start:end]], requires_grad=False)
optimizer.zero_grad()
logits=model(inputs)
loss=logits.sparse_categorical_crossentropy(labels)
loss.backward()
optimizer.step()

More examples live in examples/.

Development

  • uv run pytest runs the Python test suite (requires the Rust extension to be built).
  • cargo test exercises the Rust core components.

License

MIT License (see LICENSE).

About

Deep learning framework in Rust and Python

Resources

Stars

10 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Force GitHub README to respect dark mode\n(function() {\n var style = document.createElement('style');\n style.textContent = '\n .markdown-body {\n color-scheme: dark light;\n }\n .markdown-body pre { background: #161b22 !important; }\n .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }\n .markdown-body table th, .markdown-body table td { border-color: #30363d !important; }\n .markdown-body img { background: #0d1117; }\n .markdown-body blockquote { border-left-color: #8b949e; }\n .markdown-body hr { border-color: #30363d; }\n ';\n document.head.appendChild(style);\n})();", "GitHub Dark Mode README Fix"); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content

Repository files navigation

Cranberry

A small deep learning framework in Rust and Python

Unit TestsGitHub Stars

Overview

Cranberry is an educational project exploring how a tensor library, automatic differentiation, and a Rust-backed storage layer fit together. The Python front-end intentionally stays simple while the Rust extension supplies fast contiguous kernels and view manipulation utilities. Everything targets 32-bit floating point tensors and now offers optional CUDA acceleration for pointwise kernels alongside the CPU path.

Highlights

  • Python-first Tensor API backed by the StorageView PyO3 module.
  • Reverse-mode autograd with topological traversal, supporting gradient tracking through broadcasting and reshape/expand/permute transforms.
  • Contiguous CPU kernels for unary/binary ops plus sum/max reductions, with broadcasting handled in Python.
  • Optional CUDA backend for contiguous unary and binary operations when an NVIDIA GPU and toolkit are available.
  • Basic neural-network building blocks (nn.Linear, nn.ReLU, nn.Sequential) and stochastic gradient descent in optim.SGD.
  • Visualization helpers for autograd graphs (cranberry.features.visualize) and an MNIST downloader with caching (cranberry.features.datasets).

Current Status

Tensor & Autograd

  • Tensor stores data in a Rust StorageView and exposes .requires_grad, .grad, .backward().
  • backward() runs on scalar outputs; higher-rank tensors need manual reduction to a scalar loss.
  • Broadcasting, chaining, and reshape/expand/permute operations participate in autograd; gradients are accumulated in contiguous buffers.
  • Optional NumPy interoperability via Tensor.numpy() and Tensor.grad when the numpy extra is installed.

Operations

  • Unary: neg, sqrt, relu, exp, log plus derived helpers (sigmoid, tanh, gelu).
  • Binary: add, sub, mul, div with broadcasting semantics.
  • Reductions: sum, max, mean (derived from sum), softmax, log_softmax.
  • Movement: reshape, expand, permute, flatten, transpose, view.
  • Other helpers: 1D/2D matmul, linear, and sparse_categorical_crossentropy.

Random & Initialization

  • Deterministic RNG via Tensor.manual_seed.
  • Initializers: Tensor.randn, Tensor.uniform, Tensor.kaiming_uniform.

Neural Network Utilities

  • Modules: nn.Linear, nn.ReLU, nn.Sequential.
  • Optimizer: optim.SGD with in-place parameter updates and zero_grad() convenience.

Data & Visualization

  • features.datasets.fetch caches downloads under $XDG_CACHE_HOME (or ~/Library/Caches / ~/.cache) and falls back gracefully when caching is disabled.
  • features.datasets.mnist() returns tensors shaped (N, 1, 28, 28) for images and (N,) for labels.
  • features.visualize.plot_graph renders autograd graphs via Graphviz when the viz extra is installed.

Rust Extension

  • StorageView exposes contiguous tensor storage, reshaping, expanding, permuting, and random fills.
  • CPU backend implements SIMD-accelerated unary/binary kernels and reduction routines.
  • CUDA backend (via cudarc) mirrors the contiguous unary/binary kernels when a CUDA device is detected.
  • Views currently support up to rank-4 tensors; non-contiguous reshape/permute paths are under construction.

Limitations & Work in Progress

  • CUDA backend currently covers only contiguous unary/binary kernels; Metal remains stubbed out.
  • Autograd requires scalar losses and does not yet handle slicing/indexing/in-place mutations.
  • Views must be contiguous for most kernels; slicing and advanced indexing are not implemented.
  • Only float32 tensors are supported; dtype promotion and mixed precision are future work.
  • Batched matrix multiplication, convolutions, and additional operators are not yet implemented.
  • optim.SGD is the only optimizer; schedulers, Adam, and other training utilities are on the roadmap.

Installation

Requirements: Python 3.11 and a Rust toolchain (see rust-toolchain.toml).

Using uv:

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
uv python install 3.11
uv sync --dev
# Build the native extension in editable mode
uv run maturin develop

Using pip (requires Rust for the build step):

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
pip install -e .[numpy]

Optional extras:

  • pip install -e .[viz] for autograd visualization (requires Graphviz system binary).
  • pip install -e .[datasets] for download progress via tqdm.
  • pip install -e .[all] to include every extra.

CUDA backend

  • Requires an NVIDIA driver and CUDA toolkit (NVRTC must be discoverable via CUDA_HOME, CUDA_PATH, or the default /usr/local/cuda).
  • No separate nvcc build step is needed—the crate compiles its kernels at runtime using NVRTC.
  • At runtime pass device="cuda" when creating tensors/storage; contiguous unary and binary ops will execute on the GPU and fall back with a runtime error if no device is present.

Quickstart

importnumpyasnpfromcranberryimportnn, optim, Tensorfromcranberry.featuresimportdatasets# Download and reshape MNISTX_train, Y_train, X_test, Y_test=datasets.mnist()
X_train, X_test=X_train.flatten(1), X_test.flatten(1)
model=nn.Sequential(
nn.Linear(784, 128), nn.ReLU(),
nn.Linear(128, 64), nn.ReLU(),
nn.Linear(64, 10),
)
optimizer=optim.SGD(model.parameters(), lr=1e-3)
batch_size, epochs=128, 1N=X_train.shape[0]
X_train_np, Y_train_np=X_train.numpy(), Y_train.numpy()
forepochinrange(epochs):
perm=np.random.permutation(N)
forstartinrange(0, N, batch_size):
end=min(start+batch_size, N)
inputs=Tensor(X_train_np[perm[start:end]], requires_grad=False)
labels=Tensor(Y_train_np[perm[start:end]], requires_grad=False)
optimizer.zero_grad()
logits=model(inputs)
loss=logits.sparse_categorical_crossentropy(labels)
loss.backward()
optimizer.step()

More examples live in examples/.

Development

  • uv run pytest runs the Python test suite (requires the Rust extension to be built).
  • cargo test exercises the Rust core components.

License

MIT License (see LICENSE).

About

Deep learning framework in Rust and Python

Resources

Stars

10 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Highlight search terms from Google/DuckDuckGo/Bing referrer\n(function() {\n var ref = document.referrer;\n var terms = [];\n \n if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {\n var url = new URL(ref);\n var q = url.searchParams.get('q') || url.searchParams.get('p');\n if (q) {\n terms = q.split(/\\s+/).filter(function(t) { return t.length > 2; });\n }\n }\n \n if (terms.length === 0) return;\n \n var style = document.createElement('style');\n style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';\n document.head.appendChild(style);\n \n function highlight(node) {\n if (node.nodeType === 3) { // text node\n var text = node.textContent;\n var found = false;\n terms.forEach(function(term) {\n var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\') + ')', 'gi');\n if (regex.test(text)) {\n found = true;\n var frag = document.createDocumentFragment();\n var parts = text.split(regex);\n parts.forEach(function(part, i) {\n if (i % 2 === 0) {\n frag.appendChild(document.createTextNode(part));\n } else {\n var span = document.createElement('span');\n span.className = 'userscript-highlight';\n span.textContent = part;\n frag.appendChild(span);\n }\n });\n node.parentNode.replaceChild(frag, node);\n }\n });\n } else if (node.nodeType === 1 && node.childNodes) { // element\n var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];\n if (!skipTags.includes(node.tagName)) {\n Array.from(node.childNodes).forEach(highlight);\n }\n }\n }\n \n highlight(document.body);\n \n // Re-highlight on dynamic content\n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1 || node.nodeType === 3) highlight(node);\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Highlight Search Terms"); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content

Repository files navigation

Cranberry

A small deep learning framework in Rust and Python

Unit TestsGitHub Stars

Overview

Cranberry is an educational project exploring how a tensor library, automatic differentiation, and a Rust-backed storage layer fit together. The Python front-end intentionally stays simple while the Rust extension supplies fast contiguous kernels and view manipulation utilities. Everything targets 32-bit floating point tensors and now offers optional CUDA acceleration for pointwise kernels alongside the CPU path.

Highlights

  • Python-first Tensor API backed by the StorageView PyO3 module.
  • Reverse-mode autograd with topological traversal, supporting gradient tracking through broadcasting and reshape/expand/permute transforms.
  • Contiguous CPU kernels for unary/binary ops plus sum/max reductions, with broadcasting handled in Python.
  • Optional CUDA backend for contiguous unary and binary operations when an NVIDIA GPU and toolkit are available.
  • Basic neural-network building blocks (nn.Linear, nn.ReLU, nn.Sequential) and stochastic gradient descent in optim.SGD.
  • Visualization helpers for autograd graphs (cranberry.features.visualize) and an MNIST downloader with caching (cranberry.features.datasets).

Current Status

Tensor & Autograd

  • Tensor stores data in a Rust StorageView and exposes .requires_grad, .grad, .backward().
  • backward() runs on scalar outputs; higher-rank tensors need manual reduction to a scalar loss.
  • Broadcasting, chaining, and reshape/expand/permute operations participate in autograd; gradients are accumulated in contiguous buffers.
  • Optional NumPy interoperability via Tensor.numpy() and Tensor.grad when the numpy extra is installed.

Operations

  • Unary: neg, sqrt, relu, exp, log plus derived helpers (sigmoid, tanh, gelu).
  • Binary: add, sub, mul, div with broadcasting semantics.
  • Reductions: sum, max, mean (derived from sum), softmax, log_softmax.
  • Movement: reshape, expand, permute, flatten, transpose, view.
  • Other helpers: 1D/2D matmul, linear, and sparse_categorical_crossentropy.

Random & Initialization

  • Deterministic RNG via Tensor.manual_seed.
  • Initializers: Tensor.randn, Tensor.uniform, Tensor.kaiming_uniform.

Neural Network Utilities

  • Modules: nn.Linear, nn.ReLU, nn.Sequential.
  • Optimizer: optim.SGD with in-place parameter updates and zero_grad() convenience.

Data & Visualization

  • features.datasets.fetch caches downloads under $XDG_CACHE_HOME (or ~/Library/Caches / ~/.cache) and falls back gracefully when caching is disabled.
  • features.datasets.mnist() returns tensors shaped (N, 1, 28, 28) for images and (N,) for labels.
  • features.visualize.plot_graph renders autograd graphs via Graphviz when the viz extra is installed.

Rust Extension

  • StorageView exposes contiguous tensor storage, reshaping, expanding, permuting, and random fills.
  • CPU backend implements SIMD-accelerated unary/binary kernels and reduction routines.
  • CUDA backend (via cudarc) mirrors the contiguous unary/binary kernels when a CUDA device is detected.
  • Views currently support up to rank-4 tensors; non-contiguous reshape/permute paths are under construction.

Limitations & Work in Progress

  • CUDA backend currently covers only contiguous unary/binary kernels; Metal remains stubbed out.
  • Autograd requires scalar losses and does not yet handle slicing/indexing/in-place mutations.
  • Views must be contiguous for most kernels; slicing and advanced indexing are not implemented.
  • Only float32 tensors are supported; dtype promotion and mixed precision are future work.
  • Batched matrix multiplication, convolutions, and additional operators are not yet implemented.
  • optim.SGD is the only optimizer; schedulers, Adam, and other training utilities are on the roadmap.

Installation

Requirements: Python 3.11 and a Rust toolchain (see rust-toolchain.toml).

Using uv:

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
uv python install 3.11
uv sync --dev
# Build the native extension in editable mode
uv run maturin develop

Using pip (requires Rust for the build step):

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
pip install -e .[numpy]

Optional extras:

  • pip install -e .[viz] for autograd visualization (requires Graphviz system binary).
  • pip install -e .[datasets] for download progress via tqdm.
  • pip install -e .[all] to include every extra.

CUDA backend

  • Requires an NVIDIA driver and CUDA toolkit (NVRTC must be discoverable via CUDA_HOME, CUDA_PATH, or the default /usr/local/cuda).
  • No separate nvcc build step is needed—the crate compiles its kernels at runtime using NVRTC.
  • At runtime pass device="cuda" when creating tensors/storage; contiguous unary and binary ops will execute on the GPU and fall back with a runtime error if no device is present.

Quickstart

importnumpyasnpfromcranberryimportnn, optim, Tensorfromcranberry.featuresimportdatasets# Download and reshape MNISTX_train, Y_train, X_test, Y_test=datasets.mnist()
X_train, X_test=X_train.flatten(1), X_test.flatten(1)
model=nn.Sequential(
nn.Linear(784, 128), nn.ReLU(),
nn.Linear(128, 64), nn.ReLU(),
nn.Linear(64, 10),
)
optimizer=optim.SGD(model.parameters(), lr=1e-3)
batch_size, epochs=128, 1N=X_train.shape[0]
X_train_np, Y_train_np=X_train.numpy(), Y_train.numpy()
forepochinrange(epochs):
perm=np.random.permutation(N)
forstartinrange(0, N, batch_size):
end=min(start+batch_size, N)
inputs=Tensor(X_train_np[perm[start:end]], requires_grad=False)
labels=Tensor(Y_train_np[perm[start:end]], requires_grad=False)
optimizer.zero_grad()
logits=model(inputs)
loss=logits.sparse_categorical_crossentropy(labels)
loss.backward()
optimizer.step()

More examples live in examples/.

Development

  • uv run pytest runs the Python test suite (requires the Rust extension to be built).
  • cargo test exercises the Rust core components.

License

MIT License (see LICENSE).

About

Deep learning framework in Rust and Python

Resources

Stars

10 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Strip utm_, fbclid, gclid, etc. from all links on page\n(function() {\n var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',\n 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',\n 'ref', 'ref_src', 'source', 'medium', 'campaign'];\n \n function cleanUrl(url) {\n try {\n var u = new URL(url, window.location.origin);\n var changed = false;\n trackingParams.forEach(function(p) {\n if (u.searchParams.has(p)) {\n u.searchParams.delete(p);\n changed = true;\n }\n });\n return changed ? u.toString() : url;\n } catch (e) {\n return url;\n }\n }\n \n function cleanLinks() {\n document.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n \n cleanLinks();\n \n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1) {\n if (node.tagName === 'A') cleanLinks();\n node.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Remove Tracking Parameters from Links"); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + '
Skip to content

Repository files navigation

Cranberry

A small deep learning framework in Rust and Python

Unit TestsGitHub Stars

Overview

Cranberry is an educational project exploring how a tensor library, automatic differentiation, and a Rust-backed storage layer fit together. The Python front-end intentionally stays simple while the Rust extension supplies fast contiguous kernels and view manipulation utilities. Everything targets 32-bit floating point tensors and now offers optional CUDA acceleration for pointwise kernels alongside the CPU path.

Highlights

  • Python-first Tensor API backed by the StorageView PyO3 module.
  • Reverse-mode autograd with topological traversal, supporting gradient tracking through broadcasting and reshape/expand/permute transforms.
  • Contiguous CPU kernels for unary/binary ops plus sum/max reductions, with broadcasting handled in Python.
  • Optional CUDA backend for contiguous unary and binary operations when an NVIDIA GPU and toolkit are available.
  • Basic neural-network building blocks (nn.Linear, nn.ReLU, nn.Sequential) and stochastic gradient descent in optim.SGD.
  • Visualization helpers for autograd graphs (cranberry.features.visualize) and an MNIST downloader with caching (cranberry.features.datasets).

Current Status

Tensor & Autograd

  • Tensor stores data in a Rust StorageView and exposes .requires_grad, .grad, .backward().
  • backward() runs on scalar outputs; higher-rank tensors need manual reduction to a scalar loss.
  • Broadcasting, chaining, and reshape/expand/permute operations participate in autograd; gradients are accumulated in contiguous buffers.
  • Optional NumPy interoperability via Tensor.numpy() and Tensor.grad when the numpy extra is installed.

Operations

  • Unary: neg, sqrt, relu, exp, log plus derived helpers (sigmoid, tanh, gelu).
  • Binary: add, sub, mul, div with broadcasting semantics.
  • Reductions: sum, max, mean (derived from sum), softmax, log_softmax.
  • Movement: reshape, expand, permute, flatten, transpose, view.
  • Other helpers: 1D/2D matmul, linear, and sparse_categorical_crossentropy.

Random & Initialization

  • Deterministic RNG via Tensor.manual_seed.
  • Initializers: Tensor.randn, Tensor.uniform, Tensor.kaiming_uniform.

Neural Network Utilities

  • Modules: nn.Linear, nn.ReLU, nn.Sequential.
  • Optimizer: optim.SGD with in-place parameter updates and zero_grad() convenience.

Data & Visualization

  • features.datasets.fetch caches downloads under $XDG_CACHE_HOME (or ~/Library/Caches / ~/.cache) and falls back gracefully when caching is disabled.
  • features.datasets.mnist() returns tensors shaped (N, 1, 28, 28) for images and (N,) for labels.
  • features.visualize.plot_graph renders autograd graphs via Graphviz when the viz extra is installed.

Rust Extension

  • StorageView exposes contiguous tensor storage, reshaping, expanding, permuting, and random fills.
  • CPU backend implements SIMD-accelerated unary/binary kernels and reduction routines.
  • CUDA backend (via cudarc) mirrors the contiguous unary/binary kernels when a CUDA device is detected.
  • Views currently support up to rank-4 tensors; non-contiguous reshape/permute paths are under construction.

Limitations & Work in Progress

  • CUDA backend currently covers only contiguous unary/binary kernels; Metal remains stubbed out.
  • Autograd requires scalar losses and does not yet handle slicing/indexing/in-place mutations.
  • Views must be contiguous for most kernels; slicing and advanced indexing are not implemented.
  • Only float32 tensors are supported; dtype promotion and mixed precision are future work.
  • Batched matrix multiplication, convolutions, and additional operators are not yet implemented.
  • optim.SGD is the only optimizer; schedulers, Adam, and other training utilities are on the roadmap.

Installation

Requirements: Python 3.11 and a Rust toolchain (see rust-toolchain.toml).

Using uv:

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
uv python install 3.11
uv sync --dev
# Build the native extension in editable mode
uv run maturin develop

Using pip (requires Rust for the build step):

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
pip install -e .[numpy]

Optional extras:

  • pip install -e .[viz] for autograd visualization (requires Graphviz system binary).
  • pip install -e .[datasets] for download progress via tqdm.
  • pip install -e .[all] to include every extra.

CUDA backend

  • Requires an NVIDIA driver and CUDA toolkit (NVRTC must be discoverable via CUDA_HOME, CUDA_PATH, or the default /usr/local/cuda).
  • No separate nvcc build step is needed—the crate compiles its kernels at runtime using NVRTC.
  • At runtime pass device="cuda" when creating tensors/storage; contiguous unary and binary ops will execute on the GPU and fall back with a runtime error if no device is present.

Quickstart

importnumpyasnpfromcranberryimportnn, optim, Tensorfromcranberry.featuresimportdatasets# Download and reshape MNISTX_train, Y_train, X_test, Y_test=datasets.mnist()
X_train, X_test=X_train.flatten(1), X_test.flatten(1)
model=nn.Sequential(
nn.Linear(784, 128), nn.ReLU(),
nn.Linear(128, 64), nn.ReLU(),
nn.Linear(64, 10),
)
optimizer=optim.SGD(model.parameters(), lr=1e-3)
batch_size, epochs=128, 1N=X_train.shape[0]
X_train_np, Y_train_np=X_train.numpy(), Y_train.numpy()
forepochinrange(epochs):
perm=np.random.permutation(N)
forstartinrange(0, N, batch_size):
end=min(start+batch_size, N)
inputs=Tensor(X_train_np[perm[start:end]], requires_grad=False)
labels=Tensor(Y_train_np[perm[start:end]], requires_grad=False)
optimizer.zero_grad()
logits=model(inputs)
loss=logits.sparse_categorical_crossentropy(labels)
loss.backward()
optimizer.step()

More examples live in examples/.

Development

  • uv run pytest runs the Python test suite (requires the Rust extension to be built).
  • cargo test exercises the Rust core components.

License

MIT License (see LICENSE).

About

Deep learning framework in Rust and Python

Resources

Stars

10 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Auto-enable theater mode on YouTube\n(function() {\n function tryTheater() {\n var btn = document.querySelector('button[aria-label=\"Theater mode\"], ytd-player #player button[title=\"Theater mode\"]');\n if (btn && !btn.classList.contains('activated')) {\n btn.click();\n }\n }\n \n // Try immediately\n tryTheater();\n \n // Try after navigation (SPA)\n var lastUrl = location.href;\n setInterval(function() {\n if (location.href !== lastUrl) {\n lastUrl = location.href;\n setTimeout(tryTheater, 500);\n }\n }, 1000);\n \n // Also try on player load\n var observer = new MutationObserver(tryTheater);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "YouTube Theater Mode Default"); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content

Repository files navigation

Cranberry

A small deep learning framework in Rust and Python

Unit TestsGitHub Stars

Overview

Cranberry is an educational project exploring how a tensor library, automatic differentiation, and a Rust-backed storage layer fit together. The Python front-end intentionally stays simple while the Rust extension supplies fast contiguous kernels and view manipulation utilities. Everything targets 32-bit floating point tensors and now offers optional CUDA acceleration for pointwise kernels alongside the CPU path.

Highlights

  • Python-first Tensor API backed by the StorageView PyO3 module.
  • Reverse-mode autograd with topological traversal, supporting gradient tracking through broadcasting and reshape/expand/permute transforms.
  • Contiguous CPU kernels for unary/binary ops plus sum/max reductions, with broadcasting handled in Python.
  • Optional CUDA backend for contiguous unary and binary operations when an NVIDIA GPU and toolkit are available.
  • Basic neural-network building blocks (nn.Linear, nn.ReLU, nn.Sequential) and stochastic gradient descent in optim.SGD.
  • Visualization helpers for autograd graphs (cranberry.features.visualize) and an MNIST downloader with caching (cranberry.features.datasets).

Current Status

Tensor & Autograd

  • Tensor stores data in a Rust StorageView and exposes .requires_grad, .grad, .backward().
  • backward() runs on scalar outputs; higher-rank tensors need manual reduction to a scalar loss.
  • Broadcasting, chaining, and reshape/expand/permute operations participate in autograd; gradients are accumulated in contiguous buffers.
  • Optional NumPy interoperability via Tensor.numpy() and Tensor.grad when the numpy extra is installed.

Operations

  • Unary: neg, sqrt, relu, exp, log plus derived helpers (sigmoid, tanh, gelu).
  • Binary: add, sub, mul, div with broadcasting semantics.
  • Reductions: sum, max, mean (derived from sum), softmax, log_softmax.
  • Movement: reshape, expand, permute, flatten, transpose, view.
  • Other helpers: 1D/2D matmul, linear, and sparse_categorical_crossentropy.

Random & Initialization

  • Deterministic RNG via Tensor.manual_seed.
  • Initializers: Tensor.randn, Tensor.uniform, Tensor.kaiming_uniform.

Neural Network Utilities

  • Modules: nn.Linear, nn.ReLU, nn.Sequential.
  • Optimizer: optim.SGD with in-place parameter updates and zero_grad() convenience.

Data & Visualization

  • features.datasets.fetch caches downloads under $XDG_CACHE_HOME (or ~/Library/Caches / ~/.cache) and falls back gracefully when caching is disabled.
  • features.datasets.mnist() returns tensors shaped (N, 1, 28, 28) for images and (N,) for labels.
  • features.visualize.plot_graph renders autograd graphs via Graphviz when the viz extra is installed.

Rust Extension

  • StorageView exposes contiguous tensor storage, reshaping, expanding, permuting, and random fills.
  • CPU backend implements SIMD-accelerated unary/binary kernels and reduction routines.
  • CUDA backend (via cudarc) mirrors the contiguous unary/binary kernels when a CUDA device is detected.
  • Views currently support up to rank-4 tensors; non-contiguous reshape/permute paths are under construction.

Limitations & Work in Progress

  • CUDA backend currently covers only contiguous unary/binary kernels; Metal remains stubbed out.
  • Autograd requires scalar losses and does not yet handle slicing/indexing/in-place mutations.
  • Views must be contiguous for most kernels; slicing and advanced indexing are not implemented.
  • Only float32 tensors are supported; dtype promotion and mixed precision are future work.
  • Batched matrix multiplication, convolutions, and additional operators are not yet implemented.
  • optim.SGD is the only optimizer; schedulers, Adam, and other training utilities are on the roadmap.

Installation

Requirements: Python 3.11 and a Rust toolchain (see rust-toolchain.toml).

Using uv:

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
uv python install 3.11
uv sync --dev
# Build the native extension in editable mode
uv run maturin develop

Using pip (requires Rust for the build step):

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
pip install -e .[numpy]

Optional extras:

  • pip install -e .[viz] for autograd visualization (requires Graphviz system binary).
  • pip install -e .[datasets] for download progress via tqdm.
  • pip install -e .[all] to include every extra.

CUDA backend

  • Requires an NVIDIA driver and CUDA toolkit (NVRTC must be discoverable via CUDA_HOME, CUDA_PATH, or the default /usr/local/cuda).
  • No separate nvcc build step is needed—the crate compiles its kernels at runtime using NVRTC.
  • At runtime pass device="cuda" when creating tensors/storage; contiguous unary and binary ops will execute on the GPU and fall back with a runtime error if no device is present.

Quickstart

importnumpyasnpfromcranberryimportnn, optim, Tensorfromcranberry.featuresimportdatasets# Download and reshape MNISTX_train, Y_train, X_test, Y_test=datasets.mnist()
X_train, X_test=X_train.flatten(1), X_test.flatten(1)
model=nn.Sequential(
nn.Linear(784, 128), nn.ReLU(),
nn.Linear(128, 64), nn.ReLU(),
nn.Linear(64, 10),
)
optimizer=optim.SGD(model.parameters(), lr=1e-3)
batch_size, epochs=128, 1N=X_train.shape[0]
X_train_np, Y_train_np=X_train.numpy(), Y_train.numpy()
forepochinrange(epochs):
perm=np.random.permutation(N)
forstartinrange(0, N, batch_size):
end=min(start+batch_size, N)
inputs=Tensor(X_train_np[perm[start:end]], requires_grad=False)
labels=Tensor(Y_train_np[perm[start:end]], requires_grad=False)
optimizer.zero_grad()
logits=model(inputs)
loss=logits.sparse_categorical_crossentropy(labels)
loss.backward()
optimizer.step()

More examples live in examples/.

Development

  • uv run pytest runs the Python test suite (requires the Rust extension to be built).
  • cargo test exercises the Rust core components.

License

MIT License (see LICENSE).

About

Deep learning framework in Rust and Python

Resources

Stars

10 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Remove or un-stick sticky/fixed headers that block content\n(function() {\n function unstick() {\n document.querySelectorAll('header, nav, [role=\"banner\"], .header, .navbar, .sticky, .fixed-top, [style*=\"position: fixed\"], [style*=\"position:sticky\"]').forEach(function(el) {\n if (el.style.position === 'fixed' || el.style.position === 'sticky' || \n getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {\n el.style.position = 'static';\n el.style.top = 'auto';\n el.style.zIndex = 'auto';\n }\n });\n }\n \n unstick();\n \n var observer = new MutationObserver(unstick);\n observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });\n})();", "Kill Sticky Headers"); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content

Repository files navigation

Cranberry

A small deep learning framework in Rust and Python

Unit TestsGitHub Stars

Overview

Cranberry is an educational project exploring how a tensor library, automatic differentiation, and a Rust-backed storage layer fit together. The Python front-end intentionally stays simple while the Rust extension supplies fast contiguous kernels and view manipulation utilities. Everything targets 32-bit floating point tensors and now offers optional CUDA acceleration for pointwise kernels alongside the CPU path.

Highlights

  • Python-first Tensor API backed by the StorageView PyO3 module.
  • Reverse-mode autograd with topological traversal, supporting gradient tracking through broadcasting and reshape/expand/permute transforms.
  • Contiguous CPU kernels for unary/binary ops plus sum/max reductions, with broadcasting handled in Python.
  • Optional CUDA backend for contiguous unary and binary operations when an NVIDIA GPU and toolkit are available.
  • Basic neural-network building blocks (nn.Linear, nn.ReLU, nn.Sequential) and stochastic gradient descent in optim.SGD.
  • Visualization helpers for autograd graphs (cranberry.features.visualize) and an MNIST downloader with caching (cranberry.features.datasets).

Current Status

Tensor & Autograd

  • Tensor stores data in a Rust StorageView and exposes .requires_grad, .grad, .backward().
  • backward() runs on scalar outputs; higher-rank tensors need manual reduction to a scalar loss.
  • Broadcasting, chaining, and reshape/expand/permute operations participate in autograd; gradients are accumulated in contiguous buffers.
  • Optional NumPy interoperability via Tensor.numpy() and Tensor.grad when the numpy extra is installed.

Operations

  • Unary: neg, sqrt, relu, exp, log plus derived helpers (sigmoid, tanh, gelu).
  • Binary: add, sub, mul, div with broadcasting semantics.
  • Reductions: sum, max, mean (derived from sum), softmax, log_softmax.
  • Movement: reshape, expand, permute, flatten, transpose, view.
  • Other helpers: 1D/2D matmul, linear, and sparse_categorical_crossentropy.

Random & Initialization

  • Deterministic RNG via Tensor.manual_seed.
  • Initializers: Tensor.randn, Tensor.uniform, Tensor.kaiming_uniform.

Neural Network Utilities

  • Modules: nn.Linear, nn.ReLU, nn.Sequential.
  • Optimizer: optim.SGD with in-place parameter updates and zero_grad() convenience.

Data & Visualization

  • features.datasets.fetch caches downloads under $XDG_CACHE_HOME (or ~/Library/Caches / ~/.cache) and falls back gracefully when caching is disabled.
  • features.datasets.mnist() returns tensors shaped (N, 1, 28, 28) for images and (N,) for labels.
  • features.visualize.plot_graph renders autograd graphs via Graphviz when the viz extra is installed.

Rust Extension

  • StorageView exposes contiguous tensor storage, reshaping, expanding, permuting, and random fills.
  • CPU backend implements SIMD-accelerated unary/binary kernels and reduction routines.
  • CUDA backend (via cudarc) mirrors the contiguous unary/binary kernels when a CUDA device is detected.
  • Views currently support up to rank-4 tensors; non-contiguous reshape/permute paths are under construction.

Limitations & Work in Progress

  • CUDA backend currently covers only contiguous unary/binary kernels; Metal remains stubbed out.
  • Autograd requires scalar losses and does not yet handle slicing/indexing/in-place mutations.
  • Views must be contiguous for most kernels; slicing and advanced indexing are not implemented.
  • Only float32 tensors are supported; dtype promotion and mixed precision are future work.
  • Batched matrix multiplication, convolutions, and additional operators are not yet implemented.
  • optim.SGD is the only optimizer; schedulers, Adam, and other training utilities are on the roadmap.

Installation

Requirements: Python 3.11 and a Rust toolchain (see rust-toolchain.toml).

Using uv:

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
uv python install 3.11
uv sync --dev
# Build the native extension in editable mode
uv run maturin develop

Using pip (requires Rust for the build step):

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
pip install -e .[numpy]

Optional extras:

  • pip install -e .[viz] for autograd visualization (requires Graphviz system binary).
  • pip install -e .[datasets] for download progress via tqdm.
  • pip install -e .[all] to include every extra.

CUDA backend

  • Requires an NVIDIA driver and CUDA toolkit (NVRTC must be discoverable via CUDA_HOME, CUDA_PATH, or the default /usr/local/cuda).
  • No separate nvcc build step is needed—the crate compiles its kernels at runtime using NVRTC.
  • At runtime pass device="cuda" when creating tensors/storage; contiguous unary and binary ops will execute on the GPU and fall back with a runtime error if no device is present.

Quickstart

importnumpyasnpfromcranberryimportnn, optim, Tensorfromcranberry.featuresimportdatasets# Download and reshape MNISTX_train, Y_train, X_test, Y_test=datasets.mnist()
X_train, X_test=X_train.flatten(1), X_test.flatten(1)
model=nn.Sequential(
nn.Linear(784, 128), nn.ReLU(),
nn.Linear(128, 64), nn.ReLU(),
nn.Linear(64, 10),
)
optimizer=optim.SGD(model.parameters(), lr=1e-3)
batch_size, epochs=128, 1N=X_train.shape[0]
X_train_np, Y_train_np=X_train.numpy(), Y_train.numpy()
forepochinrange(epochs):
perm=np.random.permutation(N)
forstartinrange(0, N, batch_size):
end=min(start+batch_size, N)
inputs=Tensor(X_train_np[perm[start:end]], requires_grad=False)
labels=Tensor(Y_train_np[perm[start:end]], requires_grad=False)
optimizer.zero_grad()
logits=model(inputs)
loss=logits.sparse_categorical_crossentropy(labels)
loss.backward()
optimizer.step()

More examples live in examples/.

Development

  • uv run pytest runs the Python test suite (requires the Rust extension to be built).
  • cargo test exercises the Rust core components.

License

MIT License (see LICENSE).

About

Deep learning framework in Rust and Python

Resources

Stars

10 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Universal Dark Mode - works on any site\n(function() {\n var enabled = true;\n \n function applyDarkMode() {\n if (!enabled) return;\n \n // Create style element if it doesn't exist\n var style = document.getElementById('universal-dark-mode-style');\n if (!style) {\n style = document.createElement('style');\n style.id = 'universal-dark-mode-style';\n document.head.appendChild(style);\n }\n \n // Dark mode CSS - inverts colors but preserves images/video\n style.textContent = '\n /* Invert everything except media */\n html {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #1a1a2e !important;\n }\n \n /* Restore images, videos, iframes, canvas */\n img, video, iframe, canvas, svg, picture, [style*=\"background-image\"] {\n filter: invert(1) hue-rotate(180deg) !important;\n }\n \n /* Preserve specific elements that should not be inverted */\n .no-dark-mode, .no-dark-mode *,\n [data-theme=\"light\"], [data-theme=\"light\"],\n .ace_editor, .ace_editor *,\n .CodeMirror, .CodeMirror *,\n .monaco-editor, .monaco-editor *,\n .markdown-body pre, .markdown-body pre *,\n .highlight, .highlight *,\n pre code, pre code * {\n filter: none !important;\n }\n \n /* Fix common UI elements */\n .modal, .popup, .dropdown-menu, .tooltip, .popover {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #2d2d44 !important;\n border-color: #444 !important;\n }\n \n /* Scrollbars */\n ::-webkit-scrollbar { background: #1a1a2e !important; }\n ::-webkit-scrollbar-thumb { background: #444 !important; }\n ::-webkit-scrollbar-thumb:hover { background: #555 !important; }\n \n /* Selection */\n ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ';\n }\n \n function removeDarkMode() {\n var style = document.getElementById('universal-dark-mode-style');\n if (style) style.remove();\n }\n \n // Toggle with Alt+Shift+D\n document.addEventListener('keydown', function(e) {\n if (e.altKey && e.shiftKey && e.key === 'D') {\n e.preventDefault();\n enabled = !enabled;\n if (enabled) {\n applyDarkMode();\n console.log('[Universal Dark Mode] Enabled');\n } else {\n removeDarkMode();\n console.log('[Universal Dark Mode] Disabled');\n }\n }\n });\n \n // Apply on load\n applyDarkMode();\n \n // Re-apply on dynamic content\n var observer = new MutationObserver(function(mutations) {\n if (enabled && !document.getElementById('universal-dark-mode-style')) {\n applyDarkMode();\n }\n });\n observer.observe(document.head, { childList: true });\n \n console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle');\n})();", "Universal Dark Mode"); } } catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); } })(); })();
Skip to content

Repository files navigation

Cranberry

A small deep learning framework in Rust and Python

Unit TestsGitHub Stars

Overview

Cranberry is an educational project exploring how a tensor library, automatic differentiation, and a Rust-backed storage layer fit together. The Python front-end intentionally stays simple while the Rust extension supplies fast contiguous kernels and view manipulation utilities. Everything targets 32-bit floating point tensors and now offers optional CUDA acceleration for pointwise kernels alongside the CPU path.

Highlights

  • Python-first Tensor API backed by the StorageView PyO3 module.
  • Reverse-mode autograd with topological traversal, supporting gradient tracking through broadcasting and reshape/expand/permute transforms.
  • Contiguous CPU kernels for unary/binary ops plus sum/max reductions, with broadcasting handled in Python.
  • Optional CUDA backend for contiguous unary and binary operations when an NVIDIA GPU and toolkit are available.
  • Basic neural-network building blocks (nn.Linear, nn.ReLU, nn.Sequential) and stochastic gradient descent in optim.SGD.
  • Visualization helpers for autograd graphs (cranberry.features.visualize) and an MNIST downloader with caching (cranberry.features.datasets).

Current Status

Tensor & Autograd

  • Tensor stores data in a Rust StorageView and exposes .requires_grad, .grad, .backward().
  • backward() runs on scalar outputs; higher-rank tensors need manual reduction to a scalar loss.
  • Broadcasting, chaining, and reshape/expand/permute operations participate in autograd; gradients are accumulated in contiguous buffers.
  • Optional NumPy interoperability via Tensor.numpy() and Tensor.grad when the numpy extra is installed.

Operations

  • Unary: neg, sqrt, relu, exp, log plus derived helpers (sigmoid, tanh, gelu).
  • Binary: add, sub, mul, div with broadcasting semantics.
  • Reductions: sum, max, mean (derived from sum), softmax, log_softmax.
  • Movement: reshape, expand, permute, flatten, transpose, view.
  • Other helpers: 1D/2D matmul, linear, and sparse_categorical_crossentropy.

Random & Initialization

  • Deterministic RNG via Tensor.manual_seed.
  • Initializers: Tensor.randn, Tensor.uniform, Tensor.kaiming_uniform.

Neural Network Utilities

  • Modules: nn.Linear, nn.ReLU, nn.Sequential.
  • Optimizer: optim.SGD with in-place parameter updates and zero_grad() convenience.

Data & Visualization

  • features.datasets.fetch caches downloads under $XDG_CACHE_HOME (or ~/Library/Caches / ~/.cache) and falls back gracefully when caching is disabled.
  • features.datasets.mnist() returns tensors shaped (N, 1, 28, 28) for images and (N,) for labels.
  • features.visualize.plot_graph renders autograd graphs via Graphviz when the viz extra is installed.

Rust Extension

  • StorageView exposes contiguous tensor storage, reshaping, expanding, permuting, and random fills.
  • CPU backend implements SIMD-accelerated unary/binary kernels and reduction routines.
  • CUDA backend (via cudarc) mirrors the contiguous unary/binary kernels when a CUDA device is detected.
  • Views currently support up to rank-4 tensors; non-contiguous reshape/permute paths are under construction.

Limitations & Work in Progress

  • CUDA backend currently covers only contiguous unary/binary kernels; Metal remains stubbed out.
  • Autograd requires scalar losses and does not yet handle slicing/indexing/in-place mutations.
  • Views must be contiguous for most kernels; slicing and advanced indexing are not implemented.
  • Only float32 tensors are supported; dtype promotion and mixed precision are future work.
  • Batched matrix multiplication, convolutions, and additional operators are not yet implemented.
  • optim.SGD is the only optimizer; schedulers, Adam, and other training utilities are on the roadmap.

Installation

Requirements: Python 3.11 and a Rust toolchain (see rust-toolchain.toml).

Using uv:

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
uv python install 3.11
uv sync --dev
# Build the native extension in editable mode
uv run maturin develop

Using pip (requires Rust for the build step):

git clone https://github.com/manoflearning/cranberry.git
cd cranberry
pip install -e .[numpy]

Optional extras:

  • pip install -e .[viz] for autograd visualization (requires Graphviz system binary).
  • pip install -e .[datasets] for download progress via tqdm.
  • pip install -e .[all] to include every extra.

CUDA backend

  • Requires an NVIDIA driver and CUDA toolkit (NVRTC must be discoverable via CUDA_HOME, CUDA_PATH, or the default /usr/local/cuda).
  • No separate nvcc build step is needed—the crate compiles its kernels at runtime using NVRTC.
  • At runtime pass device="cuda" when creating tensors/storage; contiguous unary and binary ops will execute on the GPU and fall back with a runtime error if no device is present.

Quickstart

importnumpyasnpfromcranberryimportnn, optim, Tensorfromcranberry.featuresimportdatasets# Download and reshape MNISTX_train, Y_train, X_test, Y_test=datasets.mnist()
X_train, X_test=X_train.flatten(1), X_test.flatten(1)
model=nn.Sequential(
nn.Linear(784, 128), nn.ReLU(),
nn.Linear(128, 64), nn.ReLU(),
nn.Linear(64, 10),
)
optimizer=optim.SGD(model.parameters(), lr=1e-3)
batch_size, epochs=128, 1N=X_train.shape[0]
X_train_np, Y_train_np=X_train.numpy(), Y_train.numpy()
forepochinrange(epochs):
perm=np.random.permutation(N)
forstartinrange(0, N, batch_size):
end=min(start+batch_size, N)
inputs=Tensor(X_train_np[perm[start:end]], requires_grad=False)
labels=Tensor(Y_train_np[perm[start:end]], requires_grad=False)
optimizer.zero_grad()
logits=model(inputs)
loss=logits.sparse_categorical_crossentropy(labels)
loss.backward()
optimizer.step()

More examples live in examples/.

Development

  • uv run pytest runs the Python test suite (requires the Rust extension to be built).
  • cargo test exercises the Rust core components.

License

MIT License (see LICENSE).

About

Deep learning framework in Rust and Python

Resources

Stars

10 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages