Skip to content

feat(together-ai): update model YAMLs [bot]#1686

Open
models-bot[bot] wants to merge 1 commit into
mainfrom
bot/update-together-ai-20260703-020531
Open

feat(together-ai): update model YAMLs [bot]#1686
models-bot[bot] wants to merge 1 commit into
mainfrom
bot/update-together-ai-20260703-020531

Conversation

@models-bot

@models-bot models-bot Bot commented Jul 3, 2026

Copy link
Copy Markdown
Contributor

Auto-generated by poc-agent for provider together-ai.


Note

Low Risk
Provider model metadata only; no runtime or application code changes.

Overview
Updates Together AI catalog entry for zai-org/GLM-5.2 with output token caps and reasoning controls.

Limits: Adds max_output_tokens and max_tokens at 131072 (previously only context_window was set).

Params: Documents reasoning_effort as a string with supported values high and max, default max.

Sources: Replaces the generic models URL with the GLM-5.2 quickstart doc link.

Reviewed by Cursor Bugbot for commit 6c09a30. Bugbot is set up for automated code reviews on this repo. Configure here.

@github-actions

github-actions Bot commented Jul 3, 2026

Copy link
Copy Markdown
Contributor

/test-models

@harshiv-26

Copy link
Copy Markdown
Collaborator

Gateway test results

  • Total: 10
  • Passed: 7
  • Failed: 0
  • Validation failed: 3
  • Errored: 0
  • Skipped: 0
  • Success rate: 70.0%
Provider Model Scenarios
together-ai zai-org/GLM-5.2 success: tool-call, structured-output, json-output, params:stream, structured-output:stream, json-output:stream, params

validation_failure: tool-call:stream, reasoning, reasoning:stream
Failures (3)

together-ai/zai-org/GLM-5.2 — tool-call:stream (validation_failure)

Error
Traceback (most recent call last):
  File "/tmp/tmpqbsacv92/snippet.py", line 49, in <module>
    raise Exception("VALIDATION FAILED: tool-call stream - no tool calls received")
Exception: VALIDATION FAILED: tool-call stream - no tool calls received
Code snippet
from openai import OpenAI

client = OpenAI(api_key="***", base_url="https://internal.devtest.truefoundry.tech/api/llm")

tools = [
    {
        "type": "function",
        "function": {
            "name": "get_weather",
            "description": "Get the current weather for a location.",
            "parameters": {
                "type": "object",
                "properties": {
                    "location": {
                        "type": "string",
                        "description": "The city name, e.g. London",
                    },
                },
                "required": ["location"],
                "additionalProperties": False,
            },
            "strict": True,
        },
    },
]

response = client.chat.completions.create(
    model="test-v2-together-ai/zai-org-GLM-5.2",
    messages=[
        {"role": "user", "content": "Use the get_weather tool to check the weather in London. You must call the tool, do not respond with plain text."},
    ],
    tools=tools,
    tool_choice="auto",
    stream=True,
)
_tool_calls_made = False
for chunk in response:
    if chunk.choices and len(chunk.choices) > 0:
        delta = chunk.choices[0].delta
        if delta.content is not None:
            print(delta.content, end="", flush=True)
        if delta.tool_calls:
            _tool_calls_made = True
            for _tc in delta.tool_calls:
                if _tc.function:
                    print(_tc.function.arguments or "", end="", flush=True)

if not _tool_calls_made:
    raise Exception("VALIDATION FAILED: tool-call stream - no tool calls received")
print("\nVALIDATION: tool-call stream SUCCESS")

together-ai/zai-org/GLM-5.2 — reasoning (validation_failure)

Error
Traceback (most recent call last):
  File "/tmp/tmp_8cr4vu2/snippet.py", line 39, in <module>
    raise Exception("VALIDATION FAILED: reasoning - no reasoning information in response")
Exception: VALIDATION FAILED: reasoning - no reasoning information in response
Code snippet
from openai import OpenAI

client = OpenAI(api_key="***", base_url="https://internal.devtest.truefoundry.tech/api/llm")

response = client.chat.completions.create(
    model="test-v2-together-ai/zai-org-GLM-5.2",
    messages=[
        {"role": "user", "content": "How to calculate 3^3^3^3? Think step by step and show all reasoning."},
    ],
    reasoning_effort="medium",
    stream=False,
)
_usage = getattr(response, "usage", None)
_reasoning_detected = False

_choices = getattr(response, "choices", None)
if _choices and len(_choices) > 0:
    _message = getattr(_choices[0], "message", None)
else:
    _message = None

if _message and getattr(_message, "content", None) is not None:
    print(_message.content)

if _usage is not None:
    _output_token_details = getattr(_usage, "completion_tokens_details", None)
    if _output_token_details and getattr(_output_token_details, "reasoning_tokens", 0) > 0:
        _reasoning_detected = True
    elif getattr(_usage, "reasoning", None) is not None:
        _reasoning_detected = True

if getattr(_message, "reasoning_content", None) is not None:
    _reasoning_detected = True
elif getattr(_message, "reasoning", None) is not None:
    _reasoning_detected = True

if not _reasoning_detected:
    print("Response: ", response)
    raise Exception("VALIDATION FAILED: reasoning - no reasoning information in response")
print("VALIDATION: reasoning SUCCESS")
Output
To calculate the expression **$3^{3^{3^3}}$**, we need to carefully follow the mathematical rules for evaluating exponents. Here is the step-by-step reasoning:

### Step 1: Clarify the Order of Operations
In mathematics, exponentiation is **right-associative**. This means that when you have a stack of exponents (a "power tower"), you evaluate it from the top down (or right to left). 
Therefore, $3^{3^{3^3}}$ is evaluated as:
**$3^{\left(3^{\left(3^3\right)}\right)}$**

*(Note: If we evaluated from the bottom up, it would be $((3^3)^3)^3 = 3^{3 \times 3 \times 3} = 3^{27} = 7,625,597,484,987$, which is a very different and much smaller number.)*

### Step 2: Evaluate the Innermost Exponent ($3^3$)
We start at the very top of the power tower:
$3^3 = 3 \times 3 \times 3 = 27$

Now, we substitute this back into the expression, which becomes:
**$3^{3^{27}}$**

### Step 3: Evaluate the Next Exponent ($3^{27}$)
Next, we need to calculate $3$ raised to the power of $27$. We can do this by breaking it down into manageable chunks, recognizing that $3^{27} = (3^3)^9 = 27^9$.

Let's calculate the powers of $27$:
* $27^1 = 27$
* $27^2 = 27 \times 27 = 729$
* $27^3 = 729 \times 27 = 19,683$
* $27^4 = 19,683 \times 27 = 531,441$
* $27^5 = 531,441 \times 27 = 14,348,907$
* $27^6 = 14,348,907 \times 27 = 387,420,489$
* $27^7 = 387,420,489 \times 27 = 10,460,353,203$
* $27^8 = 10,460,353,203 \times 27 = 282,429,536,481$
* $27^9 = 282,429,536,481 \times 27 = 7,625,597,484,987$

So, $3^{27} = \mathbf{7,625,597,484,987}$ (approximately 7.6 trillion).

### Step 4: Formulate the Final Expression
Substituting this massive number back into our original expression, we get:
**$3^{7,625,597,484,987}$**

### Step 5: Understand the Magnitude of the Final Number
To fully "calculate" this number means writing it out, but that is physically impossible. Let's look at exactly how large this number is by calculating how many digits it has.

The number of digits $D$ in any positive integer $N$ is given by the formula: 
$D = \lfloor \log_{10}(N) \rfloor + 1$

For our number:
$\log_{10}(3^{7,625,597,484,987}) = 7,625,597,484,987 \times \log_{10}(3)$

Using the approximation $\log_{10}(3) \approx 0.47712125472$:
$D \approx 7,625,597,484,987 \times 0.47712125472 \approx \mathbf{3,638,334,640,024}$ **digits**

This number has over **3.6 trillion digits**. To put that into perspective, if you were to print this number out on paper, it would require millions of books. If you tried to save it as a text file on a computer, it would take roughly **3.6 terabytes of storage space** just to hold the digits. 

### Step 6: Extract the First and Last Digits
Because we cannot write out a 3.6-trillion-digit number, the closest we can get to "calculating" it is finding its first and last few digits using modular arithmetic and logarithms.

**The Last Three Digits:**
To find the last three digits, we need to evaluate $3^{7,625,597,484,987} \pmod{1000}$.
Because of Euler's totient theorem, powers of 3 modulo 1000 repeat every 400 powers (i.e., $3^{400} \equiv 1 \pmod{1000}$). 
First, we find the remainder of our giant exponent divided by 400:
$7,625,597,484,987 \pmod{400} = 187$

So, we need to find $3^{187} \pmod{1000}$. Through step-by-step modular exponentiation (squaring and multiplying), it turns out that:
$3^{187} \equiv \mathbf{387} \pmod{1000}$

Therefore, the final number ends in **...387**.

**The First Few Digits:**
To find the leading digits, we use the fractional part of our logarithm from Step 5. 
We found that $\log_{10}(N) \approx 3,638,334,640,024.094$
The fractional part is $0.094$. 
We calculate $10^{0.094} \approx 1.243...$

Therefore, the number begins with **1243...**

### Conclusion
While the exact value of $3^{3^{3^3}}$ is far too large to be written out in the physical universe, we have completely calculated its structure. 

**Final Answer:** 
$3^{3^{3^3}} = 3^{7,625,597,484,987}$, which is a number starting with **1243...**, ending with **...387**, and containing exactly **3,638,334,640,024** decimal digits.
Response:  ChatCompletion(id='oqaXugj-2dTqGa-a152566cfbf81331', choices=[Choice(finish_reason='stop', index=0, logprobs=None, message=ChatCompletionMessage(content='To calculate the expression **$3^{3^{3^3}}$**, we need to carefully follow the mathematical rules for evaluating exponents. Here is the step-by-step reasoning:\n\n### Step 1: Clarify the Order of Operations\nIn mathematics, exponentiation is **right-associative**. This means that when you have a stack of exponents (a "power tower"), you evaluate it from the top down (or right to left). \nTherefore, $3^{3^{3^3}}$ is evaluated as:\n**$3^{\\left(3^{\\left(3^3\\right)}\\right)}$**\n\n*(Note: If we evaluated from the bottom up, it would be $((3^3)^3)^3 = 3^{3 \\times 3 \\times 3} = 3^{27} = 7,625,597,484,987$, which is a very different and much smaller number.)*\n\n### Step 2: Evaluate the Innermost Exponent ($3^3$)\nWe start at the very top of the power tower:\n$3^3 = 3 \\times 3 \\times 3 = 27$\n\nNow, we substitute this back into the expression, which becomes:\n**$3^{3^{27}}$**\n\n### Step 3: Evaluate the Next Exponent ($3^{27}$)\nNext, we need to calculate $3$ raised to the power of $27$. We can do this by breaking it down into manageable chunks, recognizing that $3^{27} = (3^3)^9 = 27^9$.\n\nLet\'s calculate the powers of $27$:\n* $27^1 = 27$\n* $27^2 = 27 \\times 27 = 729$\n* $27^3 = 729 \\times 27 = 19,683$\n* $27^4 = 19,683 \\times 27 = 531,441$\n* $27^5 = 531,441 \\times 27 = 14,348,907$\n* $27^6 = 14,348,907 \\times 27 = 387,420,489$\n* $27^7 = 387,420,489 \\times 27 = 10,460,353,203$\n* $27^8 = 10,460,353,203 \\times 27 = 282,429,536,481$\n* $27^9 = 282,429,536,481 \\times 27 = 7,625,597,484,987$\n\nSo, $3^{27} = \\mathbf{7,625,597,484,987}$ (approximately 7.6 trillion).\n\n### Step 4: Formulate the Final Expression\nSubstituting this massive number back into our original expression, we get:\n**$3^{7,625,597,484,987}$**\n\n### Step 5: Understand the Magnitude of the Final Number\nTo fully "calculate" this number means writing it out, but that is physically impossible. Let\'s look at exactly how large this number is by calculating how many digits it has.\n\nThe number of digits $D$ in any positive integer $N$ is given by the formula: \n$D = \\lfloor \\log_{10}(N) \\rfloor + 1$\n\nFor our number:\n$\\log_{10}(3^{7,625,597,484,987}) = 7,625,597,484,987 \\times \\log_{10}(3)$\n\nUsing the approximation $\\log_{10}(3) \\approx 0.47712125472$:\n$D \\approx 7,625,597,484,987 \\times 0.47712125472 \\approx \\mathbf{3,638,334,640,024}$ **digits**\n\nThis number has over **3.6 trillion digits**. To put that into perspective, if you were to print this number out on paper, it would require millions of books. If you tried to save it as a text file on a computer, it would take roughly **3.6 terabytes of storage space** just to hold the digits. \n\n### Step 6: Extract the First and Last Digits\nBecause we cannot write out a 3.6-trillion-digit number, the closest we can get to "calculating" it is finding its first and last few digits using modular arithmetic and logarithms.\n\n**The Last Three Digits:**\nTo find the last three digits, we need to evaluate $3^{7,625,597,484,987} \\pmod{1000}$.\nBecause of Euler\'s totient theorem, powers of 3 modulo 1000 repeat every 400 powers (i.e., $3^{400} \\equiv 1 \\pmod{1000}$). \nFirst, we find the remainder of our giant exponent divided by 400:\n$7,625,597,484,987 \\pmod{400} = 187$\n\nSo, we need to find $3^{187} \\pmod{1000}$. Through step-by-step modular exponentiation (squaring and multiplying), it turns out that:\n$3^{187} \\equiv \\mathbf{387} \\pmod{1000}$\n\nTherefore, the final number ends in **...387**.\n\n**The First Few Digits:**\nTo find the leading digits, we use the fractional part of our logarithm from Step 5. \nWe found that $\\log_{10}(N) \\approx 3,638,334,640,024.094$\nThe fractional part is $0.094$. \nWe calculate $10^{0.094} \\approx 1.243...$\n\nTherefore, the number begins with **1243...**\n\n### Conclusion\nWhile the exact value of $3^{3^{3^3}}$ is far too large to be written out in the physical universe, we have completely calculated its structure. \n\n**Final Answer:** \n$3^{3^{3^3}} = 3^{7,625,597,484,987}$, which is a number starting with **1243...**, ending with **...387**, and containing exactly **3,638,334,640,024** decimal digits.', refusal=None, role='assistant', annotations=None, audio=None, function_call=None, tool_calls=[]))], created=1783044456, model='zai-org/GLM-5.2', object='chat.completion', service_tier=None, system_fingerprint=None, usage=CompletionUsage(completion_tokens=14532, prompt_tokens=33, total_tokens=14565, completion_tokens_details=None, prompt_tokens_details=None), provider='together-ai')

together-ai/zai-org/GLM-5.2 — reasoning:stream (validation_failure)

Error
Traceback (most recent call last):
  File "/tmp/tmp_6a9696d/snippet.py", line 31, in <module>
    raise Exception("VALIDATION FAILED: reasoning stream - no reasoning information in stream")
Exception: VALIDATION FAILED: reasoning stream - no reasoning information in stream
Code snippet
from openai import OpenAI

client = OpenAI(api_key="***", base_url="https://internal.devtest.truefoundry.tech/api/llm")

response = client.chat.completions.create(
    model="test-v2-together-ai/zai-org-GLM-5.2",
    messages=[
        {"role": "user", "content": "How to calculate 3^3^3^3? Think step by step and show all reasoning."},
    ],
    reasoning_effort="medium",
    stream=True,
)
_reasoning_detected = False
for chunk in response:
    if chunk.choices and len(chunk.choices) > 0:
        delta = chunk.choices[0].delta
        if delta.content is not None:
            print(delta.content, end="", flush=True)
        if getattr(delta, "reasoning_content", None) is not None:
            _reasoning_detected = True
        if getattr(delta, "reasoning", None) is not None:
            _reasoning_detected = True

    _usage = getattr(chunk, "usage", None)
    if _usage is not None:
        _details = getattr(_usage, "completion_tokens_details", None)
        if _details and getattr(_details, "reasoning_tokens", 0) > 0:
            _reasoning_detected = True

if not _reasoning_detected:
    raise Exception("VALIDATION FAILED: reasoning stream - no reasoning information in stream")
print("\nVALIDATION: reasoning stream SUCCESS")
Output
To calculate the expression **$3^{3^{3^3}}$**, we need to evaluate it step by step. Exponentiation is right-associative, which means it is evaluated from the top down (or right to left). 

The expression is properly grouped as:
**$3^{\left(3^{\left(3^3\right)}\right)}$**

Here is the step-by-step reasoning:

### Step 1: Evaluate the innermost exponent
The topmost part of the power tower is $3^3$.
$$3^3 = 3 \times 3 \times 3 = 27$$

Substitute this back into the expression:
$$3^{\left(3^{27}\right)}$$

### Step 2: Evaluate the next exponent down
Now we must calculate $3^{27}$. We can do this by repeated multiplication:
* $3^1 = 3$
* $3^2 = 9$
* $3^3 = 27$
* $3^4 = 81$
* $3^5 = 243$
* $3^6 = 729$
* $3^7 = 2,187$
* $3^8 = 6,561$
* $3^9 = 19,683$
* $3^{10} = 59,049$
* ...and continuing this pattern up to $3^{27}$.

Calculating this exactly yields:
$$3^{27} = 7,625,597,484,987$$

Substitute this back into the expression. The problem is now reduced to:
$$3^{7,625,597,484,987}$$

### Step 3: Understand the magnitude of the final calculation
To "calculate" this final number completely, we would be multiplying 3 by itself over 7.6 trillion times. The result is an astronomically large number.

To put it in perspective, we can calculate exactly how many digits this final number has. The number of digits $D$ of any number $x$ in base 10 is given by the formula:
$$D = \lfloor \log_{10}(x) \rfloor + 1$$

For our number, $x = 3^{7,625,597,484,987}$:
$$D = \lfloor 7,625,597,484,987 \times \log_{10}(3) \rfloor + 1$$

Using the approximation $\log_{10}(3) \approx 0.4771212547196624$:
$$D \approx \lfloor 7,625,597,484,987 \times 0.4771212547196624 \rfloor + 1$$
$$D \approx \lfloor 3,638,334,639,991.3 \rfloor + 1$$
$$D = 3,638,334,639,992 \text{ digits}$$

**This single number has over 3.6 trillion digits.** If you were to print it out on paper, it would require millions of standard books. It is physically impossible to write out the full decimal representation in our universe, but mathematically, the most simplified exact form is $3^{7,625,597,484,987}$.

### Bonus: Can we find the first and last few digits?
Even though we cannot write the whole number, we can calculate its first and last digits using mathematical tricks.

**The Last 4 Digits:**
We want to find $3^{7,625,597,484,987} \pmod{10000}$.
By Euler's Totient Theorem, we know that $3^{\phi(10000)} \equiv 1 \pmod{10000}$. The totient function $\phi(10000) = 4000$.
Therefore, we can subtract multiples of 4000 from our massive exponent:
$$7,625,597,484,987 \pmod{4000} = 987$$

This means the last 4 digits of our massive number are exactly the same as the last 4 digits of $3^{987}$. Through modular exponentiation (or a computer), we find:
$$3^{987} \equiv 9387 \pmod{10000}$$
So, the number ends in **9387**.

**The First Few Digits:**
We can find the leading digits using the fractional part of the logarithm we calculated earlier:
$$\log_{10}(3^{7,625,597,484,987}) \approx 3,638,334,639,991.3097$$

The fractional part is $0.3097$. We can find the leading digits by raising 10 to this fractional power:
$$10^{0.3097} \approx 2.041$$

Therefore, the massive number starts with **2041...**

### Final Answer:
The calculation $3^{3^{3^3}}$ simplifies step-by-step to $3^{7,625,597,484,987}$. This number is far too large to be written out fully (possessing exactly **3,638,334,639,992 digits**), but its first few digits are **2041...** and its last four digits are **9387**.
Successes (7)

together-ai/zai-org/GLM-5.2 — tool-call (success)

Output
Function: get_weather
Arguments: {"location":"London"}
VALIDATION: tool-call SUCCESS

together-ai/zai-org/GLM-5.2 — structured-output (success)

Output
{
  "name": "science fair",
  "date": "Friday",
  "participants": ["Alice", "Bob"]
}
VALIDATION: structured-output SUCCESS

together-ai/zai-org/GLM-5.2 — json-output (success)

Output
{
  "colors": [
    {
      "name": "Red",
      "hex": "#FF0000"
    },
    {
      "name": "Green",
      "hex": "#00FF00"
    },
    {
      "name"
... (truncated, 77 chars omitted)

together-ai/zai-org/GLM-5.2 — params:stream (success)

Output
The capital of France is Paris.

together-ai/zai-org/GLM-5.2 — structured-output:stream (success)

Output
{
  "name": "science fair",
  "date": "Friday"
  ,
  "participants": ["Alice", "Bob"]
}
VALIDATION: structured-output stream SUCCESS

together-ai/zai-org/GLM-5.2 — json-output:stream (success)

Output
{


  "colors": [
    {
      "name": "Crimson",
      "hex_code": "#DC143C"
    },
    {
      "name": "Teal",
      "hex_code": "#008080"
    },
   
... (truncated, 109 chars omitted)

together-ai/zai-org/GLM-5.2 — params (success)

Output
The capital of France is Paris.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant