westquant-core 0.2.0a1__py3-none-any.whl

westquant_core/__init__.py

@@ -0,0 +1,42 @@
+from .model import (
+    EquivalenceKind,
+    Representation,
+    RepresentationKind,
+    TransformationRecord,
+)
+from .repgraph import RepGraph
+from .plugin import (
+    CompilerAdapter,
+    EvaluatorAdapter,
+    FrontendAdapter,
+    PluginCapabilities,
+    PluginManifest,
+    RuntimeAdapter,
+    TransformationProvider,
+    WestQuantPlugin,
+)
+
+__all__ = [
+    "EquivalenceKind",
+    "Representation",
+    "RepresentationKind",
+    "TransformationRecord",
+    "RepGraph",
+    "PluginCapabilities",
+    "PluginManifest",
+    "FrontendAdapter",
+    "TransformationProvider",
+    "CompilerAdapter",
+    "EvaluatorAdapter",
+    "RuntimeAdapter",
+    "WestQuantPlugin",
+]
+
+from .search import Action, Evaluation, Objective, PolicyState, BeamSearchResult, DeterministicBeamSearch, pareto_front, pareto_dominates, metric_delta, state_id
+from .registry import TransformationRegistry, TransformationSpec
+from .dataset import DatasetManifest, write_jsonl, read_jsonl
+
+__all__ += ["Action", "Evaluation", "Objective", "PolicyState", "BeamSearchResult", "DeterministicBeamSearch", "pareto_front", "pareto_dominates", "metric_delta", "state_id", "TransformationRegistry", "TransformationSpec", "DatasetManifest", "write_jsonl", "read_jsonl"]
+
+from .validation import validate_policy_record
+__all__ += ["validate_policy_record"]

westquant_core/dataset.py

@@ -0,0 +1,59 @@
+from __future__ import annotations
+
+import hashlib
+import json
+from dataclasses import dataclass, field
+from pathlib import Path
+from typing import Any, Iterable
+
+
+@dataclass(frozen=True)
+class DatasetManifest:
+    dataset_id: str
+    schema_version: str
+    generator_version: str
+    framework: str
+    config: dict[str, Any]
+    planned_challenges: int
+    metadata: dict[str, Any] = field(default_factory=dict)
+
+    def to_dict(self) -> dict[str, Any]:
+        return {
+            "dataset_id": self.dataset_id,
+            "schema_version": self.schema_version,
+            "generator_version": self.generator_version,
+            "framework": self.framework,
+            "config": self.config,
+            "planned_challenges": self.planned_challenges,
+            "metadata": self.metadata,
+        }
+
+    @property
+    def sha256(self) -> str:
+        blob = json.dumps(self.to_dict(), sort_keys=True, separators=(",", ":"), default=str).encode()
+        return hashlib.sha256(blob).hexdigest()
+
+
+def write_jsonl(path: str | Path, records: Iterable[dict[str, Any]], *, append: bool = False) -> int:
+    path = Path(path)
+    path.parent.mkdir(parents=True, exist_ok=True)
+    mode = "a" if append else "w"
+    n = 0
+    with path.open(mode, encoding="utf-8") as f:
+        for record in records:
+            f.write(json.dumps(record, sort_keys=True, default=str) + "\n")
+            n += 1
+    return n
+
+
+def read_jsonl(path: str | Path) -> list[dict[str, Any]]:
+    out: list[dict[str, Any]] = []
+    with Path(path).open("r", encoding="utf-8") as f:
+        for line_no, line in enumerate(f, 1):
+            if not line.strip():
+                continue
+            try:
+                out.append(json.loads(line))
+            except json.JSONDecodeError as exc:
+                raise ValueError(f"invalid JSONL at line {line_no}: {exc}") from exc
+    return out

westquant_core/model.py

@@ -0,0 +1,110 @@
+from __future__ import annotations
+
+from dataclasses import dataclass, field
+from enum import Enum
+from typing import Any
+
+
+class RepresentationKind(str, Enum):
+    PROBLEM = "problem"
+    OPERATOR = "operator"
+    CIRCUIT = "circuit"
+    LAYOUT = "layout"
+    CONTROL = "control"
+    HARDWARE = "hardware"
+    EXECUTION = "execution"
+    EVALUATION = "evaluation"
+    SEARCH_STATE = "search_state"
+    PROGRAM = "program"
+    HAMILTONIAN = "hamiltonian"
+    RESOURCE_ESTIMATE = "resource_estimate"
+
+
+class EquivalenceKind(str, Enum):
+    EXACT = "exact"
+    OBJECTIVE_EQUIVALENT = "objective_equivalent"
+    GROUND_STATE_EQUIVALENT = "ground_state_equivalent"
+    SAME_PROBLEM_DIFFERENT_DYNAMICS = "same_problem_different_dynamics"
+    APPROXIMATE = "approximate"
+    UNKNOWN = "unknown"
+    INVALID = "invalid"
+
+
+@dataclass(frozen=True)
+class Representation:
+    id: str
+    kind: RepresentationKind
+    payload: dict[str, Any]
+    schema_version: str = "0.2"
+    semantic_root: str | None = None
+    framework: str | None = None
+    metadata: dict[str, Any] = field(default_factory=dict)
+
+    def __post_init__(self) -> None:
+        if not self.id.strip():
+            raise ValueError("representation id must be non-empty")
+        if not isinstance(self.payload, dict):
+            raise TypeError("payload must be a dict")
+
+    def to_dict(self) -> dict[str, Any]:
+        return {
+            "id": self.id,
+            "kind": self.kind.value,
+            "schema_version": self.schema_version,
+            "semantic_root": self.semantic_root,
+            "framework": self.framework,
+            "payload": self.payload,
+            "metadata": self.metadata,
+        }
+
+    @classmethod
+    def from_dict(cls, data: dict[str, Any]) -> "Representation":
+        return cls(
+            id=data["id"],
+            kind=RepresentationKind(data["kind"]),
+            schema_version=data.get("schema_version", "0.2"),
+            semantic_root=data.get("semantic_root"),
+            framework=data.get("framework"),
+            payload=dict(data.get("payload", {})),
+            metadata=dict(data.get("metadata", {})),
+        )
+
+
+@dataclass(frozen=True)
+class TransformationRecord:
+    id: str
+    input_id: str
+    output_id: str
+    transform_id: str
+    transform_version: str
+    equivalence: EquivalenceKind = EquivalenceKind.UNKNOWN
+    parameters: dict[str, Any] = field(default_factory=dict)
+    verification: dict[str, Any] = field(default_factory=dict)
+    outcome: dict[str, Any] = field(default_factory=dict)
+    metrics_before: dict[str, float | int | None] = field(default_factory=dict)
+    metrics_after: dict[str, float | int | None] = field(default_factory=dict)
+    framework: str | None = None
+    cost: dict[str, float | int | None] = field(default_factory=dict)
+
+    def __post_init__(self) -> None:
+        if not self.id.strip() or not self.transform_id.strip():
+            raise ValueError("transformation id fields must be non-empty")
+        if self.input_id == self.output_id:
+            raise ValueError("input_id and output_id must differ")
+
+    def to_dict(self) -> dict[str, Any]:
+        return {
+            "id": self.id,
+            "input_id": self.input_id,
+            "output_id": self.output_id,
+            "transform_id": self.transform_id,
+            "transform_version": self.transform_version,
+            "equivalence": self.equivalence.value,
+            "parameters": self.parameters,
+            "verification": self.verification,
+            "outcome": self.outcome,
+            "metrics_before": self.metrics_before,
+            "metrics_after": self.metrics_after,
+            "framework": self.framework,
+            "cost": self.cost,
+        }

westquant_core/plugin.py

@@ -0,0 +1,62 @@
+from __future__ import annotations
+
+from dataclasses import dataclass, field
+from typing import Any, Protocol, runtime_checkable
+
+from .model import Representation, TransformationRecord
+
+
+@dataclass(frozen=True)
+class PluginCapabilities:
+    import_kinds: tuple[str, ...] = ()
+    export_kinds: tuple[str, ...] = ()
+    transformations: tuple[str, ...] = ()
+    evaluators: tuple[str, ...] = ()
+    runtimes: tuple[str, ...] = ()
+    supports_repgraph: bool = True
+    supports_wqt_policy: bool = False
+
+
+@dataclass(frozen=True)
+class PluginManifest:
+    plugin_id: str
+    version: str
+    framework: str
+    framework_versions: str
+    api_version: str = "0.1"
+    capabilities: PluginCapabilities = field(default_factory=PluginCapabilities)
+
+
+@runtime_checkable
+class FrontendAdapter(Protocol):
+    def import_native(self, obj: Any, **context: Any) -> Representation: ...
+    def export_native(self, representation: Representation, **context: Any) -> Any: ...
+
+
+@runtime_checkable
+class TransformationProvider(Protocol):
+    def available_transformations(self, representation: Representation, **context: Any) -> list[str]: ...
+    def apply_transformation(
+        self, representation: Representation, transform_id: str, **context: Any
+    ) -> tuple[Representation, TransformationRecord]: ...
+
+
+@runtime_checkable
+class CompilerAdapter(Protocol):
+    def compile(self, representation: Representation, **context: Any) -> Representation: ...
+
+
+@runtime_checkable
+class EvaluatorAdapter(Protocol):
+    def evaluate(self, representation: Representation, **context: Any) -> dict[str, Any]: ...
+
+
+@runtime_checkable
+class RuntimeAdapter(Protocol):
+    def execute(self, representation: Representation, **context: Any) -> dict[str, Any]: ...
+
+
+@runtime_checkable
+class WestQuantPlugin(Protocol):
+    @property
+    def manifest(self) -> PluginManifest: ...

westquant_core/registry.py

@@ -0,0 +1,39 @@
+from __future__ import annotations
+
+from dataclasses import dataclass, field
+from typing import Any, Callable
+
+
+@dataclass(frozen=True)
+class TransformationSpec:
+    transform_id: str
+    version: str
+    input_kinds: tuple[str, ...]
+    output_kind: str
+    equivalence: str = "unknown"
+    description: str = ""
+    applicability: dict[str, Any] = field(default_factory=dict)
+    verification_method: str = "runtime"
+
+
+class TransformationRegistry:
+    def __init__(self) -> None:
+        self._specs: dict[str, TransformationSpec] = {}
+        self._impls: dict[str, Callable[..., Any]] = {}
+
+    def register(self, spec: TransformationSpec, implementation: Callable[..., Any] | None = None) -> None:
+        key = f"{spec.transform_id}@{spec.version}"
+        if key in self._specs:
+            raise ValueError(f"duplicate transformation: {key}")
+        self._specs[key] = spec
+        if implementation is not None:
+            self._impls[key] = implementation
+
+    def get(self, transform_id: str, version: str) -> TransformationSpec:
+        return self._specs[f"{transform_id}@{version}"]
+
+    def implementation(self, transform_id: str, version: str) -> Callable[..., Any] | None:
+        return self._impls.get(f"{transform_id}@{version}")
+
+    def list(self) -> list[TransformationSpec]:
+        return [self._specs[k] for k in sorted(self._specs)]

westquant_core/repgraph.py

@@ -0,0 +1,82 @@
+from __future__ import annotations
+
+from dataclasses import dataclass, field
+from typing import Any
+
+from .model import Representation, TransformationRecord
+
+
+@dataclass
+class RepGraph:
+    graph_id: str
+    schema_version: str = "0.2"
+    nodes: dict[str, Representation] = field(default_factory=dict)
+    edges: list[TransformationRecord] = field(default_factory=list)
+    metadata: dict[str, Any] = field(default_factory=dict)
+
+    def add_representation(self, representation: Representation) -> None:
+        if representation.id in self.nodes:
+            raise ValueError(f"duplicate representation id: {representation.id}")
+        self.nodes[representation.id] = representation
+
+    def add_transformation(self, edge: TransformationRecord) -> None:
+        if edge.input_id not in self.nodes:
+            raise ValueError(f"missing input representation: {edge.input_id}")
+        if edge.output_id not in self.nodes:
+            raise ValueError(f"missing output representation: {edge.output_id}")
+        if any(existing.id == edge.id for existing in self.edges):
+            raise ValueError(f"duplicate transformation id: {edge.id}")
+        self.edges.append(edge)
+        if self._has_cycle():
+            self.edges.pop()
+            raise ValueError("RepGraph must remain acyclic")
+
+    def children(self, node_id: str) -> list[Representation]:
+        ids = [e.output_id for e in self.edges if e.input_id == node_id]
+        return [self.nodes[i] for i in ids]
+
+    def validate(self) -> list[str]:
+        errors: list[str] = []
+        if not self.graph_id.strip():
+            errors.append("graph_id is empty")
+        for edge in self.edges:
+            if edge.input_id not in self.nodes:
+                errors.append(f"dangling input: {edge.input_id}")
+            if edge.output_id not in self.nodes:
+                errors.append(f"dangling output: {edge.output_id}")
+        if self._has_cycle():
+            errors.append("graph contains a cycle")
+        return errors
+
+    def _has_cycle(self) -> bool:
+        adjacency: dict[str, list[str]] = {node_id: [] for node_id in self.nodes}
+        for edge in self.edges:
+            if edge.input_id in adjacency:
+                adjacency[edge.input_id].append(edge.output_id)
+
+        visiting: set[str] = set()
+        visited: set[str] = set()
+
+        def dfs(node: str) -> bool:
+            if node in visiting:
+                return True
+            if node in visited:
+                return False
+            visiting.add(node)
+            for nxt in adjacency.get(node, []):
+                if dfs(nxt):
+                    return True
+            visiting.remove(node)
+            visited.add(node)
+            return False
+
+        return any(dfs(node) for node in adjacency if node not in visited)
+
+    def to_dict(self) -> dict[str, Any]:
+        return {
+            "schema_version": self.schema_version,
+            "graph_id": self.graph_id,
+            "metadata": self.metadata,
+            "nodes": [node.to_dict() for node in self.nodes.values()],
+            "edges": [edge.to_dict() for edge in self.edges],
+        }

westquant_core/search.py

@@ -0,0 +1,271 @@
+from __future__ import annotations
+
+import hashlib
+import json
+import math
+from dataclasses import dataclass, field
+from typing import Any, Callable, Iterable, Protocol, Sequence
+
+
+MetricValue = float | int | None
+
+
+@dataclass(frozen=True)
+class Objective:
+    name: str
+    direction: str = "min"
+    weight: float = 1.0
+
+    def __post_init__(self) -> None:
+        if self.direction not in {"min", "max"}:
+            raise ValueError("direction must be 'min' or 'max'")
+
+    def normalize(self, value: MetricValue) -> float:
+        if value is None:
+            return math.inf
+        x = float(value)
+        return x if self.direction == "min" else -x
+
+
+@dataclass(frozen=True)
+class Action:
+    stage: str
+    name: str
+    parameters: dict[str, Any] = field(default_factory=dict)
+
+    @property
+    def id(self) -> str:
+        blob = json.dumps(
+            {"stage": self.stage, "name": self.name, "parameters": self.parameters},
+            sort_keys=True,
+            separators=(",", ":"),
+            default=str,
+        )
+        return f"{self.stage}:{self.name}:{hashlib.sha256(blob.encode()).hexdigest()[:12]}"
+
+    def to_dict(self) -> dict[str, Any]:
+        return {"id": self.id, "stage": self.stage, "name": self.name, "parameters": self.parameters}
+
+
+@dataclass
+class Evaluation:
+    success: bool
+    metrics: dict[str, MetricValue] = field(default_factory=dict)
+    verification: dict[str, Any] = field(default_factory=dict)
+    error: dict[str, Any] | None = None
+    artifacts: dict[str, Any] = field(default_factory=dict)
+    cost: dict[str, MetricValue] = field(default_factory=dict)
+
+    @property
+    def selectable(self) -> bool:
+        if not self.success:
+            return False
+        equivalence = self.verification.get("equivalence")
+        return equivalence != "invalid"
+
+    def to_dict(self) -> dict[str, Any]:
+        return {
+            "success": self.success,
+            "selectable": self.selectable,
+            "metrics": self.metrics,
+            "verification": self.verification,
+            "error": self.error,
+            "artifacts": self.artifacts,
+            "cost": self.cost,
+        }
+
+
+@dataclass
+class PolicyState:
+    state_id: str
+    parent_state_id: str | None
+    step_index: int
+    prefix: tuple[Action, ...]
+    evaluation: Evaluation | None = None
+    kept: bool = False
+    terminal: bool = False
+
+    def to_dict(self) -> dict[str, Any]:
+        return {
+            "state_id": self.state_id,
+            "parent_state_id": self.parent_state_id,
+            "step_index": self.step_index,
+            "prefix": [a.to_dict() for a in self.prefix],
+            "evaluation": self.evaluation.to_dict() if self.evaluation else None,
+            "kept": self.kept,
+            "terminal": self.terminal,
+        }
+
+
+class RolloutEvaluator(Protocol):
+    def __call__(self, prefix: Sequence[Action]) -> Evaluation: ...
+
+
+class ActionProvider(Protocol):
+    def __call__(self, stage: str, prefix: Sequence[Action]) -> Iterable[Action]: ...
+
+
+def state_id(challenge_id: str, prefix: Sequence[Action]) -> str:
+    blob = json.dumps([a.to_dict() for a in prefix], sort_keys=True, separators=(",", ":"), default=str)
+    return f"{challenge_id}:state:{hashlib.sha256(blob.encode()).hexdigest()[:16]}"
+
+
+def pareto_dominates(a: dict[str, MetricValue], b: dict[str, MetricValue], objectives: Sequence[Objective]) -> bool:
+    better_or_equal = True
+    strictly_better = False
+    for obj in objectives:
+        av = obj.normalize(a.get(obj.name))
+        bv = obj.normalize(b.get(obj.name))
+        if av > bv:
+            better_or_equal = False
+            break
+        if av < bv:
+            strictly_better = True
+    return better_or_equal and strictly_better
+
+
+def pareto_front(items: Sequence[Any], metrics: Callable[[Any], dict[str, MetricValue]], objectives: Sequence[Objective]) -> list[Any]:
+    front: list[Any] = []
+    for i, item in enumerate(items):
+        mi = metrics(item)
+        if any(i != j and pareto_dominates(metrics(other), mi, objectives) for j, other in enumerate(items)):
+            continue
+        front.append(item)
+    return front
+
+
+@dataclass
+class BeamSearchResult:
+    challenge_id: str
+    stages: tuple[str, ...]
+    beam_width: int
+    states: list[PolicyState]
+    final_beam: list[PolicyState]
+    objectives: tuple[Objective, ...]
+
+    @property
+    def best(self) -> PolicyState | None:
+        selectable = [s for s in self.final_beam if s.evaluation and s.evaluation.selectable]
+        if not selectable:
+            return None
+        return min(selectable, key=self._score_key)
+
+    def _score_key(self, state: PolicyState) -> tuple[float, ...]:
+        assert state.evaluation is not None
+        exact_penalty = 0.0 if state.evaluation.verification.get("equivalence") == "exact" else 1.0
+        vals = tuple(obj.normalize(state.evaluation.metrics.get(obj.name)) for obj in self.objectives)
+        return (exact_penalty, *vals)
+
+    def records(self, *, framework: str, context: dict[str, Any] | None = None) -> list[dict[str, Any]]:
+        by_id = {s.state_id: s for s in self.states}
+        out: list[dict[str, Any]] = []
+        for s in self.states:
+            if s.parent_state_id is None or s.evaluation is None:
+                continue
+            p = by_id.get(s.parent_state_id)
+            before = p.evaluation.metrics if p and p.evaluation else {}
+            after = s.evaluation.metrics
+            out.append({
+                "schema_version": "wqt-policy-v0.1",
+                "framework": framework,
+                "challenge_id": self.challenge_id,
+                "context": context or {},
+                "state_id": s.parent_state_id,
+                "next_state_id": s.state_id,
+                "step_index": s.step_index,
+                "stage": s.prefix[-1].stage,
+                "action": s.prefix[-1].to_dict(),
+                "prefix_before": [a.to_dict() for a in (p.prefix if p else ())],
+                "prefix_after": [a.to_dict() for a in s.prefix],
+                "success": s.evaluation.success,
+                "selectable": s.evaluation.selectable,
+                "verification": s.evaluation.verification,
+                "metrics_before": before,
+                "metrics_after": after,
+                "reward_vector": metric_delta(after, before),
+                "cost": s.evaluation.cost,
+                "kept_in_beam": s.kept,
+                "terminal": s.terminal,
+                "error": s.evaluation.error,
+            })
+        return out
+
+
+def metric_delta(after: dict[str, MetricValue], before: dict[str, MetricValue]) -> dict[str, float | None]:
+    keys = sorted(set(after) | set(before))
+    out: dict[str, float | None] = {}
+    for k in keys:
+        av, bv = after.get(k), before.get(k)
+        if isinstance(av, (int, float)) and isinstance(bv, (int, float)):
+            out[k] = float(av) - float(bv)
+        else:
+            out[k] = None
+    return out
+
+
+class DeterministicBeamSearch:
+    def __init__(self, *, stages: Sequence[str], beam_width: int, objectives: Sequence[Objective]) -> None:
+        if not stages:
+            raise ValueError("stages must be non-empty")
+        if beam_width < 1:
+            raise ValueError("beam_width must be >= 1")
+        if not objectives:
+            raise ValueError("at least one objective is required")
+        self.stages = tuple(stages)
+        self.beam_width = int(beam_width)
+        self.objectives = tuple(objectives)
+
+    def run(self, *, challenge_id: str, actions: ActionProvider, evaluate: RolloutEvaluator) -> BeamSearchResult:
+        root = PolicyState(
+            state_id=state_id(challenge_id, ()),
+            parent_state_id=None,
+            step_index=-1,
+            prefix=(),
+            evaluation=None,
+            kept=True,
+            terminal=False,
+        )
+        states = [root]
+        beam = [root]
+
+        for step_index, stage in enumerate(self.stages):
+            expanded: list[PolicyState] = []
+            for parent in beam:
+                choices = sorted(list(actions(stage, parent.prefix)), key=lambda a: (a.name, a.id))
+                for action in choices:
+                    prefix = parent.prefix + (action,)
+                    ev = evaluate(prefix)
+                    expanded.append(PolicyState(
+                        state_id=state_id(challenge_id, prefix),
+                        parent_state_id=parent.state_id,
+                        step_index=step_index,
+                        prefix=prefix,
+                        evaluation=ev,
+                        kept=False,
+                        terminal=step_index == len(self.stages) - 1,
+                    ))
+            expanded.sort(key=self._state_key)
+            beam = [s for s in expanded if s.evaluation and s.evaluation.selectable][: self.beam_width]
+            for s in beam:
+                s.kept = True
+            states.extend(expanded)
+            if not beam:
+                break
+
+        return BeamSearchResult(
+            challenge_id=challenge_id,
+            stages=self.stages,
+            beam_width=self.beam_width,
+            states=states,
+            final_beam=beam,
+            objectives=self.objectives,
+        )
+
+    def _state_key(self, state: PolicyState) -> tuple[float, ...]:
+        if state.evaluation is None or not state.evaluation.selectable:
+            return (math.inf,) * (len(self.objectives) + 2)
+        exact_penalty = 0.0 if state.evaluation.verification.get("equivalence") == "exact" else 1.0
+        vals = tuple(obj.normalize(state.evaluation.metrics.get(obj.name)) for obj in self.objectives)
+        # Stable deterministic tie-breaker based on prefix action ids.
+        tie = int(hashlib.sha256("|".join(a.id for a in state.prefix).encode()).hexdigest()[:12], 16)
+        return (exact_penalty, *vals, float(tie))

westquant_core/validation.py

@@ -0,0 +1,23 @@
+from __future__ import annotations
+from typing import Any
+
+POLICY_REQUIRED = {
+    "schema_version", "framework", "challenge_id", "state_id", "next_state_id",
+    "step_index", "stage", "action", "success", "selectable", "verification",
+    "metrics_before", "metrics_after", "kept_in_beam", "terminal",
+}
+
+
+def validate_policy_record(record: dict[str, Any]) -> list[str]:
+    errors=[]
+    missing=sorted(POLICY_REQUIRED-set(record))
+    if missing: errors.append(f"missing fields: {missing}")
+    if record.get("schema_version") != "wqt-policy-v0.1": errors.append("schema_version must be wqt-policy-v0.1")
+    if not isinstance(record.get("action"),dict): errors.append("action must be an object")
+    else:
+        for key in ("stage","name","parameters"):
+            if key not in record["action"]: errors.append(f"action missing {key}")
+    for key in ("success","selectable","kept_in_beam","terminal"):
+        if key in record and not isinstance(record[key],bool): errors.append(f"{key} must be boolean")
+    if isinstance(record.get("step_index"),int) and record["step_index"]<0: errors.append("step_index must be >= 0")
+    return errors

westquant_core-0.2.0a1.dist-info/METADATA

@@ -0,0 +1,35 @@
+Metadata-Version: 2.4
+Name: westquant-core
+Version: 0.2.0a1
+Summary: Core representation contracts, WQIR and RepGraph for WestQuant Open
+Author: WestQuant Open / David Vesterlund
+License: Apache-2.0
+Project-URL: Homepage, https://github.com/WestQuantOpen
+Project-URL: Source, https://github.com/WestQuantOpen/westquant-core
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Provides-Extra: test
+Requires-Dist: pytest>=8; extra == "test"
+Dynamic: license-file
+
+# westquant-core
+
+Framework-neutral substrate for WestQuant Open representation search.
+
+## Alpha contents
+
+- WQIR-style typed representations across problem, Hamiltonian/operator,
+  circuit/program, layout, control, hardware, execution, evaluation and
+  resource-estimation layers;
+- RepGraph v0.2 DAG with explicit transformation provenance;
+- Transformation Registry;
+- framework-neutral plugin protocols;
+- deterministic beam search with explicit state/action rollouts;
+- Pareto utilities;
+- dataset manifests and JSONL utilities;
+- canonical `wqt-policy-v0.1` training-record schema and lightweight validator.
+
+WQT20 is intentionally not a runtime dependency. Deterministic and heuristic
+search remain fully usable without a learned model, giving a clean baseline for
+future WQT20 comparisons.

westquant_core-0.2.0a1.dist-info/RECORD

@@ -0,0 +1,13 @@
+westquant_core/__init__.py,sha256=eZ3amE5u-qqYF1O53dNHp1fjW8eJHkk3LUOcUn30vNs,1317
+westquant_core/dataset.py,sha256=d4Ezya6hl72riRlzNgLF53ePwoQKtO6wREVNEQ_x348,1876
+westquant_core/model.py,sha256=ZsCwRikEymwm8UHoIjaKP74caCtjA4FCDhIuXQeBoZc,3710
+westquant_core/plugin.py,sha256=OaSzIGUR9rpi8GCJxkQtd5Cw4pWHEu4HXR2l_osI7Hw,1854
+westquant_core/registry.py,sha256=2vXYSfqZJsSuB9nq6SfOxoOmKufZsZ2nBqJth_cbtnU,1363
+westquant_core/repgraph.py,sha256=3VTZxRGleEUHqLegGcI-lusq34XE8xhm7zBub8O4aUM,3119
+westquant_core/search.py,sha256=AQQpV8RkNHZyGsTOqCT7A9d6p8Ny6KhjUy-9YXX2-XM,9857
+westquant_core/validation.py,sha256=ufV-3EGeG0luR2p-_1eHnNCl0SFT1kJHsF09LRW8IXY,1149
+westquant_core-0.2.0a1.dist-info/licenses/LICENSE,sha256=z8d0m5b2O9McPEK1xHG_dWgUBT6EfBDz6wA0F7xSPTA,11358
+westquant_core-0.2.0a1.dist-info/METADATA,sha256=6KEVYngPIRttY5LPwN4ui0hHfa7Cry_oZs2B5UKLQpo,1295
+westquant_core-0.2.0a1.dist-info/WHEEL,sha256=YVMoNqKzERt-wjUZwJ33xBGAwnFl-4cqbYkTtWa4itE,91
+westquant_core-0.2.0a1.dist-info/top_level.txt,sha256=XOOGbyA-Yt9T6_vQYPjZLHUJd_acMcpbkENJTjncYC8,15
+westquant_core-0.2.0a1.dist-info/RECORD,,

westquant_core-0.2.0a1.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (84.0.0)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

westquant_core-0.2.0a1.dist-info/licenses/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

westquant_core-0.2.0a1.dist-info/top_level.txt

@@ -0,0 +1 @@
+westquant_core