IMPORTANT: To view this page as Markdown, append `.md` to the URL (e.g. /get-started.md). For the complete documentation index, see llms.txt.
Skip to main content
For the complete documentation index, see llms.txt. Markdown versions of all pages are available by appending .md to any URL (e.g. /get-started.md).

Mojo function

gated_delta_recurrence_verify_ring_fwd_shape

def gated_delta_recurrence_verify_ring_fwd_shape(qkv_conv_output: T, decay_per_token: T, beta_per_token: T, recurrent_state: T, ring: T, slot_idx: T, ring_slot_idx: T, input_row_offsets: T, verify_width: T) -> IndexList[Int(2)]

Computes the output shape for gated_delta_recurrence_verify_ring_fwd.

The output is [total_seq_len, value_dim]. The ring is written in place.

Args:

  • ​qkv_conv_output (T): Ragged conv output, [total_seq_len, conv_dim].
  • ​decay_per_token (T): Per-token decays, [total_seq_len, nv].
  • ​beta_per_token (T): Per-token beta gates, [total_seq_len, nv].
  • ​recurrent_state (T): Live pool, [max_slots, nv, KD, VD].
  • ​ring (T): Ring pool, [ring_rows, nk, RING_LEN, record_stride].
  • ​slot_idx (T): Live pool row per batch item, [batch_size].
  • ​ring_slot_idx (T): Ring row per batch item, [batch_size].
  • ​input_row_offsets (T): Ragged offsets, [batch_size + 1].
  • ​verify_width (T): [K], read for its shape only.

Returns:

IndexList[Int(2)]

Was this page helpful?