id stringlengths 14 14 | type stringclasses 1 value | prompt dict | response stringclasses 15 values | meta dict | fact_sources listlengths 1 3 | artifacts dict |
|---|---|---|---|---|---|---|
TRMFACT_036901 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: false, null, true (all lowercase). (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "json_literals",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"json_literals"
],
"verification": "primary_spec:RFC8259",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036902 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In a typical TCP session, what comes after the three-way handshake and how does the session typically end (high level)?"
}
]
} | After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_lifecycle",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"tcp_lifecycle"
],
"verification": "vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Microsoft: TCP/IP connectivity issues troubleshooting (session phases)",
"ref": "turn2search17"
},
{
"title": "MDN: TCP handshake glossary (mentions four-way closure)",
"ref": "turn2search11"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036903 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: State the Euclidean algorithm recursion for gcd(a,b) and its base case. A: (answer). Keep it under 15 words."
}
]
} | gcd(a,b)=gcd(b, a mod b); base case gcd(a,0)=|a|. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "euclid_recurrence",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"euclid_recurrence"
],
"verification": "educational + reference",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036904 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: In a typical TCP session, what comes after the three-way handshake and how does the session typically end (high level)? A: (answer). Keep it under 15 words."
}
]
} | After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_lifecycle",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"tcp_lifecycle"
],
"verification": "vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Microsoft: TCP/IP connectivity issues troubleshooting (session phases)",
"ref": "turn2search17"
},
{
"title": "MDN: TCP handshake glossary (mentions four-way closure)",
"ref": "turn2search11"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036905 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: false, null, true (all lowercase). (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "json_literals",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"json_literals"
],
"verification": "primary_spec:RFC8259",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036906 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In TCP, what is the standard three-message handshake to establish a connection? Then give one practical implication in 1 sentence."
}
]
} | SYN → SYN-ACK → ACK. Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_handshake",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"tcp_handshake"
],
"verification": "primary_spec:RFC793 + vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 793 - Transmission Control Protocol",
"ref": "turn2search3"
},
{
"title": "Microsoft: The three-way handshake via TCP/IP",
"ref": "turn2search1"
},
{
"title": "MDN: TCP handshake glossary",
"ref": "turn2search11"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036907 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms? Then give one practical implication in 1 sentence."
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036908 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In TCP, what is the standard three-message handshake to establish a connection?"
}
]
} | SYN → SYN-ACK → ACK. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_handshake",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"tcp_handshake"
],
"verification": "primary_spec:RFC793 + vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 793 - Transmission Control Protocol",
"ref": "turn2search3"
},
{
"title": "Microsoft: The three-way handshake via TCP/IP",
"ref": "turn2search1"
},
{
"title": "MDN: TCP handshake glossary",
"ref": "turn2search11"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036909 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: At least 8 characters. (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036910 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: What does IEEE 754 'round to nearest, ties to even' mean? A: (answer). Keep it under 15 words."
}
]
} | Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036911 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password?"
}
]
} | At least 8 characters. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036912 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password? Then give one practical implication in 1 sentence."
}
]
} | At least 8 characters. Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036913 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: State the Euclidean algorithm recursion for gcd(a,b) and its base case. A: (answer). Keep it under 15 words."
}
]
} | gcd(a,b)=gcd(b, a mod b); base case gcd(a,0)=|a|. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "euclid_recurrence",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"euclid_recurrence"
],
"verification": "educational + reference",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036914 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What does IEEE 754 'round to nearest, ties to even' mean?"
}
]
} | Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036915 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "According to RFC 8259, what are the only three literal names allowed in JSON values? Then give one practical implication in 1 sentence."
}
]
} | false, null, true (all lowercase). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "json_literals",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"json_literals"
],
"verification": "primary_spec:RFC8259",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036916 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: State the Euclidean algorithm recursion for gcd(a,b) and its base case. A: (answer). Keep it under 15 words."
}
]
} | gcd(a,b)=gcd(b, a mod b); base case gcd(a,0)=|a|. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "euclid_recurrence",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"euclid_recurrence"
],
"verification": "educational + reference",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036917 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In a typical TCP session, what comes after the three-way handshake and how does the session typically end (high level)? Then give one practical implication in 1 sentence."
}
]
} | After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_lifecycle",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"tcp_lifecycle"
],
"verification": "vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Microsoft: TCP/IP connectivity issues troubleshooting (session phases)",
"ref": "turn2search17"
},
{
"title": "MDN: TCP handshake glossary (mentions four-way closure)",
"ref": "turn2search11"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036918 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms? A: (answer). Keep it under 15 words."
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036919 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In TCP, what is the standard three-message handshake to establish a connection? Then give one practical implication in 1 sentence."
}
]
} | SYN → SYN-ACK → ACK. Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_handshake",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"tcp_handshake"
],
"verification": "primary_spec:RFC793 + vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 793 - Transmission Control Protocol",
"ref": "turn2search3"
},
{
"title": "Microsoft: The three-way handshake via TCP/IP",
"ref": "turn2search1"
},
{
"title": "MDN: TCP handshake glossary",
"ref": "turn2search11"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036920 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: T(n)=a·T(n/b)+f(n) (with a≥1, b>1). (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036921 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "According to RFC 8259, what are the only three literal names allowed in JSON values?"
}
]
} | false, null, true (all lowercase). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "json_literals",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"json_literals"
],
"verification": "primary_spec:RFC8259",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036922 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: In a typical TCP session, what comes after the three-way handshake and how does the session typically end (high level)? A: (answer). Keep it under 15 words."
}
]
} | After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_lifecycle",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"tcp_lifecycle"
],
"verification": "vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Microsoft: TCP/IP connectivity issues troubleshooting (session phases)",
"ref": "turn2search17"
},
{
"title": "MDN: TCP handshake glossary (mentions four-way closure)",
"ref": "turn2search11"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036923 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms? A: (answer). Keep it under 15 words."
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036924 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "State the Euclidean algorithm recursion for gcd(a,b) and its base case."
}
]
} | gcd(a,b)=gcd(b, a mod b); base case gcd(a,0)=|a|. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "euclid_recurrence",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"euclid_recurrence"
],
"verification": "educational + reference",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036925 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password? Then give one practical implication in 1 sentence."
}
]
} | At least 8 characters. Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036926 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "State the Euclidean algorithm recursion for gcd(a,b) and its base case. Then give one practical implication in 1 sentence."
}
]
} | gcd(a,b)=gcd(b, a mod b); base case gcd(a,0)=|a|. Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "euclid_recurrence",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"euclid_recurrence"
],
"verification": "educational + reference",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036927 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms? Then give one practical implication in 1 sentence."
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036928 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "According to RFC 8259, what are the only three literal names allowed in JSON values?"
}
]
} | false, null, true (all lowercase). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "json_literals",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"json_literals"
],
"verification": "primary_spec:RFC8259",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036929 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms?"
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036930 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms? A: (answer). Keep it under 15 words."
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036931 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What does IEEE 754 'round to nearest, ties to even' mean? Then give one practical implication in 1 sentence."
}
]
} | Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036932 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: gcd(a,b)=gcd(b, a mod b); base case gcd(a,0)=|a|. (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "euclid_recurrence",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"euclid_recurrence"
],
"verification": "educational + reference",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036933 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: T(n)=a·T(n/b)+f(n) (with a≥1, b>1). (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036934 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: SYN → SYN-ACK → ACK. (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_handshake",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"tcp_handshake"
],
"verification": "primary_spec:RFC793 + vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 793 - Transmission Control Protocol",
"ref": "turn2search3"
},
{
"title": "Microsoft: The three-way handshake via TCP/IP",
"ref": "turn2search1"
},
{
"title": "MDN: TCP handshake glossary",
"ref": "turn2search11"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036935 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms? A: (answer). Keep it under 15 words."
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036936 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: What does IEEE 754 'round to nearest, ties to even' mean? A: (answer). Keep it under 15 words."
}
]
} | Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036937 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: At least 8 characters. (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036938 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms?"
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036939 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: At least 8 characters. (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036940 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "According to RFC 8259, what are the only three literal names allowed in JSON values? Then give one practical implication in 1 sentence."
}
]
} | false, null, true (all lowercase). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "json_literals",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"json_literals"
],
"verification": "primary_spec:RFC8259",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036941 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In TCP, what is the standard three-message handshake to establish a connection?"
}
]
} | SYN → SYN-ACK → ACK. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_handshake",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"tcp_handshake"
],
"verification": "primary_spec:RFC793 + vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 793 - Transmission Control Protocol",
"ref": "turn2search3"
},
{
"title": "Microsoft: The three-way handshake via TCP/IP",
"ref": "turn2search1"
},
{
"title": "MDN: TCP handshake glossary",
"ref": "turn2search11"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036942 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In a typical TCP session, what comes after the three-way handshake and how does the session typically end (high level)?"
}
]
} | After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_lifecycle",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"tcp_lifecycle"
],
"verification": "vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Microsoft: TCP/IP connectivity issues troubleshooting (session phases)",
"ref": "turn2search17"
},
{
"title": "MDN: TCP handshake glossary (mentions four-way closure)",
"ref": "turn2search11"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036943 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password? Then give one practical implication in 1 sentence."
}
]
} | At least 8 characters. Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036944 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: false, null, true (all lowercase). (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "json_literals",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"json_literals"
],
"verification": "primary_spec:RFC8259",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036945 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms? Then give one practical implication in 1 sentence."
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036946 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms?"
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036947 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What does IEEE 754 'round to nearest, ties to even' mean?"
}
]
} | Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036948 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: According to RFC 8259, what are the only three literal names allowed in JSON values? A: (answer). Keep it under 15 words."
}
]
} | false, null, true (all lowercase). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "json_literals",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"json_literals"
],
"verification": "primary_spec:RFC8259",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036949 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms? Then give one practical implication in 1 sentence."
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036950 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "State the Euclidean algorithm recursion for gcd(a,b) and its base case. Then give one practical implication in 1 sentence."
}
]
} | gcd(a,b)=gcd(b, a mod b); base case gcd(a,0)=|a|. Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "euclid_recurrence",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"euclid_recurrence"
],
"verification": "educational + reference",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036951 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In a typical TCP session, what comes after the three-way handshake and how does the session typically end (high level)? Then give one practical implication in 1 sentence."
}
]
} | After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_lifecycle",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"tcp_lifecycle"
],
"verification": "vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Microsoft: TCP/IP connectivity issues troubleshooting (session phases)",
"ref": "turn2search17"
},
{
"title": "MDN: TCP handshake glossary (mentions four-way closure)",
"ref": "turn2search11"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036952 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036953 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password? Then give one practical implication in 1 sentence."
}
]
} | At least 8 characters. Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036954 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036955 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What does IEEE 754 'round to nearest, ties to even' mean?"
}
]
} | Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036956 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What does IEEE 754 'round to nearest, ties to even' mean? Then give one practical implication in 1 sentence."
}
]
} | Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036957 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "According to RFC 8259, what are the only three literal names allowed in JSON values?"
}
]
} | false, null, true (all lowercase). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "json_literals",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"json_literals"
],
"verification": "primary_spec:RFC8259",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036958 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password?"
}
]
} | At least 8 characters. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036959 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In TCP, what is the standard three-message handshake to establish a connection? Then give one practical implication in 1 sentence."
}
]
} | SYN → SYN-ACK → ACK. Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_handshake",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"tcp_handshake"
],
"verification": "primary_spec:RFC793 + vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 793 - Transmission Control Protocol",
"ref": "turn2search3"
},
{
"title": "Microsoft: The three-way handshake via TCP/IP",
"ref": "turn2search1"
},
{
"title": "MDN: TCP handshake glossary",
"ref": "turn2search11"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036960 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In a typical TCP session, what comes after the three-way handshake and how does the session typically end (high level)?"
}
]
} | After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_lifecycle",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"tcp_lifecycle"
],
"verification": "vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Microsoft: TCP/IP connectivity issues troubleshooting (session phases)",
"ref": "turn2search17"
},
{
"title": "MDN: TCP handshake glossary (mentions four-way closure)",
"ref": "turn2search11"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036961 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms? A: (answer). Keep it under 15 words."
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036962 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: State the Euclidean algorithm recursion for gcd(a,b) and its base case. A: (answer). Keep it under 15 words."
}
]
} | gcd(a,b)=gcd(b, a mod b); base case gcd(a,0)=|a|. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "euclid_recurrence",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"euclid_recurrence"
],
"verification": "educational + reference",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036963 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036964 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: In TCP, what is the standard three-message handshake to establish a connection? A: (answer). Keep it under 15 words."
}
]
} | SYN → SYN-ACK → ACK. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_handshake",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"tcp_handshake"
],
"verification": "primary_spec:RFC793 + vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 793 - Transmission Control Protocol",
"ref": "turn2search3"
},
{
"title": "Microsoft: The three-way handshake via TCP/IP",
"ref": "turn2search1"
},
{
"title": "MDN: TCP handshake glossary",
"ref": "turn2search11"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036965 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What does IEEE 754 'round to nearest, ties to even' mean? Then give one practical implication in 1 sentence."
}
]
} | Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036966 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password?"
}
]
} | At least 8 characters. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036967 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In a typical TCP session, what comes after the three-way handshake and how does the session typically end (high level)?"
}
]
} | After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_lifecycle",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"tcp_lifecycle"
],
"verification": "vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Microsoft: TCP/IP connectivity issues troubleshooting (session phases)",
"ref": "turn2search17"
},
{
"title": "MDN: TCP handshake glossary (mentions four-way closure)",
"ref": "turn2search11"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036968 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: In TCP, what is the standard three-message handshake to establish a connection? A: (answer). Keep it under 15 words."
}
]
} | SYN → SYN-ACK → ACK. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_handshake",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"tcp_handshake"
],
"verification": "primary_spec:RFC793 + vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 793 - Transmission Control Protocol",
"ref": "turn2search3"
},
{
"title": "Microsoft: The three-way handshake via TCP/IP",
"ref": "turn2search1"
},
{
"title": "MDN: TCP handshake glossary",
"ref": "turn2search11"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036969 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What does IEEE 754 'round to nearest, ties to even' mean? Then give one practical implication in 1 sentence."
}
]
} | Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036970 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What does IEEE 754 'round to nearest, ties to even' mean? Then give one practical implication in 1 sentence."
}
]
} | Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036971 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: At least 8 characters. (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036972 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: At least 8 characters. (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036973 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password? A: (answer). Keep it under 15 words."
}
]
} | At least 8 characters. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036974 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: State the Euclidean algorithm recursion for gcd(a,b) and its base case. A: (answer). Keep it under 15 words."
}
]
} | gcd(a,b)=gcd(b, a mod b); base case gcd(a,0)=|a|. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "euclid_recurrence",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"euclid_recurrence"
],
"verification": "educational + reference",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036975 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In a typical TCP session, what comes after the three-way handshake and how does the session typically end (high level)? Then give one practical implication in 1 sentence."
}
]
} | After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_lifecycle",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"tcp_lifecycle"
],
"verification": "vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Microsoft: TCP/IP connectivity issues troubleshooting (session phases)",
"ref": "turn2search17"
},
{
"title": "MDN: TCP handshake glossary (mentions four-way closure)",
"ref": "turn2search11"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036976 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: T(n)=a·T(n/b)+f(n) (with a≥1, b>1). (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036977 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: State the Euclidean algorithm recursion for gcd(a,b) and its base case. A: (answer). Keep it under 15 words."
}
]
} | gcd(a,b)=gcd(b, a mod b); base case gcd(a,0)=|a|. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "euclid_recurrence",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"euclid_recurrence"
],
"verification": "educational + reference",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036978 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: According to RFC 8259, what are the only three literal names allowed in JSON values? A: (answer). Keep it under 15 words."
}
]
} | false, null, true (all lowercase). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "json_literals",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"json_literals"
],
"verification": "primary_spec:RFC8259",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036979 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms?"
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036980 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: What does IEEE 754 'round to nearest, ties to even' mean? A: (answer). Keep it under 15 words."
}
]
} | Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036981 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password? A: (answer). Keep it under 15 words."
}
]
} | At least 8 characters. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036982 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: At least 8 characters. (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036983 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password?"
}
]
} | At least 8 characters. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036984 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In a typical TCP session, what comes after the three-way handshake and how does the session typically end (high level)?"
}
]
} | After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_lifecycle",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"tcp_lifecycle"
],
"verification": "vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Microsoft: TCP/IP connectivity issues troubleshooting (session phases)",
"ref": "turn2search17"
},
{
"title": "MDN: TCP handshake glossary (mentions four-way closure)",
"ref": "turn2search11"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036985 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: In a typical TCP session, what comes after the three-way handshake and how does the session typically end (high level)? A: (answer). Keep it under 15 words."
}
]
} | After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_lifecycle",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"tcp_lifecycle"
],
"verification": "vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Microsoft: TCP/IP connectivity issues troubleshooting (session phases)",
"ref": "turn2search17"
},
{
"title": "MDN: TCP handshake glossary (mentions four-way closure)",
"ref": "turn2search11"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036986 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: gcd(a,b)=gcd(b, a mod b); base case gcd(a,0)=|a|. (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "euclid_recurrence",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"euclid_recurrence"
],
"verification": "educational + reference",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036987 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password? A: (answer). Keep it under 15 words."
}
]
} | At least 8 characters. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036988 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: At least 8 characters. (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036989 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: gcd(a,b)=gcd(b, a mod b); base case gcd(a,0)=|a|. (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "euclid_recurrence",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"euclid_recurrence"
],
"verification": "educational + reference",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036990 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "According to RFC 8259, what are the only three literal names allowed in JSON values?"
}
]
} | false, null, true (all lowercase). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "json_literals",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"json_literals"
],
"verification": "primary_spec:RFC8259",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036991 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "Q: In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password? A: (answer). Keep it under 15 words."
}
]
} | At least 8 characters. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"micro_refresher",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_036992 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: T(n)=a·T(n/b)+f(n) (with a≥1, b>1). (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036993 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What does IEEE 754 'round to nearest, ties to even' mean? Then give one practical implication in 1 sentence."
}
]
} | Round to the nearest representable value; if exactly halfway, choose the one with an even least-significant digit (ties-to-even). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "ieee_rounding",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"ieee_rounding"
],
"verification": "standard_summary + vendor_doc",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "IEEE 754 overview (rounding rules)",
"ref": "turn0search1"
},
{
"title": "Intel documentation: IEEE 754 default rounding mode (RoundTiesToEven)",
"ref": "turn0search9"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036994 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms? Then give one practical implication in 1 sentence."
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036995 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms?"
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036996 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "What recurrence form does the Master Theorem analyze for divide-and-conquer algorithms?"
}
]
} | T(n)=a·T(n/b)+f(n) (with a≥1, b>1). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "master_form",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"master_form"
],
"verification": "mit_ocw_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "MIT OCW 6.046J Lecture 3: Divide and Conquer (recurrence form)",
"ref": "turn2search10"
},
{
"title": "MIT OCW 6.006 Recitation 3 (Master Theorem mention)",
"ref": "turn2search0"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_036997 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "True/False: At least 8 characters. (Answer True/False only.)"
}
]
} | True | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"verify_true_false",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_036998 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In TCP, what is the standard three-message handshake to establish a connection? Then give one practical implication in 1 sentence."
}
]
} | SYN → SYN-ACK → ACK. Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_handshake",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"tcp_handshake"
],
"verification": "primary_spec:RFC793 + vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "RFC 793 - Transmission Control Protocol",
"ref": "turn2search3"
},
{
"title": "Microsoft: The three-way handshake via TCP/IP",
"ref": "turn2search1"
},
{
"title": "MDN: TCP handshake glossary",
"ref": "turn2search11"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_036999 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In NIST SP 800-63B (memorized secrets), what is the minimum length for a subscriber-chosen password? Then give one practical implication in 1 sentence."
}
]
} | At least 8 characters. Implication: Use this rule to avoid protocol/format/security mistakes in implementations. | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "nist_password_min",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"apply_fact",
"nist_password_min"
],
"verification": "nist_primary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_037000 | trm_realworld_fact_qa | {
"messages": [
{
"role": "system",
"content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct."
},
{
"role": "user",
"content": "In a typical TCP session, what comes after the three-way handshake and how does the session typically end (high level)?"
}
]
} | After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). | {
"developer_brand": "Within Us AI",
"domain": "tiny_recursive_models",
"subdomain": "tcp_lifecycle",
"difficulty": "archon",
"tags": [
"trm",
"tiny-model",
"facts",
"real-world",
"direct_fact",
"tcp_lifecycle"
],
"verification": "vendor_doc + glossary",
"safety": "allowed",
"license": "apache-2.0",
"source": "WithinUsAI/TRM_Genesis_RealWorld_40k",
"format_version": "1.1",
"retrieved_at_utc": "2026-01-03T20:44:40"
} | [
{
"title": "Microsoft: TCP/IP connectivity issues troubleshooting (session phases)",
"ref": "turn2search17"
},
{
"title": "MDN: TCP handshake glossary (mentions four-way closure)",
"ref": "turn2search11"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.