Block #1,512,791

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/26/2016, 7:47:15 AM · Difficulty 10.6039 · 5,301,251 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
abbfc86a1014122eac603cb5f542b9cc8ba6eb71b31cacea2e849cbd5355eecc

Height

#1,512,791

Difficulty

10.603867

Transactions

7

Size

8.56 KB

Version

2

Bits

0a9a9704

Nonce

1,081,089,339

Timestamp

3/26/2016, 7:47:15 AM

Confirmations

5,301,251

Merkle Root

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

9.226 × 10⁹⁵(96-digit number)
92265052439117554313…16964025706674009601
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
9.226 × 10⁹⁵(96-digit number)
92265052439117554313…16964025706674009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.845 × 10⁹⁶(97-digit number)
18453010487823510862…33928051413348019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.690 × 10⁹⁶(97-digit number)
36906020975647021725…67856102826696038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.381 × 10⁹⁶(97-digit number)
73812041951294043450…35712205653392076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.476 × 10⁹⁷(98-digit number)
14762408390258808690…71424411306784153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.952 × 10⁹⁷(98-digit number)
29524816780517617380…42848822613568307201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.904 × 10⁹⁷(98-digit number)
59049633561035234760…85697645227136614401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.180 × 10⁹⁸(99-digit number)
11809926712207046952…71395290454273228801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.361 × 10⁹⁸(99-digit number)
23619853424414093904…42790580908546457601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.723 × 10⁹⁸(99-digit number)
47239706848828187808…85581161817092915201
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,756,411 XPM·at block #6,814,041 · 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