id stringlengths 14 14 | type stringclasses 1
value | prompt dict | response stringclasses 15
values | meta dict | fact_sources listlengths 1 3 | artifacts dict |
|---|---|---|---|---|---|---|
TRMFACT_010101 | trm_realworld_fact_qa | {
"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": "allo... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_010102 | trm_realworld_fact_qa | {
"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 (h... | 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",
"li... | [
{
"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_010103 | trm_realworld_fact_qa | {
"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 wor... | 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": "... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010104 | trm_realworld_fact_qa | {
"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",
"sa... | [
{
"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_010105 | trm_realworld_fact_qa | {
"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... | 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... | [
{
"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_010106 | trm_realworld_fact_qa | {
"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",... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010107 | trm_realworld_fact_qa | {
"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",
"licen... | [
{
"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_010108 | trm_realworld_fact_qa | {
"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",... | [
{
"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_010109 | trm_realworld_fact_qa | {
"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",... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010110 | trm_realworld_fact_qa | {
"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",
"licen... | [
{
"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_010111 | trm_realworld_fact_qa | {
"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",... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010112 | trm_realworld_fact_qa | {
"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-... | 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": "... | [
{
"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_010113 | trm_realworld_fact_qa | {
"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 unde... | 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",
... | [
{
"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_010114 | trm_realworld_fact_qa | {
"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": "allo... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_010115 | trm_realworld_fact_qa | {
"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... | 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",
... | [
{
"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_010116 | trm_realworld_fact_qa | {
"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 unde... | 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",
... | [
{
"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_010117 | trm_realworld_fact_qa | {
"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": "allowe... | [
{
"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_010118 | trm_realworld_fact_qa | {
"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",... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010119 | trm_realworld_fact_qa | {
"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 unde... | 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",
... | [
{
"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_010120 | trm_realworld_fact_qa | {
"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... | [
{
"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_010121 | trm_realworld_fact_qa | {
"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 gi... | 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",
"lic... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_010122 | trm_realworld_fact_qa | {
"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 (h... | 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",
"li... | [
{
"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_010123 | trm_realworld_fact_qa | {
"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",
"sa... | [
{
"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_010124 | trm_realworld_fact_qa | {
"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",... | [
{
"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_010125 | trm_realworld_fact_qa | {
"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... | 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",
... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010126 | trm_realworld_fact_qa | {
"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": "... | [
{
"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_010127 | trm_realworld_fact_qa | {
"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 unde... | 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",
... | [
{
"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_010128 | trm_realworld_fact_qa | {
"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 impl... | 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",
"saf... | [
{
"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_010129 | trm_realworld_fact_qa | {
"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 ... | 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": "allow... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_010130 | trm_realworld_fact_qa | {
"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 (h... | 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",
"l... | [
{
"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_010131 | trm_realworld_fact_qa | {
"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 impl... | 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",
"saf... | [
{
"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_010132 | trm_realworld_fact_qa | {
"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":... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010133 | trm_realworld_fact_qa | {
"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 gi... | 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",
"lic... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_010134 | trm_realworld_fact_qa | {
"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... | [
{
"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_010135 | trm_realworld_fact_qa | {
"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 ... | 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"... | [
{
"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_010136 | trm_realworld_fact_qa | {
"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 gi... | 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",
"lic... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_010137 | trm_realworld_fact_qa | {
"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",... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010138 | trm_realworld_fact_qa | {
"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 unde... | 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",
... | [
{
"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_010139 | trm_realworld_fact_qa | {
"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",
"li... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_010140 | trm_realworld_fact_qa | {
"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",... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010141 | trm_realworld_fact_qa | {
"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":... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010142 | trm_realworld_fact_qa | {
"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... | 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",
"lic... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_010143 | trm_realworld_fact_qa | {
"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-... | 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": "... | [
{
"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_010144 | trm_realworld_fact_qa | {
"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",
"li... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_010145 | trm_realworld_fact_qa | {
"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... | 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",
... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010146 | trm_realworld_fact_qa | {
"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... | 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",
... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010147 | trm_realworld_fact_qa | {
"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 (h... | 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",
"li... | [
{
"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_010148 | trm_realworld_fact_qa | {
"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 impl... | 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",
"saf... | [
{
"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_010149 | trm_realworld_fact_qa | {
"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",
"sa... | [
{
"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_010150 | trm_realworld_fact_qa | {
"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",... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010151 | trm_realworld_fact_qa | {
"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": "allo... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_010152 | trm_realworld_fact_qa | {
"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":... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010153 | trm_realworld_fact_qa | {
"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 (h... | 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",
"li... | [
{
"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_010154 | trm_realworld_fact_qa | {
"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 wor... | 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": "... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010155 | trm_realworld_fact_qa | {
"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-... | 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": "... | [
{
"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_010156 | trm_realworld_fact_qa | {
"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 gi... | 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",
"lic... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_010157 | trm_realworld_fact_qa | {
"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",
"li... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_010158 | trm_realworld_fact_qa | {
"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... | 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",
"lic... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_010159 | trm_realworld_fact_qa | {
"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... | 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",
"lic... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
TRMFACT_010160 | trm_realworld_fact_qa | {
"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",... | [
{
"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_010161 | trm_realworld_fact_qa | {
"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": "allo... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_010162 | trm_realworld_fact_qa | {
"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-... | 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": "... | [
{
"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_010163 | trm_realworld_fact_qa | {
"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 practi... | 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": "a... | [
{
"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_010164 | trm_realworld_fact_qa | {
"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-... | 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": "... | [
{
"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_010165 | trm_realworld_fact_qa | {
"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":... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010166 | trm_realworld_fact_qa | {
"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",... | [
{
"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_010167 | trm_realworld_fact_qa | {
"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 wor... | 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": "... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010168 | trm_realworld_fact_qa | {
"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... | [
{
"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_010169 | trm_realworld_fact_qa | {
"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",
"li... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_010170 | trm_realworld_fact_qa | {
"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": "allo... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_010171 | trm_realworld_fact_qa | {
"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":... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010172 | trm_realworld_fact_qa | {
"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... | 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",
... | [
{
"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_010173 | trm_realworld_fact_qa | {
"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 practi... | 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": "a... | [
{
"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_010174 | trm_realworld_fact_qa | {
"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 ... | 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"... | [
{
"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_010175 | trm_realworld_fact_qa | {
"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": "... | [
{
"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_010176 | trm_realworld_fact_qa | {
"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",
"li... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_010177 | trm_realworld_fact_qa | {
"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",... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010178 | trm_realworld_fact_qa | {
"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": "allo... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "direct_fact",
"mode": "direct"
} |
TRMFACT_010179 | trm_realworld_fact_qa | {
"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",... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010180 | trm_realworld_fact_qa | {
"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: (... | 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",
... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010181 | trm_realworld_fact_qa | {
"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": "al... | [
{
"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_010182 | trm_realworld_fact_qa | {
"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: (... | 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",
... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010183 | trm_realworld_fact_qa | {
"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",
"licen... | [
{
"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_010184 | trm_realworld_fact_qa | {
"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 practi... | 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": "a... | [
{
"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_010185 | trm_realworld_fact_qa | {
"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": "allowe... | [
{
"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_010186 | trm_realworld_fact_qa | {
"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":... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010187 | trm_realworld_fact_qa | {
"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... | 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",
... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010188 | trm_realworld_fact_qa | {
"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 wor... | 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": "... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010189 | trm_realworld_fact_qa | {
"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 wor... | 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": "... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010190 | trm_realworld_fact_qa | {
"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 wor... | 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": "... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010191 | trm_realworld_fact_qa | {
"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",... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010192 | trm_realworld_fact_qa | {
"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 wor... | 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": "... | [
{
"title": "Khan Academy: The Euclidean Algorithm",
"ref": "turn2search2"
},
{
"title": "Wikipedia: Euclidean algorithm (implementation section)",
"ref": "turn1search3"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010193 | trm_realworld_fact_qa | {
"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 ... | 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"... | [
{
"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_010194 | trm_realworld_fact_qa | {
"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... | 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... | [
{
"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_010195 | trm_realworld_fact_qa | {
"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 practi... | 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": "a... | [
{
"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_010196 | trm_realworld_fact_qa | {
"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 (h... | 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",
"li... | [
{
"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_010197 | trm_realworld_fact_qa | {
"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",... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "verify_true_false",
"mode": "tf"
} |
TRMFACT_010198 | trm_realworld_fact_qa | {
"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: (... | 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",
... | [
{
"title": "NIST SP 800-63B (web)",
"ref": "turn0search2"
},
{
"title": "NIST SP 800-63B PDF",
"ref": "turn0search10"
}
] | {
"wrapper": "micro_refresher",
"mode": "compress"
} |
TRMFACT_010199 | trm_realworld_fact_qa | {
"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... | [
{
"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_010200 | trm_realworld_fact_qa | {
"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... | 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",
"lic... | [
{
"title": "RFC 8259 - The JavaScript Object Notation (JSON) Data Interchange Format",
"ref": "turn0search3"
}
] | {
"wrapper": "apply_fact",
"mode": "apply"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.