Block #411,182

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/19/2014, 1:54:07 PM · Difficulty 10.4313 · 6,429,076 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
61c41e3638ef373430a4879a356661db921d303e40872aac1475535368796d60

Height

#411,182

Difficulty

10.431290

Transactions

2

Size

1.11 KB

Version

2

Bits

0a6e690c

Nonce

22,657

Timestamp

2/19/2014, 1:54:07 PM

Confirmations

6,429,076

Merkle Root

e03832524f918cb86dfdaec033698f828cc0a73e6df6c8e638176d07757f3362
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.

5.509 × 10⁹³(94-digit number)
55093839855995438724…77407567696321658879
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
5.509 × 10⁹³(94-digit number)
55093839855995438724…77407567696321658879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.101 × 10⁹⁴(95-digit number)
11018767971199087744…54815135392643317759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.203 × 10⁹⁴(95-digit number)
22037535942398175489…09630270785286635519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.407 × 10⁹⁴(95-digit number)
44075071884796350979…19260541570573271039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.815 × 10⁹⁴(95-digit number)
88150143769592701959…38521083141146542079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.763 × 10⁹⁵(96-digit number)
17630028753918540391…77042166282293084159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.526 × 10⁹⁵(96-digit number)
35260057507837080783…54084332564586168319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.052 × 10⁹⁵(96-digit number)
70520115015674161567…08168665129172336639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.410 × 10⁹⁶(97-digit number)
14104023003134832313…16337330258344673279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.820 × 10⁹⁶(97-digit number)
28208046006269664626…32674660516689346559
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,966,377 XPM·at block #6,840,257 · 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