Block #213,824

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/17/2013, 2:26:51 AM · Difficulty 9.9226 · 6,593,346 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
86172c51c607c45807452d8e452745da1ff3ce053421de979b81bb1774d0d218

Height

#213,824

Difficulty

9.922550

Transactions

3

Size

1.88 KB

Version

2

Bits

09ec2c42

Nonce

3,198

Timestamp

10/17/2013, 2:26:51 AM

Confirmations

6,593,346

Merkle Root

12c9ebcb3f4865e0f8b802700fb2c138b886d6c9f43687c3887ea2fd8b824d62
Transactions (3)
1 in → 1 out10.1700 XPM110 B
13 in → 1 out133.2500 XPM1.49 KB
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

3.203 × 10⁹⁶(97-digit number)
32038244342867353200…07671341376630475789
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
3.203 × 10⁹⁶(97-digit number)
32038244342867353200…07671341376630475789
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.407 × 10⁹⁶(97-digit number)
64076488685734706401…15342682753260951579
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.281 × 10⁹⁷(98-digit number)
12815297737146941280…30685365506521903159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.563 × 10⁹⁷(98-digit number)
25630595474293882560…61370731013043806319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.126 × 10⁹⁷(98-digit number)
51261190948587765121…22741462026087612639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.025 × 10⁹⁸(99-digit number)
10252238189717553024…45482924052175225279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.050 × 10⁹⁸(99-digit number)
20504476379435106048…90965848104350450559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.100 × 10⁹⁸(99-digit number)
41008952758870212097…81931696208700901119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.201 × 10⁹⁸(99-digit number)
82017905517740424194…63863392417401802239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.640 × 10⁹⁹(100-digit number)
16403581103548084838…27726784834803604479
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,701,369 XPM·at block #6,807,169 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy