Block #401,611

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/12/2014, 9:21:22 PM · Difficulty 10.4341 · 6,412,836 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6f9ba464bb7b71b88c8ddd104f45b606ba8e48cef2b266f1f970ff29187f0639

Height

#401,611

Difficulty

10.434116

Transactions

1

Size

900 B

Version

2

Bits

0a6f2235

Nonce

591,340

Timestamp

2/12/2014, 9:21:22 PM

Confirmations

6,412,836

Merkle Root

62de109aedc9beca4badeddfec038e8523860d0f7d9a27e8c85ffafd98a1622d
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.

2.192 × 10⁹³(94-digit number)
21924152850303611037…82607533999534021219
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
2.192 × 10⁹³(94-digit number)
21924152850303611037…82607533999534021219
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.384 × 10⁹³(94-digit number)
43848305700607222075…65215067999068042439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.769 × 10⁹³(94-digit number)
87696611401214444151…30430135998136084879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.753 × 10⁹⁴(95-digit number)
17539322280242888830…60860271996272169759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.507 × 10⁹⁴(95-digit number)
35078644560485777660…21720543992544339519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.015 × 10⁹⁴(95-digit number)
70157289120971555320…43441087985088679039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.403 × 10⁹⁵(96-digit number)
14031457824194311064…86882175970177358079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.806 × 10⁹⁵(96-digit number)
28062915648388622128…73764351940354716159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.612 × 10⁹⁵(96-digit number)
56125831296777244256…47528703880709432319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.122 × 10⁹⁶(97-digit number)
11225166259355448851…95057407761418864639
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,759,646 XPM·at block #6,814,446 · 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