Documentation > Documentation > Craftly Cloud > How It Works

How Craftly Cloud Works

Craftly Cloud turns a decentralized network of heterogeneous consumer and enterprise hardware into a coherent high-performance compute fabric. The system relies on four core architectural layers.

Distributed Grid Architecture

When you install the Craftly client and connect your computer, your machine announces its available hardware capacity (CPU threads, GPU VRAM, free RAM, and storage cache) to the Craftly domestic orchestrator via a secure, outbound-only WebSocket connection.

Nodes are automatically grouped by geographic proximity and domestic ISP routing to maintain sub-10ms peer-to-peer latency. Because all traffic stays within Bangladesh’s domestic internet exchange points (BDIX), data transfer between nodes is near-instantaneous and consumes zero international bandwidth.

Workload Partitioning & Scheduling

Large computational jobs—such as batch neural network inference, dataset tokenization, or genomic sequence alignment—are split into deterministic, independent micro-tasks.

  • Task Chunking: Heavy models are sharded across compatible nodes based on each node's real-time memory and processing profile.
  • Dynamic Fault Tolerance: If a contributor closes their laptop or disconnects, the scheduler detects the missing heartbeat within 300 milliseconds and transparently reassigns the pending micro-task to an active peer node.

Sandboxed Execution

Security is non-negotiable. Compute tasks run inside hardware-enforced WebAssembly or lightweight containerized sandboxes.

The guest process has strictly no visibility into your file system, network interfaces, browser cache, or other applications. The sandbox only has access to a pre-allocated segment of RAM and virtual scratch space, ensuring your system remains completely secure.

Cryptographic Verification & Consensus

To guarantee data integrity and prevent malicious or corrupted calculations:

  • Zero-Knowledge Checkpoints: Micro-tasks return cryptographically signed proofs of computation alongside intermediate results.
  • Redundant Verification: Sensitive calculations are cross-checked through multi-node sampling before final assembly.