Block #1,534,752

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2016, 11:00:03 AM · Difficulty 10.6182 · 5,282,438 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eadb7f518bb9231fa57abce0775d9b80af9562b4b61937e6479d77f1e58d5011

Height

#1,534,752

Difficulty

10.618207

Transactions

3

Size

15.01 KB

Version

2

Bits

0a9e42d4

Nonce

755,767,955

Timestamp

4/10/2016, 11:00:03 AM

Confirmations

5,282,438

Merkle Root

efe5542398efa2024f60879ae0f5c1fcf56a763d00c4261344dfe664bdf3b156
Transactions (3)
1 in → 1 out9.0200 XPM109 B
51 in → 1 out1462.1664 XPM7.41 KB
51 in → 1 out3144.8573 XPM7.41 KB
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.295 × 10⁹⁵(96-digit number)
12954536200314086917…66588016654097366721
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.295 × 10⁹⁵(96-digit number)
12954536200314086917…66588016654097366721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.590 × 10⁹⁵(96-digit number)
25909072400628173835…33176033308194733441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.181 × 10⁹⁵(96-digit number)
51818144801256347671…66352066616389466881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.036 × 10⁹⁶(97-digit number)
10363628960251269534…32704133232778933761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.072 × 10⁹⁶(97-digit number)
20727257920502539068…65408266465557867521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.145 × 10⁹⁶(97-digit number)
41454515841005078137…30816532931115735041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.290 × 10⁹⁶(97-digit number)
82909031682010156275…61633065862231470081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.658 × 10⁹⁷(98-digit number)
16581806336402031255…23266131724462940161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.316 × 10⁹⁷(98-digit number)
33163612672804062510…46532263448925880321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.632 × 10⁹⁷(98-digit number)
66327225345608125020…93064526897851760641
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,781,556 XPM·at block #6,817,189 · 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