referrerpolicy=no-referrer-when-downgrade

Crate polkadot_node_core_pvf

source ·
Expand description

The PVF validation host. Responsible for coordinating preparation and execution of PVFs.

For more background, refer to the Implementer’s Guide: PVF Pre-checking, Candidate Validation and PVF Host and Workers.

§Entrypoint

This crate provides a simple API. You first start the validation host, which gives you the handle and the future you need to poll.

Then using the handle the client can send three types of requests:

(a) PVF pre-checking. This takes the Pvf code and tries to prepare it (verify and compile) in order to pre-check its validity.

(b) PVF execution. This accepts the PVF params and the Pvf code, prepares (verifies and compiles) the code, and then executes PVF with the params.

(c) Heads up. This request allows to signal that the given PVF may be needed soon and that it should be prepared for execution.

The preparation results are cached for some time after they either used or was signaled in heads up. All requests that depends on preparation of the same PVF are bundled together and will be executed as soon as the artifact is prepared.

§Priority

PVF execution requests can specify the priority with which the given request should be handled. Different priority levels have different effects. This is discussed below.

Preparation started by a heads up signal always starts with the background priority. If there is already a request for that PVF preparation under way the priority is inherited. If after heads up, a new PVF execution request comes in with a higher priority, then the original task’s priority will be adjusted to match the new one if it’s larger.

Priority can never go down, only up.

§Under the hood

§The flow

Under the hood, the validation host is built using a bunch of communicating processes, not dissimilar to actors. Each of such “processes” is a future task that contains an event loop that processes incoming messages, potentially delegating sub-tasks to other “processes”.

Two of these processes are queues. The first one is for preparation jobs and the second one is for execution. Both of the queues are backed by separate pools of workers of different kind.

Preparation workers handle preparation requests by prevalidating and instrumenting PVF wasm code, and then passing it into the compiler, to prepare the artifact.

§Artifacts

An artifact is the final product of preparation. If the preparation succeeded, then the artifact will contain the compiled code usable for quick execution by a worker later on. If the preparation failed, then no artifact is created.

The artifact is saved on disk and is also tracked by an in memory table. This in memory table doesn’t contain the artifact contents though, only a flag for the state of the given artifact and some associated data. If the artifact failed to process, this also includes the error.

A pruning task will run at a fixed interval of time. This task will remove all artifacts that weren’t used or received a heads up signal for a while.

§Execution

The execute workers will be fed by the requests from the execution queue, which is basically a combination of a path to the compiled artifact and the params.

Modules§

  • Various utilities for testing.

Structs§

  • Configuration for the validation host.
  • Validation host metrics.
  • Preparation statistics, including the CPU time and memory taken.
  • A struct that carries the exhaustive set of data to prepare an artifact out of plain Wasm binary
  • Status of security features on the current system.
  • A handle to the async process serving the validation host requests.

Enums§

Constants§

Functions§

  • Read some data prefixed by its length from r.
  • Write some data prefixed by its length into w.
  • Utility to get the version of a worker, used for version checks.
  • Start the validation host.