Block #1,513,377

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/26/2016, 5:38:41 PM · Difficulty 10.6034 · 5,328,090 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a4fc18b43163fc787d7e2257c5b155a706499353f21fe182f28af38a69784554

Height

#1,513,377

Difficulty

10.603443

Transactions

9

Size

4.53 KB

Version

2

Bits

0a9a7b36

Nonce

164,554,362

Timestamp

3/26/2016, 5:38:41 PM

Confirmations

5,328,090

Merkle Root

3adb2deaeff7030a1a8f227b9d50292de1ad71f4c375c9226b49323089057a0e
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.

1.323 × 10⁹⁴(95-digit number)
13238578836090399415…38478168682529737841
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
1.323 × 10⁹⁴(95-digit number)
13238578836090399415…38478168682529737841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.647 × 10⁹⁴(95-digit number)
26477157672180798831…76956337365059475681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.295 × 10⁹⁴(95-digit number)
52954315344361597663…53912674730118951361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.059 × 10⁹⁵(96-digit number)
10590863068872319532…07825349460237902721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.118 × 10⁹⁵(96-digit number)
21181726137744639065…15650698920475805441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.236 × 10⁹⁵(96-digit number)
42363452275489278130…31301397840951610881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.472 × 10⁹⁵(96-digit number)
84726904550978556261…62602795681903221761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.694 × 10⁹⁶(97-digit number)
16945380910195711252…25205591363806443521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.389 × 10⁹⁶(97-digit number)
33890761820391422504…50411182727612887041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.778 × 10⁹⁶(97-digit number)
67781523640782845009…00822365455225774081
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,976,110 XPM·at block #6,841,466 · 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