{
  "system_prefix": null,
  "history_count": 1,
  "user_summary": {
    "text": "解释什么是递归，用一句话",
    "has_image": false,
    "has_tool_result": false
  },
  "assistant_summary": {
    "text": "递归是一种在函数或算法中通过调用自身来将问题逐步分解为更小的同类子问题，直到达到终止条件后再逐层返回结果的编程与数学方法。",
    "tool_calls": [],
    "stop_reason": "stop"
  }
}

Method: POST

URL: https://ark.cn-beijing.volces.com/api/v3/chat/completions

Headers:
{
  "authorization": "Bearer ark-f137c261-ce2c-4ac5-b065-fafb2270c3d7-1801e",
  "content-type": "application/json"
}

Body:
{
  "max_tokens": 100,
  "messages": [
    {
      "content": "解释什么是递归，用一句话",
      "role": "user"
    }
  ],
  "model": "deepseek-v4-pro-ga-260813"
}

Headers:
{
  "content-length": "1255",
  "content-type": "application/json; charset=utf-8",
  "date": "Sun, 30 Aug 2026 13:19:31 GMT",
  "server": "istio-envoy",
  "vary": "Accept-Encoding",
  "x-client-request-id": "unknown-20260830211927-jFNhZfCL",
  "x-envoy-upstream-service-time": "4192",
  "x-request-id": "021788095967359682583ac3749be18cdf4b3a384433037abf40f"
}

Body:
{
  "choices": [
    {
      "finish_reason": "stop",
      "index": 0,
      "logprobs": null,
      "message": {
        "content": "递归是一种在函数或算法中通过调用自身来将问题逐步分解为更小的同类子问题，直到达到终止条件后再逐层返回结果的编程与数学方法。",
        "reasoning_content": "我们需要回答用户中文：“解释什么是递归，用一句话”。需要一句话解释递归。可以简洁。注意“递归”定义：函数直接或间接调用自身来解决问题的方法，通常将问题分解为更小的同类子问题，直到达到基本情况。用一句话。需要确保中文一句话。可能：“递归是一种在函数或算法中通过调用自身来将问题逐步分解为更小的同类子问题、直到触及终止条件再逐层返回的编程/数学方法。” 一句话。用户要求用一句话，所以只输出一句话。避免额外。",
        "role": "assistant"
      }
    }
  ],
  "created": 1788095971,
  "id": "021788095967359682583ac3749be18cdf4b3a384433037abf40f",
  "model": "deepseek-v4-pro-ga-260813",
  "service_tier": "default",
  "object": "chat.completion",
  "usage": {
    "completion_tokens": 150,
    "prompt_tokens": 89,
    "total_tokens": 239,
    "prompt_tokens_details": {
      "cached_tokens": 0
    },
    "completion_tokens_details": {
      "reasoning_tokens": 113
    }
  }
}

{
  "completion_tokens": 150,
  "completion_tokens_details": {
    "reasoning_tokens": 113
  },
  "prompt_tokens": 89,
  "prompt_tokens_details": {
    "cached_tokens": 0
  },
  "total_tokens": 239
}

Method: POST

URL: /v1/chat/completions

Headers:
{
  "accept": "*/*",
  "accept-encoding": "gzip",
  "authorization": "Bearer sk_r4gAXloJQt74Cp4prb19OItKzoG77lLhjmWT4ei20Ua",
  "content-length": "133",
  "content-type": "application/json",
  "host": "api.tokendiet.cn",
  "user-agent": "curl/8.5.0",
  "via": "2.0 Caddy",
  "x-forwarded-for": "13.212.110.206",
  "x-forwarded-host": "api.tokendiet.cn",
  "x-forwarded-proto": "https"
}

Body:
{
  "model": "deepseek-v4-pro-g2",
  "messages": [
    {
      "role": "user",
      "content": "解释什么是递归，用一句话"
    }
  ],
  "max_tokens": 100
}

Body:
{
  "choices": [
    {
      "finish_reason": "stop",
      "index": 0,
      "logprobs": null,
      "message": {
        "content": "递归是一种在函数或算法中通过调用自身来将问题逐步分解为更小的同类子问题，直到达到终止条件后再逐层返回结果的编程与数学方法。",
        "reasoning_content": "我们需要回答用户中文：“解释什么是递归，用一句话”。需要一句话解释递归。可以简洁。注意“递归”定义：函数直接或间接调用自身来解决问题的方法，通常将问题分解为更小的同类子问题，直到达到基本情况。用一句话。需要确保中文一句话。可能：“递归是一种在函数或算法中通过调用自身来将问题逐步分解为更小的同类子问题、直到触及终止条件再逐层返回的编程/数学方法。” 一句话。用户要求用一句话，所以只输出一句话。避免额外。",
        "role": "assistant"
      }
    }
  ],
  "created": 1788095971,
  "id": "021788095967359682583ac3749be18cdf4b3a384433037abf40f",
  "model": "deepseek-v4-pro-g2",
  "object": "chat.completion",
  "service_tier": "default",
  "usage": {
    "completion_tokens": 150,
    "completion_tokens_details": {
      "reasoning_tokens": 113
    },
    "prompt_tokens": 89,
    "prompt_tokens_details": {
      "cached_tokens": 0
    },
    "total_tokens": 239
  }
}