Block #444,708

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/15/2014, 10:16:51 AM · Difficulty 10.3501 · 6,371,838 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
318613a01c75c23392f5ca0fbcd2e7db154291e8d44b978b7bbbd751d1fb9526

Height

#444,708

Difficulty

10.350143

Transactions

1

Size

935 B

Version

2

Bits

0a59a301

Nonce

11,955

Timestamp

3/15/2014, 10:16:51 AM

Confirmations

6,371,838

Merkle Root

4bacf10c52f8e924cbd85c64b450d491c474254890392746649c7b05a34e03ee
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.

7.015 × 10⁹⁴(95-digit number)
70150344380343280524…78029600913317856259
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
7.015 × 10⁹⁴(95-digit number)
70150344380343280524…78029600913317856259
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.403 × 10⁹⁵(96-digit number)
14030068876068656104…56059201826635712519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.806 × 10⁹⁵(96-digit number)
28060137752137312209…12118403653271425039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.612 × 10⁹⁵(96-digit number)
56120275504274624419…24236807306542850079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.122 × 10⁹⁶(97-digit number)
11224055100854924883…48473614613085700159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.244 × 10⁹⁶(97-digit number)
22448110201709849767…96947229226171400319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.489 × 10⁹⁶(97-digit number)
44896220403419699535…93894458452342800639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.979 × 10⁹⁶(97-digit number)
89792440806839399071…87788916904685601279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.795 × 10⁹⁷(98-digit number)
17958488161367879814…75577833809371202559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.591 × 10⁹⁷(98-digit number)
35916976322735759628…51155667618742405119
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,776,497 XPM·at block #6,816,545 · 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.
Privacy Policy·

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