from inline_snapshot import snapshot

from mirascope.llm import (
    AssistantMessage,
    Text,
    Thought,
    UserMessage,
)

sync_snapshot = snapshot(
    {
        "response": {
            "provider_id": "anthropic",
            "model_id": "anthropic/claude-sonnet-4-0",
            "provider_model_name": "claude-sonnet-4-0",
            "params": {"thinking": False},
            "finish_reason": None,
            "usage": {
                "input_tokens": 147,
                "output_tokens": 21,
                "cache_read_tokens": 0,
                "cache_write_tokens": 0,
                "reasoning_tokens": 0,
                "raw": "Usage(cache_creation=CacheCreation(ephemeral_1h_input_tokens=0, ephemeral_5m_input_tokens=0), cache_creation_input_tokens=0, cache_read_input_tokens=0, input_tokens=147, output_tokens=21, server_tool_use=None, service_tier='standard')",
                "total_tokens": 168,
            },
            "messages": [
                UserMessage(
                    content=[
                        Text(
                            text="How many primes below 400 contain 79 as a substring? Answer ONLY with the number, not sharing which primes they are."
                        )
                    ]
                ),
                AssistantMessage(
                    content=[
                        Thought(
                            thought="""\
I need to find all prime numbers less than 400 that contain "79" as a substring.

First, let me think about what numbers could contain "79" as a substring and be less than 400:
- Numbers of the form 79X (where X is a digit): 790, 791, 792, 793, 794, 795, 796, 797, 798, 799
- Numbers of the form X79 (where X is a digit): 179, 279, 379
- The number 79 itself

Since we're looking at numbers below 400, the numbers of the form 79X are all above 400 except... wait, let me be more careful.

Actually, 79X where X is a digit gives us: 790, 791, 792, 793, 794, 795, 796, 797, 798, 799. All of these are above 400, so none qualify.

So I need to consider:
1. The number 79 itself
2. Numbers of the form X79 where X is 1, 2, or 3 (to stay below 400): 179, 279, 379

Let me check if each of these is prime:

1. 79: Let me check if 79 is prime.
   - Is 79 divisible by 2? No (it's odd)
   - Is 79 divisible by 3? 7 + 9 = 16, 16 is not divisible by 3, so no
   - Is 79 divisible by 5? No (doesn't end in 0 or 5)
   - Is 79 divisible by 7? 79 ÷ 7 = 11.28..., so no
   - Is 79 divisible by 11? 79 ÷ 11 = 7.18..., so no
   - Since √79 < 9, I only need to check primes up to 8, so I've checked enough.
   - 79 is prime.

2. 179: I'll systematically test its divisibility by checking small prime numbers.
   - It's odd and not divisible by 2, 3, 5, 7, or 11.
   - After checking up to its square root, I confirm 179 is prime.

3. 279: I quickly determine its primality by divisibility tests.
   - The number is even and divisible by 3.
   - 279 breaks down as 3 × 93, confirming it's not prime.

4. 379: I systematically test divisibility.
   - Odd number, not divisible by common small primes.
   - Checked divisors up to its square root, revealing no factors.
   - 379 appears to be prime.

I explore potential number patterns involving 79. Considering substrings and systematic constraints, only three numbers emerge: 79, 179, 279, and 379. These represent the limited subset of numbers less than 400 containing "79".

Analyzing each candidate reveals interesting prime characteristics. 79 itself is prime. 179 and 379 also prove prime. 279 breaks the pattern, divisible by 3 and 93. \n\

My investigation concludes with a precise finding: three primes exist below 400 featuring "79" as a substring.\
"""
                        ),
                        Text(
                            text="""\
Looking at numbers below 400 that contain "79" as a substring:

The possible numbers are:
- 79
- 179  \n\
- 279
- 379

Checking each for primality:
- 79: prime
- 179: prime
- 279: not prime (divisible by 3)
- 379: prime

3\
"""
                        ),
                    ],
                    provider_id="anthropic",
                    model_id="anthropic/claude-sonnet-4-0",
                    provider_model_name="claude-sonnet-4-0",
                    raw_message={
                        "role": "assistant",
                        "content": [
                            {
                                "signature": " ",
                                "thinking": """\
I need to find all prime numbers less than 400 that contain "79" as a substring.

First, let me think about what numbers could contain "79" as a substring and be less than 400:
- Numbers of the form 79X (where X is a digit): 790, 791, 792, 793, 794, 795, 796, 797, 798, 799
- Numbers of the form X79 (where X is a digit): 179, 279, 379
- The number 79 itself

Since we're looking at numbers below 400, the numbers of the form 79X are all above 400 except... wait, let me be more careful.

Actually, 79X where X is a digit gives us: 790, 791, 792, 793, 794, 795, 796, 797, 798, 799. All of these are above 400, so none qualify.

So I need to consider:
1. The number 79 itself
2. Numbers of the form X79 where X is 1, 2, or 3 (to stay below 400): 179, 279, 379

Let me check if each of these is prime:

1. 79: Let me check if 79 is prime.
   - Is 79 divisible by 2? No (it's odd)
   - Is 79 divisible by 3? 7 + 9 = 16, 16 is not divisible by 3, so no
   - Is 79 divisible by 5? No (doesn't end in 0 or 5)
   - Is 79 divisible by 7? 79 ÷ 7 = 11.28..., so no
   - Is 79 divisible by 11? 79 ÷ 11 = 7.18..., so no
   - Since √79 < 9, I only need to check primes up to 8, so I've checked enough.
   - 79 is prime.

2. 179: I'll systematically test its divisibility by checking small prime numbers.
   - It's odd and not divisible by 2, 3, 5, 7, or 11.
   - After checking up to its square root, I confirm 179 is prime.

3. 279: I quickly determine its primality by divisibility tests.
   - The number is even and divisible by 3.
   - 279 breaks down as 3 × 93, confirming it's not prime.

4. 379: I systematically test divisibility.
   - Odd number, not divisible by common small primes.
   - Checked divisors up to its square root, revealing no factors.
   - 379 appears to be prime.

I explore potential number patterns involving 79. Considering substrings and systematic constraints, only three numbers emerge: 79, 179, 279, and 379. These represent the limited subset of numbers less than 400 containing "79".

Analyzing each candidate reveals interesting prime characteristics. 79 itself is prime. 179 and 379 also prove prime. 279 breaks the pattern, divisible by 3 and 93. \n\

My investigation concludes with a precise finding: three primes exist below 400 featuring "79" as a substring.\
""",
                                "type": "thinking",
                            },
                            {
                                "citations": None,
                                "text": """\
Looking at numbers below 400 that contain "79" as a substring:

The possible numbers are:
- 79
- 179  \n\
- 279
- 379

Checking each for primality:
- 79: prime
- 179: prime
- 279: not prime (divisible by 3)
- 379: prime

3\
""",
                                "type": "text",
                            },
                        ],
                    },
                ),
                UserMessage(
                    content=[
                        Text(
                            text="If you remember what the primes were, then share them, or say 'I don't remember.'"
                        )
                    ]
                ),
                AssistantMessage(
                    content=[
                        Text(text="I remember. The primes were: 79, 179, and 379.")
                    ],
                    provider_id="anthropic",
                    model_id="anthropic/claude-sonnet-4-0",
                    provider_model_name="claude-sonnet-4-0",
                    raw_message={
                        "role": "assistant",
                        "content": [
                            {
                                "citations": None,
                                "text": "I remember. The primes were: 79, 179, and 379.",
                                "type": "text",
                            }
                        ],
                    },
                ),
            ],
            "format": None,
            "tools": [],
        }
    }
)
async_snapshot = snapshot(
    {
        "response": {
            "provider_id": "anthropic",
            "model_id": "anthropic/claude-sonnet-4-0",
            "provider_model_name": "claude-sonnet-4-0",
            "params": {"thinking": False},
            "finish_reason": None,
            "usage": {
                "input_tokens": 68,
                "output_tokens": 8,
                "cache_read_tokens": 0,
                "cache_write_tokens": 0,
                "reasoning_tokens": 0,
                "raw": "Usage(cache_creation=CacheCreation(ephemeral_1h_input_tokens=0, ephemeral_5m_input_tokens=0), cache_creation_input_tokens=0, cache_read_input_tokens=0, input_tokens=68, output_tokens=8, server_tool_use=None, service_tier='standard')",
                "total_tokens": 76,
            },
            "messages": [
                UserMessage(
                    content=[
                        Text(
                            text="How many primes below 400 contain 79 as a substring? Answer ONLY with the number, not sharing which primes they are."
                        )
                    ]
                ),
                AssistantMessage(
                    content=[
                        Thought(
                            thought="""\
I need to find primes below 400 that contain "79" as a substring.

First, let me think about what numbers below 400 could contain "79" as a substring:
- Numbers of the form 79X (where X is a digit): 790, 791, 792, 793, 794, 795, 796, 797, 798, 799
- Numbers of the form X79 (where X is a digit): 179, 279, 379
- Numbers of the form X79Y (where X and Y are digits): but these would be at least 1000, so above 400

Wait, let me be more systematic. Numbers below 400 that contain "79":
- 79 itself
- 179, 279, 379 (3-digit numbers ending in 79)
- 790, 791, 792, 793, 794, 795, 796, 797, 798, 799 (but these are all ≥ 790 > 400, so not relevant)

So the candidates are: 79, 179, 279, 379

Now I need to check which of these are prime:

79: Let me check if 79 is prime.
- Not divisible by 2 (it's odd)
- Not divisible by 3: 7+9=16, not divisible by 3
- Not divisible by 5 (doesn't end in 0 or 5)
- Not divisible by 7: 79 ÷ 7 = 11.28..., so not divisible
- √79 ≈ 8.9, so I only need to check primes up to 8
- Already checked 2, 3, 5, 7
So 79 is prime.

179: Let me check if 179 is prime.
- Not divisible by 2 (it's odd)


- Not divisible by 3: 1+7+9=17, not divisible by 3
- Not divisible by 5 (doesn't end in 0 or 5)
- Not divisible by 7: 179 ÷ 7 = 25.57..., so not divisible
- Not divisible by 11: 179 ÷ 11 = 16.27..., so not divisible
- Not divisible by 13: 179 ÷ 13 = 13.77..., so not divisible
- √179 ≈ 13.4, so I need to continue checking primes up to this square root
- After verifying no divisors, I confirm 179 is indeed prime

I'll systematically test 279's divisibility. It fails the primality test quickly - divisible by 3, with 2+7+9=18 confirming this. Dividing by 3 yields 93, proving 279 is composite.

For 379, I'll methodically check divisibility. It passes initial tests: odd number, not divisible by 3, 5, 7, 11, or 13. I'll continue checking divisibility by the next prime, 17.

Continuing my prime check, I verify 379 is not divisible by 17 or 19. With √379 around 19.5, I've exhausted potential divisors up to 19. Therefore, 379 qualifies as prime.

My final count reveals 3 primes containing "79": 79, 179, and 379.\
"""
                        ),
                        Text(text="3"),
                    ],
                    provider_id="anthropic",
                    model_id="anthropic/claude-sonnet-4-0",
                    provider_model_name="claude-sonnet-4-0",
                    raw_message={
                        "role": "assistant",
                        "content": [
                            {
                                "signature": "Et0TCkYIChgCKkC5KBErEC2svY6o+hA/NRzQA2D+xntFx1NRsAyVgM9HPSlQEyhjAXNkhYJ6rR0WpupgOShljFFOshcgi1A30TlLEgwqCXohh0SYxbaLabgaDANcLzHu40g2LOZwjiIwhLxteiRRDJt+dMoeZfNmBvOTnbOmhDT6bX3YPPcpCMsFSlndIc0dkBeFm/sudkGcKsQSc0kLbiKXPl0ziPfQiHCIA8k39SC0CqPZJQlglEZVJ/qhqclKgp9XUwsBlPxXY0kYkYzjckC0j6mQNqUcl5mBVrw/nIhTpK5z6K6U5bzLfeYqgCRWdp5QMdThRwcS3kDNy0GDZYy4ouFTFIM1NHV9fKT5oc5ULHe9GffwMY17FIqEHwMObJVTByz1Of0xbNFDSX++iHqWPl2LHj415uwVVE4Zr8qY5Hsy4hVLTq/4EnwCsT8yAeL48IeNGKXkM7keXfG5ZC8fcQZaPou24knpvtBECt9IJY+vAW7gowMnydO1q622BJjb9xplFnebA4Ie/STRLkBrzVGyfAiASh+Ks4sIn0kKk1fmFkkCsh439hgX6w26eZqKbiGuBir0TTVCY+zFDcjYw4CBIIPOVI4WvOKUcTh/iSn5g3GhKe1voQ89u3H/txfTztlT6r1V5ejInI9wLDyMmEzqKJfFMF1u6auLNAKxp4VgrFUAWeJT1RmPRJmJKxRzGPZ6QFJDi4hguit/IY5iRmhwzyf7Qx6+4bREIkiAhEUowVhxTlVYTI8i0W4hJdG5lUq1ae3/zsal0hqWuNJ5Vr6/0636oOYvnH/fLL8etLINZbKxovKeThgXFjqPkeQKsL64HMpMydlS5eMclcyj0hJfom2WxjGtGf/Wx5NL3Ho2QifhycaWUi/S3FOv/3RW2SEfO8bL6UhfQptVQO4Tp+R9BHoOixGDUADH2t7vmJ1IhMqha0L3i4CpgsNuLDm2gaKB/FltXciZyu1UOIRu+iXCclyW2nZBZVz1ukjsJPcGrTOwTyfUjhX8HcO0fbbw5SiyOdTHSR8hbaPrZveBaKiEZqA6UrPWvo/fsdPO4LzKYuhkDMy3ldPjH3kwb/pMQrmg3TN8kHGJJPd1YpkU30VCet6Yw5483HGaXqZdUkvT6wLlLT5GyyURLBI0r78p/PUdOzgxt5fPCC8B9ArBc6neI9NwifPt53NcEZmD7CuGy2mGqMwd7KMUZRW9x/o/L0D9aGbZ6lvoNnEq27JbFv0CnNPgHtJmmuXnzmofLISyyEdH3Ah6qzcJAgzYX9HhPeCaUL/TMevnLu1ku6bydlFNRkBFTySOXM1qUShkDkJLL+wtOa44c80uQKwzfcC326QUWj8030ae+T0T58em86ZflWuEExTnYKKCRhL8LEBF3vbDRCjkz4e/4GLOl0pl8Fp6MfbQUVxjFa9pwoDs7uLURXA8FYtFoiyAYLCONxNzJEO0v8rhWRR5UE+d6iG9CADRxZOHXaHre+V7LLueT5xXy1LHJdMmgos+4S4t+7PplsNmqdsnMw6Os1cIUY29bs8EUuGeAeL9d1PVDRb14lsvB5GuzzKnxfPKndJMHgJwEKz2QUCzdoIV3jAJFAHvxeMXv+tZBVjXR7fZvvKQJDzIR8wI8cgUvlrb1je3tGq6StzarvUTz7V/ylVU9MEa505xvBKJJ2zpqUBxblJ1X+fXTBMvY1JI5bmVuhAI2ASTo2jwYuTcz4JxtgQp+JWwIirhu/0wfV42joGUi6BJvOa+mkOSBzEE6rELjVj35EFAl1Tsw35pFAFgh7Bawz/OXqtpdKaCnhzMZPmKHo0XR0cnt/IutI8LyLUJ5EAbDHPtwK0Mz9+TOOgxO/YzFdjdtukmDX4HGCOR4eLI9tWDETELTM0KpQLtG+s149mR6dc7GkdWjRUK0E4YfIUldZhfPlI7cLQW295W39sJkCJ5VUDGzU17kZLc6bswXLZnm0FbrWYfC9zAgb78kT1ZyeY2S99UlUzVtDpxRZubi5vKmrv9pFKAndS2Ae5cVKvZWBqf0+sYxSY/mvIYrWYFC63ZtKR5HrDM/MZmzhzXW1gYOyUUfmQP+Nk8RERQhkOA4XaV79L2kj52JCIVLrjAYyle8DCHRMDuX1EzgMn29bzity01DMr7jgJZcCg8KV8mxm+WkcxGS8XEWViJ9ILGC1R1FqwMYuBfcjBg8Au9WZSTG+E8d4ioYmqpNrUq3ZA1rfiLeW/f8N3VpVA4Noo8GAWaTnparZVI6AeWd8d/drXYkMD0UY4RNy9HKwHeTSeMCWXtYONvjoyBAi+1pINPIPootxq6bSKB02tgA0SmGMJX/4iEPYbJqn7sIydaqXuvOaAM1NY/AECEwCHuJbNyEGrD6iav0d4rx2sX47/VWQIHzSftIiWE31NWGbHtc8a4P1wO/6XqLR8WB0GAsuFjZlwG9FsWLtoQHABlkcxmp2u/8eiqDsvIq/bpXr8gVpiORTojb+diJ6YLYz6jaAKK4T4qnI5TknzTRVyEBrHaPwomGEqQ0aiiiVjiqIKt8MLwG8LuHB5bbxesD9duh3//pdPJGwJfSEP/CwUJKfDQSm5qpOPoVldBudR77eDHIiE9Q4XXZndrHX6v+drnDMDRafwA0jtnkHQB6UgSwIP1qC2Sh9cXrp+Fl7iPprAWEWNH5lvk2mSk36AOcCUbxjmXhvEaYvPqMfx5vTTXp3E/c4pOv6Z++cSpIWxhkKraYHGRaD6jfSIKHq+wHJtIoY7dygTiG/oowjuX9+pdVoMyhc8UQ5cAqX0ItygCKazm2FKEtfj+SoDfnhTCVASO36Q0YsVC54r8Q8vpKjKo0D1vVzL+jUotgB4lqFNKrZjrPItr/ExP/BXQxOZSVPOtMO9RaXMr7VnG1nwTh1MnS4jwgn6CDGNGGLd43AXOwEx9shsXMZ6gRlK3CXEN8+QxhIb3+cGijopjSOCwf/jkjvEQt7VaDjUm1/uFYrmEG9ICKCNpM/HUxwI9TBMLd3CPpR9YyTWrpyPQ8/61i9PB57EttXM2jFw6o4e3AMp72bun9xRd46uJSQfl69U/m3zzIufUrkhcm4tXs1fDqkv9hGYSTZgo8xWn81nFfCiKUTY+7sv7+xOEhSdNG3gJXRpgFQerZrZhVM6pzpUxwOnSmctmvR0WteG60/SQujyIuHUOYKxY0FAm2ZTVWt39GTARk4I5eFGicLBxovbANaWy+T1Lp3KH4i5ya95tDokRTbUHMMjhlJv92gq5R5D9f9b8NbWVCaJlL0fkXbxl3B/WoOCfFgr5Tf8ScHTDKln98JbEOkMgY3MS2mAROsv08YeVn6G/j8Vfy9e+twV/nPQu1EN5AspC4JyaZZFdto8NS64pxekYAQ==",
                                "thinking": """\
I need to find primes below 400 that contain "79" as a substring.

First, let me think about what numbers below 400 could contain "79" as a substring:
- Numbers of the form 79X (where X is a digit): 790, 791, 792, 793, 794, 795, 796, 797, 798, 799
- Numbers of the form X79 (where X is a digit): 179, 279, 379
- Numbers of the form X79Y (where X and Y are digits): but these would be at least 1000, so above 400

Wait, let me be more systematic. Numbers below 400 that contain "79":
- 79 itself
- 179, 279, 379 (3-digit numbers ending in 79)
- 790, 791, 792, 793, 794, 795, 796, 797, 798, 799 (but these are all ≥ 790 > 400, so not relevant)

So the candidates are: 79, 179, 279, 379

Now I need to check which of these are prime:

79: Let me check if 79 is prime.
- Not divisible by 2 (it's odd)
- Not divisible by 3: 7+9=16, not divisible by 3
- Not divisible by 5 (doesn't end in 0 or 5)
- Not divisible by 7: 79 ÷ 7 = 11.28..., so not divisible
- √79 ≈ 8.9, so I only need to check primes up to 8
- Already checked 2, 3, 5, 7
So 79 is prime.

179: Let me check if 179 is prime.
- Not divisible by 2 (it's odd)


- Not divisible by 3: 1+7+9=17, not divisible by 3
- Not divisible by 5 (doesn't end in 0 or 5)
- Not divisible by 7: 179 ÷ 7 = 25.57..., so not divisible
- Not divisible by 11: 179 ÷ 11 = 16.27..., so not divisible
- Not divisible by 13: 179 ÷ 13 = 13.77..., so not divisible
- √179 ≈ 13.4, so I need to continue checking primes up to this square root
- After verifying no divisors, I confirm 179 is indeed prime

I'll systematically test 279's divisibility. It fails the primality test quickly - divisible by 3, with 2+7+9=18 confirming this. Dividing by 3 yields 93, proving 279 is composite.

For 379, I'll methodically check divisibility. It passes initial tests: odd number, not divisible by 3, 5, 7, 11, or 13. I'll continue checking divisibility by the next prime, 17.

Continuing my prime check, I verify 379 is not divisible by 17 or 19. With √379 around 19.5, I've exhausted potential divisors up to 19. Therefore, 379 qualifies as prime.

My final count reveals 3 primes containing "79": 79, 179, and 379.\
""",
                                "type": "thinking",
                            },
                            {"citations": None, "text": "3", "type": "text"},
                        ],
                    },
                ),
                UserMessage(
                    content=[
                        Text(
                            text="If you remember what the primes were, then share them, or say 'I don't remember.'"
                        )
                    ]
                ),
                AssistantMessage(
                    content=[Text(text="I don't remember.")],
                    provider_id="anthropic",
                    model_id="anthropic/claude-sonnet-4-0",
                    provider_model_name="claude-sonnet-4-0",
                    raw_message={
                        "role": "assistant",
                        "content": [
                            {
                                "citations": None,
                                "text": "I don't remember.",
                                "type": "text",
                            }
                        ],
                    },
                ),
            ],
            "format": None,
            "tools": [],
        }
    }
)
stream_snapshot = snapshot(
    {
        "response": {
            "provider_id": "anthropic",
            "provider_model_name": "claude-sonnet-4-0",
            "model_id": "anthropic/claude-sonnet-4-0",
            "finish_reason": None,
            "messages": [
                UserMessage(
                    content=[
                        Text(
                            text="How many primes below 400 contain 79 as a substring? Answer ONLY with the number, not sharing which primes they are."
                        )
                    ]
                ),
                AssistantMessage(
                    content=[
                        Thought(
                            thought="""\
I need to find all primes below 400 that contain "79" as a substring.

First, let me think about what numbers below 400 contain "79" as a substring:
- Numbers starting with 79: 790, 791, 792, ... (these are all ≥ 400, so not relevant)
- Numbers ending with 79: 79, 179, 279, 379
- Numbers with 79 in the middle: This would be numbers like X79Y where X and Y are digits, but for numbers below 400, this would mean 1790, 2790, 3790, etc., which are all ≥ 400, so not relevant.

So the candidates are: 79, 179, 279, 379

Now I need to check which of these are prime:

79: Let me check if 79 is prime.
- Is 79 divisible by 2? No (it's odd)
- Is 79 divisible by 3? 7+9=16, 16 is not divisible by 3, so no
- Is 79 divisible by 5? No (doesn't end in 0 or 5)
- Is 79 divisible by 7? 79 ÷ 7 = 11.28..., so no
- Is 79 divisible by 11? 79 ÷ 11 = 7.18..., so no
- Since √79 ≈ 8.9, I only need to check up to 8
- Is 79 divisible by 8? No (79 is odd)
So 79 is prime.

179: Let me check if 179 is prime.
- Is 179 divisible by 2? No (it's odd)
- Is 179 divisible by 3? 1+7+9=17, 17 is not divisible by 3, so no


- Is 179 divisible by 5? No (doesn't end in 0 or 5)
- Is 179 divisible by 7? 179 ÷ 7 = 25.57..., so no
- Is 179 divisible by 11? 179 ÷ 11 = 16.27..., so no
- Is 179 divisible by 13? 179 ÷ 13 = 13.77..., so no
- Since √179 ≈ 13.4, I need to check up to 13
So 179 is prime.

279: I'll systematically test 279's divisibility to determine its primality. I'll check divisors up to its square root, looking for any number that divides evenly.
- Checking 2: Odd number, so not divisible
- Checking 3: Digit sum (2+7+9=18) is divisible by 3, indicating 279 is divisible
- 279 ÷ 3 = 93 confirms it's composite
279 is not a prime number, as it can be factored into 3 × 93.

379: I'll methodically examine 379's potential divisors.
- Even numbers won't divide it
- 3 doesn't divide it (digit sum 19 isn't divisible by 3)
- Not divisible by 5
- Checked divisors 7, 11, 13, 17, 19 - none divide evenly
- √379 ≈ 19.5, so I've checked all potential divisors
379 is prime.

Therefore, the primes below 400 that contain "79" as a substring are 79, 179, and 379 - a total of 3 primes.\
"""
                        ),
                        Text(text="3"),
                    ],
                    provider_id="anthropic",
                    model_id="anthropic/claude-sonnet-4-0",
                    provider_model_name="claude-sonnet-4-0",
                    raw_message={
                        "role": "assistant",
                        "content": [
                            {
                                "type": "thinking",
                                "thinking": """\
I need to find all primes below 400 that contain "79" as a substring.

First, let me think about what numbers below 400 contain "79" as a substring:
- Numbers starting with 79: 790, 791, 792, ... (these are all ≥ 400, so not relevant)
- Numbers ending with 79: 79, 179, 279, 379
- Numbers with 79 in the middle: This would be numbers like X79Y where X and Y are digits, but for numbers below 400, this would mean 1790, 2790, 3790, etc., which are all ≥ 400, so not relevant.

So the candidates are: 79, 179, 279, 379

Now I need to check which of these are prime:

79: Let me check if 79 is prime.
- Is 79 divisible by 2? No (it's odd)
- Is 79 divisible by 3? 7+9=16, 16 is not divisible by 3, so no
- Is 79 divisible by 5? No (doesn't end in 0 or 5)
- Is 79 divisible by 7? 79 ÷ 7 = 11.28..., so no
- Is 79 divisible by 11? 79 ÷ 11 = 7.18..., so no
- Since √79 ≈ 8.9, I only need to check up to 8
- Is 79 divisible by 8? No (79 is odd)
So 79 is prime.

179: Let me check if 179 is prime.
- Is 179 divisible by 2? No (it's odd)
- Is 179 divisible by 3? 1+7+9=17, 17 is not divisible by 3, so no


- Is 179 divisible by 5? No (doesn't end in 0 or 5)
- Is 179 divisible by 7? 179 ÷ 7 = 25.57..., so no
- Is 179 divisible by 11? 179 ÷ 11 = 16.27..., so no
- Is 179 divisible by 13? 179 ÷ 13 = 13.77..., so no
- Since √179 ≈ 13.4, I need to check up to 13
So 179 is prime.

279: I'll systematically test 279's divisibility to determine its primality. I'll check divisors up to its square root, looking for any number that divides evenly.
- Checking 2: Odd number, so not divisible
- Checking 3: Digit sum (2+7+9=18) is divisible by 3, indicating 279 is divisible
- 279 ÷ 3 = 93 confirms it's composite
279 is not a prime number, as it can be factored into 3 × 93.

379: I'll methodically examine 379's potential divisors.
- Even numbers won't divide it
- 3 doesn't divide it (digit sum 19 isn't divisible by 3)
- Not divisible by 5
- Checked divisors 7, 11, 13, 17, 19 - none divide evenly
- √379 ≈ 19.5, so I've checked all potential divisors
379 is prime.

Therefore, the primes below 400 that contain "79" as a substring are 79, 179, and 379 - a total of 3 primes.\
""",
                                "signature": "EsISCkYIChgCKkD983dAI1mc7bRDvpfdGau2Q60j2iMtaCtHBIB6j9J0AV29pjKN84fcCdFyNCqT+Z2X6JdwLDlJUANGJBnqqCIUEgy1nvQsrW32wbapiLUaDI7aFMbuNzuLfj2/4yIwk5hfvQGpdanbCH/SvqXfM16huQlna9MBBD/1ZL5SFOYXaLsn8bnpNNyW+31JpN9mKqkRzOtFh1GpNlA5OuFwoea6aqIHRnRs1mCkcDCiEcgx6aFybd8GUmNbYwULSqvH1jcNNTNWfkJlzasMwoK6Qz89/iL7xqRtUJvLbd6oYpM6pW8Zi7AExDhqf+5NLMhjgrRHAdKn42Zmj8Fp/d2iWl7gIZOYWXGSst4qO40dZ6OWctmwtA4TqnDINxuLJ2VEacML3IyBxm1nEtq1tQjp1hLjoIcDQuhuNhwcUYVC0lTj69qHkcuyuKA2NYFF0O53W6cpNfNhsMUC4zmwNSZ0uofeb1yFaEMyhVBpWYnxOdIEQvl1KJYKgusfGVCjezShuEdv84rWMqja1DAEbcs+OOtLgRMarM8Zpu/n7gvQaH5oNPoOqly224JU6E8auS2Vp49cjsHcev6BeYARy5rWx3Sk591T5Yk1bTBhDsGC4mJ0x76o25J5l3RKi/y1ZtIEo3h0F2JCXnwDXrvVy5Mljqt8tb5XJAZuEjj9r9bKNa2PtZlE8Yc7XfGdoFxS3pMqkgJvEQNSLmbUAQYVeStysqjV6usNS+PqHzx5DpufbdM4yRLQZdSun3VE8qcsm1nyUn7OAPVp8o/8CgMeGrMUuuHdC3BypWMN4cI8kConiUrmozJoBrFQnsjq2nIufJXAQTNoUCq1w9XNziAmKtVlB4eu1IWYLHE4/6fgMRhKLFZmUdVA+voGfVory99OQDhGPS4t46YPnyrNsbMtbqn0BLWM9kplvHBifJqm12L/wYmmR+X6IB+FoYoc93wygz/9bxjfWwRMZjDjhj/9C++NrGVaxNYlTdkUsI6ecFGTWCo1fXG/qngfGMYJEHcSeNe7XVgpF82WAhM38VXQsdEPjD6dGB+7pkBNA6mvqu0YB4guXiydUKLb+LSnuDm3BwEbbQotcKuY0obQrLLeZZGnTtyljKAFgHsWy+oZQwWdopjcjfTErR/Va394Lm8o+ms7cpslAvomZuQpGeJvjLKCs72Gx46MW7pat7wLXP8ADaDByt8OXwNoS7HIsA1LV7wyFC0yJWYb1Ovl7dAq1r15wjPTpuqZfS+jAOyQNg6YUuroSlGVOhUvnbsK52XXONaGhfPtmUsn/pzsJXpwcTPc3251YdeSNtllLh3IMsVb9dlL9dUBbT2T4hBwWI/PzCKgVOIEUm29/0xnsV0sMJ61tybNXei0SQ7OrUNzaOHbD3FMEtWI6jndFjvw7L0ebbDlQs1+OkKzXDRQTasF0jJCaXlWzb+rbYpTxXDMR3NxErIMzCI8Hero44q8a4442QxDJg139K6aU49J0nl2XYWz2rX9tf7Y7chLxKu7zSmAMl52MWM7ijQhERX/6ogWI0sVql6QhS1zW6ss4nKTTQPVTdiGWemQ+hUZXn/Wtg+ykSzvm1QH9SgZYp0Uw928Pvp8K0893trSHQns2Gg0CSDcvTSSABLYtfVnPCADK69e8SWkiXekOqRwsNr8ufHP3GeVq6PD4V40MpE+jWIvE2Z65yS8xSkB7gQmz1fydLWUmCAJAYRpzr0MBUl3DVKiWFYvTA+zFzBTm42qVsqv6oAHcGBm5aLQM+B8CfIbEN0XXWprLlMOcfF7IT7tLC17DyumuHJfo7D0PbmhmYOmGI0bJgzpFJL/Okadnd0cV9tdQeB8b2OcEVqkl9r6ybsCAESeWnk3Xbqw2Wy7XVRS8nS82tTZUbjqGazs5jQ6kcYQw0MpV5yEqhBHbKMY0zhsDeR50BHadMuPWp9aWF+iZTwY2Pw14dyv8oscyzdGeU4ZrO/IE6Y+B/6/Eg5Ydeemer4wf88+1wmPmxmViWUDHIPY+HcwlLZu+xCej6MZ7tcUpwG77/pJfws0DXyx8ZsotSRrI9cMxd4LXk7VeW64sZwhc5GBah785tGF+o0+NMl3IbYmQfGiQl1CRsjYkGYsy+UeIQoSTEdacKYourC5BfdcL4qHjfF1YuF4qx6pIA0eiOZWEIyxPCaqZOSuiCiS9sf6nmK2vusd6FEKPEpcmqMANeXiCUI72C9RjcTkB4jIF3TR6NpDlz9jZlkXYtNTQcYtY9o7BftYRO3AIQixHQuSgwhxeTPpbuovIbbGh9p1LqCQDffKVNwVxNsHTvDJPvmYrgIDilR4WMSQuGh23N4AaJFN4ISdrLKCrIlwveV2Wk/cjINqWU6d31/rieM8kFxEy5isOgzLXNRDPFe2C14GlPb/zp2eqr2KqyzKDWIsJSgVWUi/JIHEkCyvB1/n7Z6uyvPLWJV93+OHkwiES1HQ5o+GYQZAfUARAKmSf6ofJGMAzeJXsJLa0xkmt5/RP2KGx8X9dk7AABYXboqGmaHj1cX4mi0n8SqZY9mVmbMfgNt7XU+3cloOSx5ih2Ak44zGQj/hnqCuFSf2m/3j7ZyEZ5mGdksLNLJh0YHt2aMLjdNcXbjN7GFPyQKtKzEcbh7hj+HcnMQkOhDw+k2V2hLuR20yFrOlKHgVLSzjtzxRSyeOqhUxGfjYkemm7lVs/ONbyL57xRHaYXEUCr7g1IszXWReJ5DcjD5KjOLnlRty2Y656yLXQR9hDlf86bjFvv20jtHCremwPAw5+bKp+ngSoxYWiKTHQSA3GSaxmpn9du3o2h9d7V1KkiJvTIWDQWWJzh9uVGxGa1ClAWT6CTZwlYhouVhEqYuYILofW0lqcsrqft5usGcXlV18S/V2OTli17u/yoNY3i6NQJ7fD9AU12OlY1gznMiDAvrE7wyzzrqy19CgrFsq496AdqVJuSwsaVHd5q/mIjbyyhl5q4Mud4SrKxkdcCG8ZaKV6fnOIcZHRAgJtVzQlDuvCG3O0JnpMh2RkfsOincROc0TL01yzi6t8NZyfhYu9z9kJYixdbYTtmQTVrNLBZxOptleWm00N4MPutTqJjGKVZxAYm6yJjX6EdchyAybeOg224pzWr/18gTl9qquCHE+aYsV8W2DYR+U5zdJiQVyCN7bGAE=",
                            },
                            {"type": "text", "text": "3"},
                        ],
                    },
                ),
                UserMessage(
                    content=[
                        Text(
                            text="If you remember what the primes were, then share them, or say 'I don't remember.'"
                        )
                    ]
                ),
                AssistantMessage(
                    content=[Text(text="I don't remember.")],
                    provider_id="anthropic",
                    model_id="anthropic/claude-sonnet-4-0",
                    provider_model_name="claude-sonnet-4-0",
                    raw_message={
                        "role": "assistant",
                        "content": [
                            {
                                "type": "text",
                                "text": "I don't remember.",
                            }
                        ],
                    },
                ),
            ],
            "format": None,
            "tools": [],
            "usage": {
                "input_tokens": 68,
                "output_tokens": 8,
                "cache_read_tokens": 0,
                "cache_write_tokens": 0,
                "reasoning_tokens": 0,
                "raw": "None",
                "total_tokens": 76,
            },
            "n_chunks": 4,
        }
    }
)
async_stream_snapshot = snapshot(
    {
        "response": {
            "provider_id": "anthropic",
            "provider_model_name": "claude-sonnet-4-0",
            "model_id": "anthropic/claude-sonnet-4-0",
            "finish_reason": None,
            "messages": [
                UserMessage(
                    content=[
                        Text(
                            text="How many primes below 400 contain 79 as a substring? Answer ONLY with the number, not sharing which primes they are."
                        )
                    ]
                ),
                AssistantMessage(
                    content=[
                        Thought(
                            thought="""\
I need to find all prime numbers below 400 that contain "79" as a substring.

First, let me think about what numbers below 400 could contain "79" as a substring:
- Numbers of the form 79X (where X is a digit): 790, 791, 792, 793, 794, 795, 796, 797, 798, 799
- Numbers of the form X79 (where X is a digit): 179, 279, 379
- The number 79 itself

Wait, I need to be more systematic. Let me list all numbers below 400 that contain "79":

Two-digit: 79
Three-digit: 179, 279, 379, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799

But wait, 790-799 are all ≥ 400 except... no, 790 is above 400. Let me recalculate.

Actually, 790 > 400, so none of the 79X numbers work.

So the candidates are:
- 79
- 179  \n\
- 279
- 379

Now I need to check which of these are prime.

79: Let me check if 79 is prime.
79 = ? \n\
√79 ≈ 8.9, so I need to check divisibility by primes up to 8: 2, 3, 5, 7

79 is odd, so not divisible by 2.
7 + 9 = 16, not divisible by 3.
79 doesn't end in 0 or 5, so not divisible by 5.
79 ÷ 7 = 11.28..., so not divisible by 7.

So 79 is prime.

179: Let me check if 179 is prime.
√179 ≈ 13.4, so I need to check divisibility by primes up to 13: 2, 3, 5, 7, 11, 13


179 is odd, so not divisible by 2.
1 + 7 + 9 = 17, not divisible by 3.
179 doesn't end in 0 or 5, so not divisible by 5.
179 ÷ 7 = 25.57..., so not divisible by 7.
179 ÷ 11 = 16.27..., so not divisible by 11.
179 ÷ 13 = 13.77..., so not divisible by 13.

So 179 is prime.

I'll systematically verify 279's primality by checking divisibility of small prime numbers. I'll start by examining its divisibility pattern and sum of digits to quickly eliminate potential factors.

The number fails the divisibility test for 3, as its digit sum is 18, which is divisible by 3. Specifically, 279 ÷ 3 = 93, confirming it's a composite number.

I'll continue investigating 379's primality using a methodical approach of checking divisibility by primes up to its square root.

After carefully testing divisibility by 2, 3, 5, 7, 11, 13, 17, and 19, I find no factors. The digit sum and remainder tests all indicate 379 is prime.

Therefore, the primes below 400 that contain "79" as a substring are: 79, 179, and 379.\
"""
                        ),
                        Text(text="3"),
                    ],
                    provider_id="anthropic",
                    model_id="anthropic/claude-sonnet-4-0",
                    provider_model_name="claude-sonnet-4-0",
                    raw_message={
                        "role": "assistant",
                        "content": [
                            {
                                "type": "thinking",
                                "thinking": """\
I need to find all prime numbers below 400 that contain "79" as a substring.

First, let me think about what numbers below 400 could contain "79" as a substring:
- Numbers of the form 79X (where X is a digit): 790, 791, 792, 793, 794, 795, 796, 797, 798, 799
- Numbers of the form X79 (where X is a digit): 179, 279, 379
- The number 79 itself

Wait, I need to be more systematic. Let me list all numbers below 400 that contain "79":

Two-digit: 79
Three-digit: 179, 279, 379, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799

But wait, 790-799 are all ≥ 400 except... no, 790 is above 400. Let me recalculate.

Actually, 790 > 400, so none of the 79X numbers work.

So the candidates are:
- 79
- 179  \n\
- 279
- 379

Now I need to check which of these are prime.

79: Let me check if 79 is prime.
79 = ? \n\
√79 ≈ 8.9, so I need to check divisibility by primes up to 8: 2, 3, 5, 7

79 is odd, so not divisible by 2.
7 + 9 = 16, not divisible by 3.
79 doesn't end in 0 or 5, so not divisible by 5.
79 ÷ 7 = 11.28..., so not divisible by 7.

So 79 is prime.

179: Let me check if 179 is prime.
√179 ≈ 13.4, so I need to check divisibility by primes up to 13: 2, 3, 5, 7, 11, 13


179 is odd, so not divisible by 2.
1 + 7 + 9 = 17, not divisible by 3.
179 doesn't end in 0 or 5, so not divisible by 5.
179 ÷ 7 = 25.57..., so not divisible by 7.
179 ÷ 11 = 16.27..., so not divisible by 11.
179 ÷ 13 = 13.77..., so not divisible by 13.

So 179 is prime.

I'll systematically verify 279's primality by checking divisibility of small prime numbers. I'll start by examining its divisibility pattern and sum of digits to quickly eliminate potential factors.

The number fails the divisibility test for 3, as its digit sum is 18, which is divisible by 3. Specifically, 279 ÷ 3 = 93, confirming it's a composite number.

I'll continue investigating 379's primality using a methodical approach of checking divisibility by primes up to its square root.

After carefully testing divisibility by 2, 3, 5, 7, 11, 13, 17, and 19, I find no factors. The digit sum and remainder tests all indicate 379 is prime.

Therefore, the primes below 400 that contain "79" as a substring are: 79, 179, and 379.\
""",
                                "signature": "EskSCkYIChgCKkBNvODusEip5p/DGnlkXeUc4zPrnTTCFwSxL8AeYYgdp4wNGhP9s2RC7I5FAgpOBp5VwLoZGnALJVglzkjfcfiMEgy/RP/3yMF/unVudZwaDJn84bQoaPaoJz0Q5SIwJzn7gNC+d2hY9Sz9WaR48LoSOPzFzJXCSXBo6pz7EBV8DhVd/2+/6coasEUEi8ozKrARcGORtI+NFVgcRbZdb/X+Hk7Hhz53RPv2olbyX/+AwQZpx+UspUwuW+mY7pqxgObqBDgEmo4q23I++igg09mtdlMjpIU+7tvQwsnsWEl/TxB4Rh6iAH3+eaEWtEgW/iHoFMbgmoVvXJSSaZPClLUk1rUTdj4PNX9ruH2RtbvyStvB+N7KGGEWg9uX6IiduN5Hm2VZYJFfURLhvEARfUTrYYUhw87JUo2QstmGnZHQUMtz9/bT52V1eTbl/DZdwOD/mTyZZujUKz13SbbH9WK+7rliboFykafavgrMy0WtyF2+4Htfh36FKUz86enZgCMOx2vDx5VABx0e2A7UN8d0cKIt+/di3jPeOZDk8LIAD3K0XQDIthj2jadRAh9BxdWwLoy7uOZnDqFrgnUgKxKMlijdIscKt88N1wWbYyUuJlBEEhPZTkq8YWC4t7WNCqIrUWrX7uBR3Gyi31yLfXde7ePgbzkpYh30LRVBIy22MDPl8wDXtTeCshRSIFqZ71R3cpY8M2j6xMPTHG0ebtempUbXm0s7iIwNbHO0vhuFazz4NRfdzu8DQuk2eNwgmT83FT9u5Pzt0I6D/5Wb9A43m38yRtX0eDnIet4EYnrdbYObPKsz0vkzk8LeUpVu8wgnb1TBXwLJYBTrXryoH3tFBcUQnTk4IXANOWlzeNGmdBAoq8R/+FJiV7TyH9vnXzKoxOO1LF+w6VePP3PO0oupfLyP/k/tXS5r81JfLjPhX3j5670p9zU3pbchnpzgJVNX5Fd0gr+HRg4+10IyMNIeeiYUHlXDGs2NczJUdkfKluAsA/A7k5VPtlNM+o5FNDX4xhAqpIR8whfnCIa0zNTUMCEqql7RUPPnEmqkIgiVIEBGCtU3a8e8EYfoNhmMUd0x/p9ATL+Z3Aa0orMJecciaqk61Sdl2dDYytprLIuyNv5PcDsdiC3oj0vGiMFCxN0h7/YuWUc0/DCv3CbfMry/M6ih9/2ElKmFeiYM/I6LPbwaw735sILLPuUXmoll0bv/z4F4JAvfQ+avPYt+tyr5u1HSU/NDKujqdYjfe520BnUhZRspSepvFAL9HJOU6RuGn9yCJ5TjBNVmy04TbR3UYAiKblAhKN4EX7QdCchdE4Bok8JasQHHHnFoStHI0AMfvY8NXsliAKTUD2vMxsjCKJRjSM78XijBy6Hl+VCW7DmSW8M1yh8vqv/pYlKxyZkD/IIuEnhT9KtCWdTgMkDcBRsqPRyELOsDOLFIgHF74B7NkBlnNyGdJEcIoxH86b0Bv8QkoAGNo4SNgeNYHAlUzfv1byrW09jipSZvoJIzWLQ1I3bQKYqhTmNcEJ+Eft+/pB6Uq708yvHi8yuCQX7yHLpf6cQcEMB2m8mJApzPdpCrAwasvdCloj/qNvETlpmEULx+WbSZeCRv8ruujTrLRpQU8uwPcRa67yToyDB5DWv/cO/qFAxNCZUxl5c6I9iLo8hOvRja+aRN4/OaQlD+bXYQwOHa5lX/nNjjRTM5JomCmO5/uFGl+nP+IFl0B6CttaMGKFn2Ng9gzOQafU74L1pljtRfbaYPcHJQ3TJWBX4ZWtzqkkR8Vrj9yp0rIJv2JZdOVshadT+9kHOyacp0CQReCPwlb9I7M0QJgzdCLDPN06tgkVB+WKaT/TtPDBCZ/SPWPNJs6BDmdBGKsTn628twgLUkXp/9KijRluadsQ1XI2hT8Al8MRtRd5xHGpSuvTqg0Rh6i14mLTPKAB5HrIhRvkFep/JxNK2Wvv6gmYZ2WMjS1uBRH9j7W2Nu7WsfGIYGGQ/LJDrqB0e9/uzBkHSWDDGzudzKYJHvO+WPiCj54aCd6UMr6ttbjg3rB+N8e5fkSX4B+FxBBQ3/EJsaQXnG9d2dTu3L4zFyLvgcBrEc22RGIexBMAIILzbUJIZjK/m66dqEWouAmMFg15ZpxWOF1DC8ooMmFR2cfJ4SBJQdyA3vcaUaivyHIXxgkmNdW0u+b2idkhAUQVhVoWn2uX84505dyUfKZIG4Mn8h6OuYwphBqxkWhUqOQNkWKqIjpO6Dx50weJ0mTWrKInKbEi2qziOXELR5XfpLDpKQDwD+QwN3SsuZyTVZefxDIYq1pmQ/E3DvT3A9dz1C3lrt5W4JQw73Cxy1y1RHDzkgNd0yZu/TPTIH2HGLKDyBf3ShcbJ3FueE4SFX7OQJgqPmNaI9FKT9+UMDzdGFEPGp9vFtxt0AmEXU0mHCSNSRZCvhZQDo+w77QWXaQ+cQVulYAAIvepJBLru0bne5S97/pyA7CH04mCdVfz9OSAd+TLUmnmPp4UON+/wC5StS6WIR3Pi2o7YsLmjWxEYE41SWCI3ES5GY3ohYSrHroRDIV6sUc1s+K2+jXkSZTkLJuwANgWjaB1/FfV3ug788m/naSMSxRm2WPCaCYSLbaSoH3TFSNbAGSFTFRvWfAT48aMcpnNh+P8eJVL2g1IeqF+7iqCfvxAdYAvbG1QBxZv3NiyQgi5wpVI51qlirbo6wABjXm5tlrPod4Rmd7rcA3BcEOG5bDNn5mD2IVZ6DMN3V3WnvcrEFtbDMBNuEO3R+nt9oY1ChUjFELrM2BU1Sh2BJTHLJBUFAzj9m3rQkWcGmfzevLcqQmkXsaAG/HqKXV1PbB8HP3hKNRsJB2kIcoP0UpWRCp7hvJkXSFgR3dd/ZURnkodVMHnAmzpkc4BvNy6587dUynchOpean5VjURTa1YWbRGrmPftzuh+YIrLFfYqpejJ61xkls8SejXpvGXoFAUIAeqiNHg+wKajDTh8xuUKtja1IxbX0iqIDUzsQTNMj+Bq9zrKd8waUTQCIxoXNOyN0E/98oJPkrDe5ViDZzO9I8Ik1Uk50tPk3K3ynpuE/pCixSnXYCW9Tangi5Na4DBXYQluOeFZWKFO1HEHWTRAMPLqYfb9tUKJrqjumTkR8PnEZF3jrOk59o6OvoBplAiRgB",
                            },
                            {"type": "text", "text": "3"},
                        ],
                    },
                ),
                UserMessage(
                    content=[
                        Text(
                            text="If you remember what the primes were, then share them, or say 'I don't remember.'"
                        )
                    ]
                ),
                AssistantMessage(
                    content=[Text(text="I don't remember.")],
                    provider_id="anthropic",
                    model_id="anthropic/claude-sonnet-4-0",
                    provider_model_name="claude-sonnet-4-0",
                    raw_message={
                        "role": "assistant",
                        "content": [{"type": "text", "text": "I don't remember."}],
                    },
                ),
            ],
            "format": None,
            "tools": [],
            "usage": {
                "input_tokens": 68,
                "output_tokens": 8,
                "cache_read_tokens": 0,
                "cache_write_tokens": 0,
                "reasoning_tokens": 0,
                "raw": "None",
                "total_tokens": 76,
            },
            "n_chunks": 4,
        }
    }
)
