How long does it take to secure my digital estate?

It takes less than 5 minutes to set up your account, upload your most important files, and designate your trusted contacts. Our protocol handles the rest autonomously, ensuring your legacy is secured forever without ongoing effort.

Is there a monthly fee for permanent storage?

No. Inheribase is free to get started. We have eliminated monthly subscriptions in favor of a pay-as-you-go model. Once your files are secured in our protocol, they are stored permanently on Arweave, meaning you never have to worry about credit card expirations or data deletion.

What happens to my digital assets when I pass away?

Inheribase monitors your activity through conditional dead man's switches. If you become inactive, your encrypted vault automatically unlocks and transfers your cryptocurrency, passwords, and digital life's work directly to your pre-assigned trusted contacts. No attorneys or complex legal procedures are required.

How does persistent encrypted memory for AI agents work?

Using our MCP server, AI agents can write directly to an encrypted, permanent vault on the Arweave network. This allows autonomous agents to maintain state, memory, and transaction history indefinitely, providing a sovereign alternative to rented cloud servers.

Understanding M-of-N Threshold Cryptography

What is Threshold Cryptography?

Threshold cryptography is a technique where a secret is divided into "N" parts, and only a subset "M" of those parts is required to reconstruct the original secret.

In digital inheritance, this ensures that no single heir or compromised server can illegitimately decrypt the vault. It requires consensus among the fragmented keys, providing a massive upgrade to the security architecture of the digital legacy.

Practical Example

Imagine you have 3 heirs and you configure a 2-of-3 threshold scheme:

Heir A receives shard 1
Heir B receives shard 2
Heir C receives shard 3

Any two heirs can combine their shards to reconstruct the decryption key, but no single heir can access the vault alone. This protects against both loss (one shard can be lost without consequence) and malice (one rogue heir cannot act unilaterally).

Shamir's Secret Sharing

The mathematical foundation is Lagrange interpolation over finite fields. A polynomial of degree M-1 is constructed such that each shard represents a point on the polynomial. Any M points are sufficient to reconstruct the polynomial (and thus the secret), but M-1 or fewer points reveal nothing about the original secret.