Block #1,352,909

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/3/2015, 9:05:10 PM · Difficulty 10.7961 · 5,458,233 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a45393bdd074222022a68772a6a374a551b7cd8e4732271d3b31764003936e6d

Height

#1,352,909

Difficulty

10.796150

Transactions

2

Size

1.11 KB

Version

2

Bits

0acbd077

Nonce

81,072,221

Timestamp

12/3/2015, 9:05:10 PM

Confirmations

5,458,233

Merkle Root

62192d495292ab7ef70473f35d3b279a5f4be8c2b5929a3330a2b75578901548
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.

3.350 × 10⁹⁶(97-digit number)
33506767775312938242…83517728090427443201
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
3.350 × 10⁹⁶(97-digit number)
33506767775312938242…83517728090427443201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.701 × 10⁹⁶(97-digit number)
67013535550625876484…67035456180854886401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.340 × 10⁹⁷(98-digit number)
13402707110125175296…34070912361709772801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.680 × 10⁹⁷(98-digit number)
26805414220250350593…68141824723419545601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.361 × 10⁹⁷(98-digit number)
53610828440500701187…36283649446839091201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.072 × 10⁹⁸(99-digit number)
10722165688100140237…72567298893678182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.144 × 10⁹⁸(99-digit number)
21444331376200280475…45134597787356364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.288 × 10⁹⁸(99-digit number)
42888662752400560950…90269195574712729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.577 × 10⁹⁸(99-digit number)
85777325504801121900…80538391149425459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.715 × 10⁹⁹(100-digit number)
17155465100960224380…61076782298850918401
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,733,245 XPM·at block #6,811,141 · 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.

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