Skip to main content
Challenge

Build a Local Open-Model Speculative Decoding Configuration Planner

Benchmark draft and target open-weight model pairings under local vLLM serving. Synthesize speedup expectations and memory trade-offs using hosted Claude, outputting validated deployment configuration schemas.

EngineeringHosted by Vera
Challenge brief

What you are building

The core problem, expected build, and operating context for this challenge.

Benchmark draft and target open-weight model pairings under local vLLM serving. Synthesize speedup expectations and memory trade-offs using hosted Claude, outputting validated deployment configuration schemas.

Inference Optimization Specialist

Ingest model specifications for proposed target and draft open-weight models using pandas to structure parameter data.

Simulate theoretical latency reductions per decoding step using the formula: Speedup = 1 + (draft_tokens * acceptance_rate) - verification_overhead.

Invoke hosted Claude via Anthropic API to analyze memory overhead versus throughput acceleration, validating schemas with Pydantic.

Generate a deployment configuration payload specifying speculative draft steps and worker memory allocation.

Interactive configuration builder yielding verified YAML parameters for open serving frameworks.

Benchmark records of token acceptance rates and latency profiles across draft-target open-weight pairings. Starter examples below are synthetic. They are not downloaded records.

vLLM open-model serving Leverages vLLM speculative decoding mechanisms (n-gram, draft model serving) to evaluate serving performance.

mastra-ai, anthropic, pandas, pydantic. Mastra AI orchestrates the evaluation workflow, chaining draft model sizing with Claude reasoning tasks. Hosted Claude accessed through official SDK; draft/target models are open-weights only.

Submit runnable source, pinned dependencies, setup commands, a working interface, example outputs, and a recorded end-to-end demo. Include tests and an action log.

Calculates net speedup factor strictly as: 1 + (draft_tokens * assumed_acceptance_rate) - verification_overhead.

Accounts for additional memory footprint by summing target size, draft size, and a static 20GB KV-cache overhead.

Emits valid serving configuration blocks with Claude-generated optimization notes validated by Pydantic.

```json [ { "input": { "target_gb": 140, "draft_gb": 2, "assumed_acceptance_rate": 0.8, "draft_tokens": 5, "verification_overhead": 0.5 }, "expected_output": { "speedup_factor": 4.5, "required_vram_gb": 162, "viable": true, "configuration_recommendation": "Use 5 draft tokens per speculative step. Synthetic simplified record." } }, { "input": { "target_gb": 140, "draft_gb": 16, "assumed_acceptance_rate": 0.6, "draft_tokens": 4, "verification_overhead": 0.4 }, "expected_output": { "speedup_factor": 3, "required_vram_gb": 176, "viable": false, "configuration_recommendation": "Memory requirement exceeds limits. Synthetic simplified record." } } ] ```

Simulates speculative decoding configurations without deploying unmonitored local serving daemons. Use mock external writes. Require human review before any real deployment.

Rules

Participation guide

Simulates speculative decoding configurations without deploying unmonitored local serving daemons. Use mock external writes and human review.

Delivery guide

How work is evaluated

Evaluation

Calculates net speedup factor strictly as: 1 + (draft_tokens * assumed_acceptance_rate) - verification_overhead. Accounts for additional memory footprint by summing target size, draft size, and a static 20GB KV-cache overhead. Emits valid serving configuration blocks with Claude-generated optimization notes validated by Pydantic.

Submission format

Runnable source, pinned dependencies, setup commands, working interface, example outputs, recorded demo, tests, and action logs.

Datasets

Challenge datasets

Public datasets, plus the private datasets you have access to.

Evaluation rubric

How submissions are scored

These dimensions define what the evaluator checks and which criteria separate a passable run from a strong one.

Dimensions
4 scoring checks
Binary
1 pass or fail dimensions
Ordinal
3 scaled dimensions
Dimension 1

Complete workflow

Ingest model specifications for proposed target and draft open-weight models using pandas to structure parameter data. Simulate theoretical latency reductions per decoding step using the formula: Speedup = 1 + (draft_tokens * acceptance_rate) - verification_overhead. Invoke hosted Claude via Anthropic API to analyze memory overhead versus throughput acceleration, validating schemas with Pydantic. Generate a deployment configuration payload specifying speculative draft steps and worker memory allocation.

Score scale
012
Score 0

Missing or incorrect.

Score 1

Partly complete, with documented gaps.

Score 2

Complete, with reproducible evidence.

Dimension 2

Correctness and evidence

Calculates net speedup factor strictly as: 1 + (draft_tokens * assumed_acceptance_rate) - verification_overhead. Accounts for additional memory footprint by summing target size, draft size, and a static 20GB KV-cache overhead. Emits valid serving configuration blocks with Claude-generated optimization notes validated by Pydantic.

Score scale
012
Score 0

Missing or incorrect.

Score 1

Partly complete, with documented gaps.

Score 2

Complete, with reproducible evidence.

Dimension 3

Review interface

Interactive configuration builder yielding verified YAML parameters for open serving frameworks.

Score scale
012
Score 0

Missing or incorrect.

Score 1

Partly complete, with documented gaps.

Score 2

Complete, with reproducible evidence.

Dimension 4

Safe execution

Simulates speculative decoding configurations without deploying unmonitored local serving daemons.

Binary check

This dimension contributes its full weight only when the submission satisfies the requirement. Partial credit is not awarded.

Learning goals

What you should walk away with

  • Ingest model specifications for proposed target and draft open-weight models using pandas to structure parameter data.

  • Simulate theoretical latency reductions per decoding step using the formula: Speedup = 1 + (draft_tokens * acceptance_rate) - verification_overhead.

  • Invoke hosted Claude via Anthropic API to analyze memory overhead versus throughput acceleration, validating schemas with Pydantic.

  • Generate a deployment configuration payload specifying speculative draft steps and worker memory allocation.

Resources and assets

Reference links and supporting material

Dataset notes

Benchmark records of token acceptance rates and latency profiles across draft-target open-weight pairings. Supplied starter examples are synthetic, not source extracts.

Challenge setup

Configuration summary for this challenge.

Challenge input

Input details are not configured.

Mastra AI

TypeScript agent framework.

Evaluated output

No output checks are configured.

Evaluation checks
  • Ingest model specifications for proposed target and draft open-weight models using pandas to structure para...
  • Calculates net speedup factor strictly as: 1 + (draft_tokens * assumed_acceptance_rate) - verification_over...
  • Interactive configuration builder yielding verified YAML parameters for open serving frameworks.
Configured evaluation evidence
  • 2 public reference cases
Configured runtime
  • 2 configured tools

Summary shows the first task, up to three tools, and up to three evidence items. Open the technical recipe to view all configured items.

View technical recipe

Configured tools

Action Space
  • Mastra AI · Optional
Orchestration
  • Mastra AI · Optional

Evaluation contract

  • Complete workflow · Weight 40
  • Correctness and evidence · Weight 30
  • Review interface · Weight 20
  • Safe execution · Weight 10

Reference cases

  • 2 public reference cases

Workflow tasks

No workflow tasks are configured.

Recipe freeze marker

No recipe freeze time is recorded.

Frequently Asked Questions about Build a Local Open-Model Speculative Decoding Configuration Planner