Block #416,850

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/23/2014, 5:20:42 PM · Difficulty 10.3997 · 6,400,322 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3ad1a914d6277408747735aa243ccfd68aa3740950ad929922f310a57a0f23d2

Height

#416,850

Difficulty

10.399664

Transactions

5

Size

1.08 KB

Version

2

Bits

0a665069

Nonce

50,331,936

Timestamp

2/23/2014, 5:20:42 PM

Confirmations

6,400,322

Merkle Root

5b358ed80ca1a3f3917c6b090bef4aa28e8f46938e6af47bb089287531f9ec9b
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.678 × 10⁹⁴(95-digit number)
26783777894623189902…26345631737223620349
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.678 × 10⁹⁴(95-digit number)
26783777894623189902…26345631737223620349
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.356 × 10⁹⁴(95-digit number)
53567555789246379805…52691263474447240699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.071 × 10⁹⁵(96-digit number)
10713511157849275961…05382526948894481399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.142 × 10⁹⁵(96-digit number)
21427022315698551922…10765053897788962799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.285 × 10⁹⁵(96-digit number)
42854044631397103844…21530107795577925599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.570 × 10⁹⁵(96-digit number)
85708089262794207689…43060215591155851199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.714 × 10⁹⁶(97-digit number)
17141617852558841537…86120431182311702399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.428 × 10⁹⁶(97-digit number)
34283235705117683075…72240862364623404799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.856 × 10⁹⁶(97-digit number)
68566471410235366151…44481724729246809599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.371 × 10⁹⁷(98-digit number)
13713294282047073230…88963449458493619199
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,781,411 XPM·at block #6,817,171 · 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