Block #1,534,525

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2016, 7:29:03 AM · Difficulty 10.6170 · 5,292,551 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
51692e829a0842500f4ae7ece83ebba2d12f8d9de1c814cbcab8141683090d7d

Height

#1,534,525

Difficulty

10.617036

Transactions

2

Size

7.60 KB

Version

2

Bits

0a9df60d

Nonce

717,760,139

Timestamp

4/10/2016, 7:29:03 AM

Confirmations

5,292,551

Merkle Root

90a46e2398ace575e1ecbbe442ac89d828d0230ca32def422bcfaca611e34dce
Transactions (2)
1 in → 1 out8.9400 XPM110 B
51 in → 1 out2799.0050 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.

2.426 × 10⁹⁴(95-digit number)
24268426250051868091…80313943626854784161
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
2.426 × 10⁹⁴(95-digit number)
24268426250051868091…80313943626854784161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.853 × 10⁹⁴(95-digit number)
48536852500103736182…60627887253709568321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.707 × 10⁹⁴(95-digit number)
97073705000207472365…21255774507419136641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.941 × 10⁹⁵(96-digit number)
19414741000041494473…42511549014838273281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.882 × 10⁹⁵(96-digit number)
38829482000082988946…85023098029676546561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.765 × 10⁹⁵(96-digit number)
77658964000165977892…70046196059353093121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.553 × 10⁹⁶(97-digit number)
15531792800033195578…40092392118706186241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.106 × 10⁹⁶(97-digit number)
31063585600066391157…80184784237412372481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.212 × 10⁹⁶(97-digit number)
62127171200132782314…60369568474824744961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.242 × 10⁹⁷(98-digit number)
12425434240026556462…20739136949649489921
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,860,792 XPM·at block #6,827,075 · 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