ALL TRANSACTIONS

gtfH2cL66PXE5775

CONSUMP_PREPOST_GRANT

completed · 8/30/2026, 9:30:39 PM

Statuscompleted
Date8/30/2026, 9:30:39 PM
User85242227@qq.com
User AmountCNY 0.0000975
User BalancegrvvOoGQ6TYr3Stt
Vendortokease
Vendor CostCNY -0.00008972
Vendor BalancegrUOO3gPM2QLOqUW
Aliasdeepseek-v4-flash-g1 / grUORIPWk0XTl4W7
Mode / Protoreq-v1-chatcmpl / openai-chatcmpl
Log MIDgtfH2cJ6LL9YCjAg
SETTLEMENT TELEMETRY

Inference Log

Log MIDgtfH2cJ6LL9YCjAg
Typechat_completion
Aliasdeepseek-v4-flash-g1 / grUORIPWk0XTl4W7
Hostinforaxi-server:3300:v1.1.3736-1-gf63106d5c
Mode / Protoreq-v1-chatcmplopenai-chatcmpl
Vendor/LLMtokease/deepseek-v4-flash/yd
Statussuccess
User Pricing
30 × 0.75 = 0.000023
0 × 0.015 = 0.000000
50 × 1.5 = 0.000075
CNY 0.000097
Vendor Cost
30 × 0.69034 = 0.000021
0 × 0.013802 = 0.000000
50 × 1.380211 = 0.000069
CNY 0.000090
Latency3.17490595s
Summary
{
  "system_prefix": null,
  "history_count": 1,
  "user_summary": {
    "text": "请详细回答以下问题:解释什么是递归,并举例说明。请展开论述,分点说明,条理清晰。",
    "has_image": false,
    "has_tool_result": false
  },
  "assistant_summary": {
    "text": "递归(Recursion)是计算机科学和数学中一种核心的解决问题的方法。它的本质是**“函数直接或间接地调用自身”**,通过将一个大问题分解为若干个具有相同结构但规模更小的子问题,直到",
    "tool_calls": [],
    "stop_reason": "length"
  }
}
Stop Reasonlength
Vendor Request
Method: POST

URL: https://tokease.cn/v1/chat/completions

Headers:
{
  "authorization": "Bearer sk-oRd5RE9JhT1bDLQ3lOZgdkESeCuowucrcNX16gZEgHecnxmu",
  "content-type": "application/json"
}

Body:
{
  "max_tokens": 50,
  "messages": [
    {
      "content": "请详细回答以下问题:解释什么是递归,并举例说明。请展开论述,分点说明,条理清晰。",
      "role": "user"
    }
  ],
  "model": "deepseek-v4-flash/yd"
}
Vendor Response
Headers:
{
  "content-length": "949",
  "content-type": "application/json",
  "date": "Sun, 30 Aug 2026 13:30:39 GMT",
  "req-arrive-time": "1788096639274",
  "req-cost-time": "722",
  "resp-start-time": "1788096639997",
  "server": "nginx",
  "set-cookie": "route=75f379117db1ce19429dcd576b3552d8; Path=/",
  "vary": "Accept-Encoding",
  "via": "1.1 Caddy",
  "x-envoy-upstream-service-time": "712",
  "x-new-api-version": "v0.0.0",
  "x-oneapi-request-id": "202608301330392413545008268d9d6ypkpyoka",
  "x-request-id": "79f168c7-ceb4-4fbc-9ada-10998e74ca89"
}

Body:
{
  "id": "chatcmpl-9bbe4f9e-64ce-4b9a-88af-9bacc3c7f800",
  "object": "chat.completion",
  "created": 1788096639,
  "model": "deepseek-v4-flash",
  "choices": [
    {
      "index": 0,
      "message": {
        "role": "assistant",
        "content": "递归(Recursion)是计算机科学和数学中一种核心的解决问题的方法。它的本质是**“函数直接或间接地调用自身”**,通过将一个大问题分解为若干个具有相同结构但规模更小的子问题,直到",
        "refusal": null,
        "annotations": null,
        "audio": null,
        "function_call": null,
        "reasoning": null
      },
      "logprobs": null,
      "finish_reason": "length",
      "stop_reason": null,
      "token_ids": null,
      "routed_experts": null
    }
  ],
  "service_tier": null,
  "system_fingerprint": "vllm-0.25.1-dp8-ep-1d021cfb",
  "usage": {
    "prompt_tokens": 30,
    "total_tokens": 80,
    "completion_tokens": 50,
    "prompt_tokens_details": {
      "cached_tokens": 0,
      "multimodal_tokens": null
    }
  },
  "prompt_logprobs": null,
  "prompt_token_ids": null,
  "prompt_text": null,
  "kv_transfer_params": null,
  "metrics": null
}
Token Usage
{
  "completion_tokens": 50,
  "prompt_tokens": 30,
  "prompt_tokens_details": {
    "cached_tokens": 0,
    "multimodal_tokens": null
  },
  "total_tokens": 80
}
Fixes
User Request
Method: POST

URL: /v1/chat/completions

Headers:
{
  "accept": "*/*",
  "accept-encoding": "gzip",
  "authorization": "Bearer sk_r4gAXloJQt74Cp4prb19OItKzoG77lLhjmWT4ei20Ua",
  "content-length": "338",
  "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-flash-g1",
  "messages": [
    {
      "role": "user",
      "content": "请详细回答以下问题:解释什么是递归,并举例说明。请展开论述,分点说明,条理清晰。"
    }
  ],
  "max_tokens": 50
}
User Response
Body:
{
  "choices": [
    {
      "finish_reason": "length",
      "index": 0,
      "logprobs": null,
      "message": {
        "annotations": null,
        "audio": null,
        "content": "递归(Recursion)是计算机科学和数学中一种核心的解决问题的方法。它的本质是**“函数直接或间接地调用自身”**,通过将一个大问题分解为若干个具有相同结构但规模更小的子问题,直到",
        "function_call": null,
        "reasoning": null,
        "refusal": null,
        "role": "assistant"
      },
      "routed_experts": null,
      "stop_reason": null,
      "token_ids": null
    }
  ],
  "created": 1788096639,
  "id": "chatcmpl-9bbe4f9e-64ce-4b9a-88af-9bacc3c7f800",
  "kv_transfer_params": null,
  "metrics": null,
  "model": "deepseek-v4-flash-g1",
  "object": "chat.completion",
  "prompt_logprobs": null,
  "prompt_text": null,
  "prompt_token_ids": null,
  "service_tier": null,
  "system_fingerprint": "vllm-0.25.1-dp8-ep-1d021cfb",
  "usage": {
    "completion_tokens": 50,
    "prompt_tokens": 30,
    "prompt_tokens_details": {
      "cached_tokens": 0,
      "multimodal_tokens": null
    },
    "total_tokens": 80
  }
}
Created At8/30/2026, 9:30:39 PM