VEKTRA RESEARCH / 06

VEKTRA Monitor

A proposed observation service. Current browser behavior is documented separately.

Planned · no live monitoring service

01What runs today

Visible quotes refetch every twenty seconds. Connected balances and activity receipts poll every twelve seconds. An active transaction waits up to sixty seconds for its receipt. These client timers require an open page, connectivity and browser scheduling.

There is no deployed scheduler, market-history database or notification service. Local activity tracks transactions, not market observations. Route Watch, Liquidity Watch and Execution Alerts are proposed, not live.

02Proposed watches

Route Watch would store chain, pair, exact input and candidate outputs at a recorded block. Liquidity Watch would record pool availability, unlocked state, quoted depth and tick observations. Missing data must be unavailable, never a synthetic zero-price observation.

Execution Alerts would track authorized hashes and add replacement/reorg handling. A collector would persist immutable observations, an evaluator generate events and a deduplicator control delivery. All are proposed.

01Proposed scheduler
02Block-pinned collector
03Observation store
04Threshold evaluator
05Deduplication + cooldown
06Authorized notification channel

Proposed architecture. No monitoring service is deployed.

03Thresholds and hysteresis

Relative output deviation must compare the same pair, direction, exact input and units. References require block and age metadata. A lower clear threshold can prevent repeated transitions around a trigger boundary.

Illustrative settings are a thirty-second route poll, sixty-second liquidity poll and five-minute cooldown. These are design examples, not current defaults or service commitments.

D_t=\left|Q_t/Q_{\mathrm{ref}}-1\right|,\quad D_t\ge\theta_{\mathrm{trigger}},\quad 0\le\theta_{\mathrm{clear}}<\theta_{\mathrm{trigger}}

Positive Q_t and Q_ref are outputs for identical inputs. D is a fraction: 2% uses θ = 0.02. Clear only below θ_clear. Missing samples cannot satisfy the calculation.

04Deduplication and history

A proposed event key hashes chain, pair, kind, route and time bucket. Store first/last observation, source, triggering block, evaluator version and delivery attempts. Cooldown must not erase a distinct route or severity event.

Market history needs retention policy, indexed immutable observations and reorg labels. The existing localStorage list does not supply these guarantees.

k=H(\mathrm{chain},\mathrm{pair},\mathrm{kind},\mathrm{route},\lfloor t/W\rfloor)

H is a deterministic hash and W a positive bucket width in matching time units. This is a proposed design, not an operating identifier.

05Freshness and reliability

Collectors would need bounded retries, rate limits, explicit gaps and source health checks. Record wall time and block timestamp; HTTP success alone does not establish a recent block.

Coverage counts fresh completed observations relative to the expected schedule. It does not guarantee detection of crossings between polls. No monitoring uptime or alert-delivery guarantee is claimed.

\mathrm{coverage}=N_{\mathrm{fresh\ completed}}/N_{\mathrm{expected}},\quad N_{\mathrm{expected}}>0

Counts must use the same window and schedule. An undefined expected count displays unavailable, not 100%.