ThatAIguyA world of ideas

THE CONSCIOUSNESS ATLAS
Read. Experiment. Follow the evidence.

ConsciousnessLearn · Explore · Joseph Anady

DeepSeek MoE.moe_infer: sorted tokens

In DeepseekV3MoE.moe_infer, this statement defines or updates sorted_tokens. The top-k operation selects the largest scores. Ties and group masking affect which experts or entries survive the discrete boundary.

Donor model implementationhistorical source recovered; expression not executed in this website audit
Learn with the Atlas

Learn to read this model

Start with the symbols, follow the operations, and check what the result means.

Open guided lesson
donor-eq-e63e048a164a06source-code mathematical expression
sortedtokens=x[idxs//topkids.shape[1]]sorted_tokens = x[idxs // topk_ids.shape[1]]

Read the equation

In DeepseekV3MoE.moe_infer, this statement defines or updates sorted_tokens. The top-k operation selects the largest scores. Ties and group masking affect which experts or entries survive the discrete boundary.

Terms & definitions

The recovered passage does not supply a separate symbol table. Read the source context for the notation used in this version; familiar letters may carry different meanings in other builds.

How it works

  1. Read sorted_tokens as the quantity being defined or updated by this relation.

  2. Substitute the source-defined variables or recorded values and follow the displayed arithmetic and indexing exactly.

  3. Use this version’s variable definitions and update order. The same symbol may be assigned a different meaning in another build.

Assumptions & limits

Source recovery establishes that the expression appears in this record. Its mathematical validity, implementation behavior, and interpretation must be assessed separately. See the linked source and research notes for the checks available for this version.

Original context

Read the surrounding source passage
cnts.scatter_(1, topk_ids, 1)
        tokens_per_expert = cnts.sum(dim=0)
        idxs = topk_ids.view(-1).argsort()
        sorted_tokens = x[idxs // topk_ids.shape[1]]
        sorted_tokens_shape = sorted_tokens.shape
        if self.ep_size > 1:
            tokens_per_ep_rank = tokens_per_expert.view(self.ep_size,
Exact original notation
sorted_tokens = x[idxs // topk_ids.shape[1]]

Related builds

Sources & provenance

01
kimi source tree.txt
lines 2875–2875 · Aug 5, 2026
sorted_tokens = x[idxs // topk_ids.shape[1]]
02
DEEPSEEK_R1_COMPLETE.txt
lines 2650–2650 · Aug 5, 2026
sorted_tokens = x[idxs // topk_ids.shape[1]]

Search equations, builds, manuscript text, and recovered sources.