Home › Code › maybe_contiguous

maybe_contiguous

Syntologyentry name in harvested coderead from the graph 2026-09-24

maybe_contiguous appears in the code Syntology harvested for 8 papers, as 3 distinct code bodies found in 8 places (a place is one code body under one paper). At least one of them ran in 5 of the papers; 2 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named maybe_contiguous do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 2 of the 3 distinct code bodies named maybe_contiguous; 1 is unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
0ran · fixture could not drive it
2ran
1unverified
2fingerprinted

Licence is a property of each copy, so it is counted per place: 1 of the 8 places is pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page.

Papers

8 papers shown of 8, newest first; 8 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 2 papers added by Syntology. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
DualKV: Shared-Prompt Flash Attention for Efficient RL Training with Large Rollouts and Long Contexts added by Syntology 2026-05 (from id) amazon-science/dualkv-flash-attn-for-rl/flash-attention/flash_attn/flash_attn_interface.py 19ad2ccd82e378c1 ran fingerprinted licence not identified · pointer only
ELSA: Exact Linear-Scan Attention for Fast and Memory-Light Vision Transformers added by Syntology 2026-04 (from id) Dao-AILab/flash-attention/flash_attn/flash_attn_interface.py 19ad2ccd82e378c1 ran fingerprinted BSD-3-Clause (permissive)
MagiCodec: Simple Masked Gaussian-Injected Codec for High-Fidelity Reconstruction and Generation 31 May 2025 Ereboas/MagiCodec/components/ops/flash_attn_2_3_interface.py 58e6542897e7d424 unverified MIT (permissive)
Forgetting Transformer: Softmax Attention with a Forget Gate 3 Mar 2025 zhixuan-lin/forgetting-transformer/src/forgetting_transformer/ops/forgetting_attention.py 58e6542897e7d424 unverified MIT (permissive)
LongSpec: Long-Context Speculative Decoding with Efficient Drafting and Verification 24 Feb 2025 sail-sg/longspec/longspec/train/models/triton_tree_attn.py 58e6542897e7d424 unverified MIT (permissive)
FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precision 11 Jul 2024 dao-ailab/flash-attention/flash_attn/flash_attn_interface.py 19ad2ccd82e378c1 ran fingerprinted BSD-3-Clause (permissive)
Faster Neighborhood Attention: Reducing the O(n^2) Cost of Self Attention at the Threadblock Level 7 Mar 2024 SHI-Labs/NATTEN/src/natten/_libnatten/torch_wrappers.py d1108c2173a5c0de ran fingerprinted MIT (permissive)
Efficient Memory Management for Large Language Model Serving with PagedAttention 12 Sep 2023 ROCm/flash-attention/flash_attn/flash_attn_interface.py 19ad2ccd82e378c1 ran fingerprinted BSD-3-Clause (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections