Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx skills add mindspore-ai/akg --skill triton-cuda-attentiongit clone --depth 1 https://github.com/mindspore-ai/akgWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/skills/mindspore-ai/akg/triton-cuda-attention)<a href="https://agentmods.dev/skills/mindspore-ai/akg/triton-cuda-attention"><img src="https://agentmods.dev/badge/skills/mindspore-ai/akg/triton-cuda-attention/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/skills/mindspore-ai/akg/triton-cuda-attention"><img src="https://agentmods.dev/badge/skills/mindspore-ai/akg/triton-cuda-attention.svg" alt="Reviewed on agentmods" width="80" height="20"></a>- NVIDIA SkillSpector pass
What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.00059 | $0.02655 |
| Opus 5 | $0.00030 | $0.01327 |
| Sonnet 5 | $0.00012 | $0.00531 |
| Haiku 4.5 | $0.00006 | $0.00265 |
Grade A, and why
triton-cuda-attention scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 8d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 209 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Triton-CUDA Attention
在线 Softmax 核心算法
Flash Attention 用分块 + 在线 Softmax 将内存从 O(L²) 降到 O(L)。每处理一个 KV 块:
# 维护三个状态: m_i(行最大值), l_i(exp和), acc(输出累加器)
qk = tl.dot(q, k) * sm_scale_log2e # Q @ K^T,预乘 log2(e) 以便用 exp2
m_ij = tl.maximum(m_i, tl.max(qk, 1)) # 更新最大值
p = tl.math.exp2(qk - m_ij[:, None]) # 数值稳定的 exp(CUDA 用 exp2 更快)
alpha = tl.math.exp2(m_i - m_ij) # 修正因子
l_i = l_i * alpha + tl.sum(p, 1) # 修正并更新分母
acc = acc * alpha[:, None] # 修正之前的累加结果
acc = tl.dot(p.to(v.dtype), v, acc) # 加上当前块贡献
m_i = m_ij
# 循环结束后: output = acc / l_i[:, None]
完整示例:标准 Flash Attention
输入 Q/K/V: (B, H, L, D),经过 A100 验证。
import torch
import triton
import triton.language as tl
import math
@triton.jit
def _flash_attn_fwd_kernel(
Q, K, V, Out,
sm_scale,
stride_qb, stride_qh, stride_qm, stride_qd,
stride_kb, stride_kh, stride_kn, stride_kd,
stride_vb, stride_vh, stride_vn, stride_vd,
stride_ob, stride_oh, stride_om, stride_od,
N_CTX,
NUM_HEADS: tl.constexpr,
BLOCK_M: tl.constexpr,
BLOCK_N: tl.constexpr,
D: tl.constexpr,
):
# grid = (cdiv(L, BLOCK_M), B * H)
pid_m = tl.program_id(0)
pid_bh = tl.program_id(1)
off_b = pid_bh // NUM_HEADS
off_h = pid_bh % NUM_HEADS
q_offset = off_b * stride_qb + off_h * stride_qh
k_offset = off_b * stride_kb + off_h * stride_kh
v_offset = off_b * stride_vb + off_h * stride_vh
o_offset = off_b * stride_ob + off_h * stride_oh
# K shape 声明为 (D, N_CTX),tl.dot(q, k) 直接得到 Q@K^T 无需转置
Q_block_ptr = tl.make_block_ptr(
base=Q + q_offset, shape=(N_CTX, D), strides=(stride_qm, stride_qd),
offsets=(pid_m * BLOCK_M, 0), block_shape=(BLOCK_M, D), order=(1, 0))
O_block_ptr = tl.make_block_ptr(
base=Out + o_offset, shape=(N_CTX, D), strides=(stride_om, stride_od),
offsets=(pid_m * BLOCK_M, 0), block_shape=(BLOCK_M, D), order=(1, 0))
K_block_ptr = tl.make_block_ptr(
base=K + k_offset, shape=(D, N_CTX), strides=(stride_kd, stride_kn),
offsets=(0, 0), block_shape=(D, BLOCK_N), order=(0, 1))
V_block_ptr = tl.make_block_ptr(
base=V + v_offset, shape=(N_CTX, D), strides=(stride_vn, stride_vd),
offsets=(0, 0), block_shape=(BLOCK_N, D), order=(1, 0))
m_i = tl.full([BLOCK_M], float("-inf"), dtype=tl.float32)
l_i = tl.full([BLOCK_M], 1.0, dtype=tl.float32)
acc = tl.zeros([BLOCK_M, D], dtype=tl.float32)
q = tl.load(Q_block_ptr)
sm_scale_log2e = sm_scale * 1.44269504
for start_n in range(0, N_CTX, BLOCK_N):
k = tl.load(K_block_ptr)
qk = tl.dot(q, k) * sm_scale_log2e
m_ij = tl.maximum(m_i, tl.max(qk, 1))
qk = qk - m_ij[:, None]
p = tl.math.exp2(qk)
alpha = tl.math.exp2(m_i - m_ij)
l_i = l_i * alpha + tl.sum(p, 1)
acc = acc * alpha[:, None]
v = tl.load(V_block_ptr)
acc = tl.dot(p.to(v.dtype), v, acc)
m_i = m_ij
K_block_ptr = tl.advance(K_block_ptr, (0, BLOCK_N))
V_block_ptr = tl.advance(V_block_ptr, (BLOCK_N, 0))
acc = acc / l_i[:, None]
tl.store(O_block_ptr, acc.to(Out.dtype.element_ty))
class ModelNew(torch.nn.Module):
def __init__(self):
super().__init__()
def forward(self, query, key, value):
# 输入 layout: (B, H, L, D)
# B = batch_size, H = num_heads, L = seq_len, D = head_dim
# 若外部 layout 不同(如 (B,L,H,D)),需先 transpose 再 contiguous
B, H, L, D = query.shape
query, key, value = query.contiguous(), key.contiguous(), value.contiguous()
out = torch.empty_like(query)
sm_scale = 1.0 / math.sqrt(D)
BLOCK_M, BLOCK_N = 64, 64
D_padded = triton.next_power_of_2(D)
grid = (triton.cdiv(L, BLOCK_M), B * H)
_flash_attn_fwd_kernel[grid](
query, key, value, out, sm_scale,
query.stride(0), query.stride(1), query.stride(2), query.stride(3),
key.stride(0), key.stride(1), key.stride(2), key.stride(3),
value.stride(0), value.stride(1), value.stride(2), value.stride(3),
out.stride(0), out.stride(1), out.stride(2), out.stride(3),
L, NUM_HEADS=H, BLOCK_M=BLOCK_M, BLOCK_N=BLOCK_N, D=D_padded,
)
return out
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 8d ago First seen · 209 lines · 59 tokens per session scan A 2afe053579fa
triton-cuda-attention is a skill published in the GitHub repository mindspore-ai/akg (259 stars, last pushed 1mo ago), licensed Apache-2.0. It adds 59 tokens to every session and 2,655 once invoked, about $0.0003 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-09-03.
Other skills, from other repositories
triton-cuda-attention
An implementation guide for attention operations in Triton on CUDA, with a complete Flash Attention example and changes for causal, grouped-query, multi-query, and rotary-position variants.
fs-notebook-tabs
A computer-science capstone: an on-device ML keyboard that predicts next words privately — problem, method, evaluation, and defense answers. Built as a decision-grade coursework defense deck for professor, defense committee.
implementing-llms-litgpt
Implements and trains LLMs using Lightning AI's LitGPT with 20+ pretrained architectures (Llama, Gemma, Phi, Qwen, Mistral). Use when need clean model implementations, educational understanding of architectures, or production fine-tuning with LoRA/QLoRA. Single-file implementations, no abstraction layers.
rwkv-architecture
RNN+Transformer hybrid with O(n) inference. Linear time, infinite context, no KV cache. Train like GPT (parallel), infer like RNN (sequential). Linux Foundation AI project. Production at Windows, Office, NeMo. RWKV-7 (March 2025). Models up to 14B parameters.
nanogpt
Educational GPT implementation in 300 lines. Reproduces GPT-2 (124M) on OpenWebText. Clean, hackable code for learning transformers. By Andrej Karpathy. Perfect for understanding GPT architecture from scratch. Train on Shakespeare (CPU) or OpenWebText (multi-GPU).
kaggle-learner
This skill should be used when the user asks to "learn from Kaggle", "study Kaggle solutions", "analyze Kaggle competitions", or mentions Kaggle competition URLs. Provides access to extracted knowledge from winning Kaggle solutions across NLP, CV, time series, tabular, and multimodal domains.