id
stringlengths
14
14
type
stringclasses
1 value
prompt
dict
response
stringclasses
15 values
meta
dict
fact_sources
listlengths
1
3
artifacts
dict
TRMFACT_038301
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038302
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038303
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "micro_refresher", "mode": "compress" }
TRMFACT_038304
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:41" }
[ { "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_038305
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:41" }
[ { "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_038306
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:41" }
[ { "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_038307
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:41" }
[ { "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_038308
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038309
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:41" }
[ { "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_038310
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038311
trm_realworld_fact_qa
{ "messages": [ { "role": "system", "content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct." }, { "role": "user", "content": "True/False: SYN → SYN-ACK → ACK. (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_handshake", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "tcp_handshake" ], "verification": "primary_spec:RFC793 + vendor_doc + glossary", "safety": "allowed", "license": "apache-2.0", "source": "WithinUsAI/TRM_Genesis_RealWorld_40k", "format_version": "1.1", "retrieved_at_utc": "2026-01-03T20:44:41" }
[ { "title": "RFC 793 - Transmission Control Protocol", "ref": "turn2search3" }, { "title": "Microsoft: The three-way handshake via TCP/IP", "ref": "turn2search1" }, { "title": "MDN: TCP handshake glossary", "ref": "turn2search11" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038312
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038313
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:41" }
[ { "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_038314
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "micro_refresher", "mode": "compress" }
TRMFACT_038315
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:41" }
[ { "title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format", "ref": "turn0search3" } ]
{ "wrapper": "apply_fact", "mode": "apply" }
TRMFACT_038316
trm_realworld_fact_qa
{ "messages": [ { "role": "system", "content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct." }, { "role": "user", "content": "True/False: SYN → SYN-ACK → ACK. (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_handshake", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "tcp_handshake" ], "verification": "primary_spec:RFC793 + vendor_doc + glossary", "safety": "allowed", "license": "apache-2.0", "source": "WithinUsAI/TRM_Genesis_RealWorld_40k", "format_version": "1.1", "retrieved_at_utc": "2026-01-03T20:44:41" }
[ { "title": "RFC 793 - Transmission Control Protocol", "ref": "turn2search3" }, { "title": "Microsoft: The three-way handshake via TCP/IP", "ref": "turn2search1" }, { "title": "MDN: TCP handshake glossary", "ref": "turn2search11" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038317
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:41" }
[ { "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_038318
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038319
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:41" }
[ { "title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format", "ref": "turn0search3" } ]
{ "wrapper": "apply_fact", "mode": "apply" }
TRMFACT_038320
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:41" }
[ { "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_038321
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:41" }
[ { "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_038322
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:41" }
[ { "title": "Khan Academy: The Euclidean Algorithm", "ref": "turn2search2" }, { "title": "Wikipedia: Euclidean algorithm (implementation section)", "ref": "turn1search3" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038323
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:41" }
[ { "title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format", "ref": "turn0search3" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038324
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:41" }
[ { "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_038325
trm_realworld_fact_qa
{ "messages": [ { "role": "system", "content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct." }, { "role": "user", "content": "True/False: SYN → SYN-ACK → ACK. (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_handshake", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "tcp_handshake" ], "verification": "primary_spec:RFC793 + vendor_doc + glossary", "safety": "allowed", "license": "apache-2.0", "source": "WithinUsAI/TRM_Genesis_RealWorld_40k", "format_version": "1.1", "retrieved_at_utc": "2026-01-03T20:44:41" }
[ { "title": "RFC 793 - Transmission Control Protocol", "ref": "turn2search3" }, { "title": "Microsoft: The three-way handshake via TCP/IP", "ref": "turn2search1" }, { "title": "MDN: TCP handshake glossary", "ref": "turn2search11" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038326
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:41" }
[ { "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_038327
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:41" }
[ { "title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format", "ref": "turn0search3" } ]
{ "wrapper": "apply_fact", "mode": "apply" }
TRMFACT_038328
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:41" }
[ { "title": "Khan Academy: The Euclidean Algorithm", "ref": "turn2search2" }, { "title": "Wikipedia: Euclidean algorithm (implementation section)", "ref": "turn1search3" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038329
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:41" }
[ { "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_038330
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:41" }
[ { "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_038331
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038332
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:41" }
[ { "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_038333
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:41" }
[ { "title": "Khan Academy: The Euclidean Algorithm", "ref": "turn2search2" }, { "title": "Wikipedia: Euclidean algorithm (implementation section)", "ref": "turn1search3" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038334
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:41" }
[ { "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_038335
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:41" }
[ { "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_038336
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038337
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:41" }
[ { "title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format", "ref": "turn0search3" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038338
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:41" }
[ { "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_038339
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:41" }
[ { "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_038340
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:41" }
[ { "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_038341
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:41" }
[ { "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_038342
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038343
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:41" }
[ { "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_038344
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:41" }
[ { "title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format", "ref": "turn0search3" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038345
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:41" }
[ { "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_038346
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:41" }
[ { "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_038347
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:41" }
[ { "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_038348
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:41" }
[ { "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_038349
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:41" }
[ { "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_038350
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:41" }
[ { "title": "Khan Academy: The Euclidean Algorithm", "ref": "turn2search2" }, { "title": "Wikipedia: Euclidean algorithm (implementation section)", "ref": "turn1search3" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038351
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:41" }
[ { "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_038352
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:41" }
[ { "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_038353
trm_realworld_fact_qa
{ "messages": [ { "role": "system", "content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct." }, { "role": "user", "content": "True/False: SYN → SYN-ACK → ACK. (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_handshake", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "tcp_handshake" ], "verification": "primary_spec:RFC793 + vendor_doc + glossary", "safety": "allowed", "license": "apache-2.0", "source": "WithinUsAI/TRM_Genesis_RealWorld_40k", "format_version": "1.1", "retrieved_at_utc": "2026-01-03T20:44:41" }
[ { "title": "RFC 793 - Transmission Control Protocol", "ref": "turn2search3" }, { "title": "Microsoft: The three-way handshake via TCP/IP", "ref": "turn2search1" }, { "title": "MDN: TCP handshake glossary", "ref": "turn2search11" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038354
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:41" }
[ { "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_038355
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:41" }
[ { "title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format", "ref": "turn0search3" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038356
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038357
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038358
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:41" }
[ { "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_038359
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:41" }
[ { "title": "Khan Academy: The Euclidean Algorithm", "ref": "turn2search2" }, { "title": "Wikipedia: Euclidean algorithm (implementation section)", "ref": "turn1search3" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038360
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:41" }
[ { "title": "Khan Academy: The Euclidean Algorithm", "ref": "turn2search2" }, { "title": "Wikipedia: Euclidean algorithm (implementation section)", "ref": "turn1search3" } ]
{ "wrapper": "micro_refresher", "mode": "compress" }
TRMFACT_038361
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:41" }
[ { "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_038362
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "apply_fact", "mode": "apply" }
TRMFACT_038363
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:41" }
[ { "title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format", "ref": "turn0search3" } ]
{ "wrapper": "micro_refresher", "mode": "compress" }
TRMFACT_038364
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:41" }
[ { "title": "Khan Academy: The Euclidean Algorithm", "ref": "turn2search2" }, { "title": "Wikipedia: Euclidean algorithm (implementation section)", "ref": "turn1search3" } ]
{ "wrapper": "apply_fact", "mode": "apply" }
TRMFACT_038365
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:41" }
[ { "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_038366
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:41" }
[ { "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_038367
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:41" }
[ { "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_038368
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:41" }
[ { "title": "Khan Academy: The Euclidean Algorithm", "ref": "turn2search2" }, { "title": "Wikipedia: Euclidean algorithm (implementation section)", "ref": "turn1search3" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038369
trm_realworld_fact_qa
{ "messages": [ { "role": "system", "content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct." }, { "role": "user", "content": "True/False: SYN → SYN-ACK → ACK. (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_handshake", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "tcp_handshake" ], "verification": "primary_spec:RFC793 + vendor_doc + glossary", "safety": "allowed", "license": "apache-2.0", "source": "WithinUsAI/TRM_Genesis_RealWorld_40k", "format_version": "1.1", "retrieved_at_utc": "2026-01-03T20:44:41" }
[ { "title": "RFC 793 - Transmission Control Protocol", "ref": "turn2search3" }, { "title": "Microsoft: The three-way handshake via TCP/IP", "ref": "turn2search1" }, { "title": "MDN: TCP handshake glossary", "ref": "turn2search11" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038370
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:41" }
[ { "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_038371
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:41" }
[ { "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_038372
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:41" }
[ { "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_038373
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "micro_refresher", "mode": "compress" }
TRMFACT_038374
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038375
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:41" }
[ { "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_038376
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:41" }
[ { "title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format", "ref": "turn0search3" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038377
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:41" }
[ { "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_038378
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:41" }
[ { "title": "Khan Academy: The Euclidean Algorithm", "ref": "turn2search2" }, { "title": "Wikipedia: Euclidean algorithm (implementation section)", "ref": "turn1search3" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038379
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038380
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:41" }
[ { "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_038381
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:41" }
[ { "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_038382
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:41" }
[ { "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_038383
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:41" }
[ { "title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format", "ref": "turn0search3" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038384
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:41" }
[ { "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_038385
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:41" }
[ { "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_038386
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:41" }
[ { "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_038387
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:41" }
[ { "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_038388
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038389
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:41" }
[ { "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_038390
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "direct_fact", "mode": "direct" }
TRMFACT_038391
trm_realworld_fact_qa
{ "messages": [ { "role": "system", "content": "You are a Tiny Recursive Model (TRM). Answer with factual Q&A only. Be concise and correct." }, { "role": "user", "content": "True/False: SYN → SYN-ACK → ACK. (Answer True/False only.)" } ] }
True
{ "developer_brand": "Within Us AI", "domain": "tiny_recursive_models", "subdomain": "tcp_handshake", "difficulty": "archon", "tags": [ "trm", "tiny-model", "facts", "real-world", "verify_true_false", "tcp_handshake" ], "verification": "primary_spec:RFC793 + vendor_doc + glossary", "safety": "allowed", "license": "apache-2.0", "source": "WithinUsAI/TRM_Genesis_RealWorld_40k", "format_version": "1.1", "retrieved_at_utc": "2026-01-03T20:44:41" }
[ { "title": "RFC 793 - Transmission Control Protocol", "ref": "turn2search3" }, { "title": "Microsoft: The three-way handshake via TCP/IP", "ref": "turn2search1" }, { "title": "MDN: TCP handshake glossary", "ref": "turn2search11" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038392
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "apply_fact", "mode": "apply" }
TRMFACT_038393
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:41" }
[ { "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_038394
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "apply_fact", "mode": "apply" }
TRMFACT_038395
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:41" }
[ { "title": "NIST SP 800-63B (web)", "ref": "turn0search2" }, { "title": "NIST SP 800-63B PDF", "ref": "turn0search10" } ]
{ "wrapper": "apply_fact", "mode": "apply" }
TRMFACT_038396
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:41" }
[ { "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_038397
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:41" }
[ { "title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format", "ref": "turn0search3" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }
TRMFACT_038398
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:41" }
[ { "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_038399
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:41" }
[ { "title": "Khan Academy: The Euclidean Algorithm", "ref": "turn2search2" }, { "title": "Wikipedia: Euclidean algorithm (implementation section)", "ref": "turn1search3" } ]
{ "wrapper": "apply_fact", "mode": "apply" }
TRMFACT_038400
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:41" }
[ { "title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format", "ref": "turn0search3" } ]
{ "wrapper": "verify_true_false", "mode": "tf" }