TMBR: April 2026: Difference between revisions
Jump to navigation
Jump to search
RobinCodes (talk | contribs) m →Holdouts: Added dot at end of sentence |
Qwertyasdf (talk | contribs) add new possible cryptid discovery |
||
| Line 13: | Line 13: | ||
** On 1 April 2026, [https://discord.com/channels/960643023006490684/1259770421046411285/1488737894943166604 Discord user mammillaria shared a Lean formalisation of the BMO 3 problem and its solution], which he created using [https://aristotle.harmonic.fun/ Aristotle AI]. Then [https://discord.com/channels/960643023006490684/1259770421046411285/1488898494386274374 mxdys formalised the result] in Rocq using LLMs, reducing the holdout count to 67, with 60 informal holdouts. | ** On 1 April 2026, [https://discord.com/channels/960643023006490684/1259770421046411285/1488737894943166604 Discord user mammillaria shared a Lean formalisation of the BMO 3 problem and its solution], which he created using [https://aristotle.harmonic.fun/ Aristotle AI]. Then [https://discord.com/channels/960643023006490684/1259770421046411285/1488898494386274374 mxdys formalised the result] in Rocq using LLMs, reducing the holdout count to 67, with 60 informal holdouts. | ||
** On 2 April 2026, [https://discord.com/channels/960643023006490684/1259770421046411285/1489095097373954199 mxdys solved] [[Beaver Math Olympiad#Solved problems|BMO 3]] variant {{TM|1RB0RA3LA4LA2RA_2LB3LA---4RA3RB}} using an LLM, reducing the formal holdout count to 66. The proofs for BMO 3 and its variant are available at https://github.com/ccz181078/busycoq/blob/BB6/verify/BMO3.v. | ** On 2 April 2026, [https://discord.com/channels/960643023006490684/1259770421046411285/1489095097373954199 mxdys solved] [[Beaver Math Olympiad#Solved problems|BMO 3]] variant {{TM|1RB0RA3LA4LA2RA_2LB3LA---4RA3RB}} using an LLM, reducing the formal holdout count to 66. The proofs for BMO 3 and its variant are available at https://github.com/ccz181078/busycoq/blob/BB6/verify/BMO3.v. | ||
*[[BB(6)]] | |||
**Discord user sheep discovered a possible cryptid {{TM|1RB1LA_0LC0RC_1LE1RD_1RE1RC_1LF0LA_---1LE}} similar to [[Space Needle]]. | |||
[[Category:This Month in Beaver Research|2026-04]] | [[Category:This Month in Beaver Research|2026-04]] | ||
Revision as of 11:57, 7 April 2026
| Prev: March 2026 | This Month in Beaver Research | Next: May 2026 |
This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).
This Month in Beaver Research for April 2026. TODO: Write proper introductory paragraph. Important: BB(2,5) formalisation result.
Misc
- Katelyn Doucette completed a visualizer for Fractran space-time diagrams.[1]
Holdouts
- BB(2,5):
- On 1 April 2026, Discord user mammillaria shared a Lean formalisation of the BMO 3 problem and its solution, which he created using Aristotle AI. Then mxdys formalised the result in Rocq using LLMs, reducing the holdout count to 67, with 60 informal holdouts.
- On 2 April 2026, mxdys solved BMO 3 variant
1RB0RA3LA4LA2RA_2LB3LA---4RA3RB(bbch) using an LLM, reducing the formal holdout count to 66. The proofs for BMO 3 and its variant are available at https://github.com/ccz181078/busycoq/blob/BB6/verify/BMO3.v.
- BB(6)
- Discord user sheep discovered a possible cryptid
1RB1LA_0LC0RC_1LE1RD_1RE1RC_1LF0LA_---1LE(bbch) similar to Space Needle.
- Discord user sheep discovered a possible cryptid