id
stringlengths
14
14
type
stringclasses
1 value
prompt
dict
response
stringclasses
15 values
meta
dict
fact_sources
listlengths
1
3
artifacts
dict
TRMFACT_032401
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_032402
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_032403
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_032404
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_032405
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: After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_lifecycle", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "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": "verify_true_false", "mode": "tf" }
TRMFACT_032406
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_032407
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_032408
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_032409
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_032410
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_032411
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_032412
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_032413
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_032414
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_032415
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_032416
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_032417
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_032418
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_032419
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_032420
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_032421
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_032422
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_032423
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_032424
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_032425
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_032426
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_032427
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_032428
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_032429
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_032430
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_032431
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_032432
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_032433
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_032434
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_032435
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: After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_lifecycle", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "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": "verify_true_false", "mode": "tf" }
TRMFACT_032436
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_032437
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: After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_lifecycle", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "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": "verify_true_false", "mode": "tf" }
TRMFACT_032438
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_032439
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_032440
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_032441
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_032442
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_032443
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_032444
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_032445
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_032446
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_032447
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_032448
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_032449
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_032450
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_032451
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_032452
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_032453
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_032454
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_032455
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_032456
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_032457
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_032458
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_032459
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: After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_lifecycle", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "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": "verify_true_false", "mode": "tf" }
TRMFACT_032460
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_032461
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_032462
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_032463
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_032464
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_032465
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_032466
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_032467
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_032468
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_032469
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_032470
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: After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_lifecycle", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "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": "verify_true_false", "mode": "tf" }
TRMFACT_032471
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_032472
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_032473
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_032474
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_032475
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_032476
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_032477
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_032478
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_032479
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_032480
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_032481
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_032482
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_032483
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_032484
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_032485
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_032486
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_032487
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_032488
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_032489
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_032490
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_032491
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_032492
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_032493
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_032494
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_032495
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_032496
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_032497
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_032498
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: After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_lifecycle", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "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": "verify_true_false", "mode": "tf" }
TRMFACT_032499
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_032500
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: After the handshake, data transfer occurs; sessions typically end with a connection termination sequence (often described as a four-way closure). (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_lifecycle", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "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": "verify_true_false", "mode": "tf" }