Block #1,534,638

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2016, 9:21:22 AM · Difficulty 10.6171 · 5,273,923 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ea6bd296182fa20497bd59671482a719aa605cd771c886e1672c3b1eefd42f74

Height

#1,534,638

Difficulty

10.617075

Transactions

3

Size

15.03 KB

Version

2

Bits

0a9df89f

Nonce

514,421,433

Timestamp

4/10/2016, 9:21:22 AM

Confirmations

5,273,923

Merkle Root

ccf05eafc2e69dd525421f7e7fbc5d7aa24228bdbff7bf2ff482699755488aaf
Transactions (3)
1 in → 1 out9.0200 XPM109 B
51 in → 1 out650.8422 XPM7.41 KB
51 in → 1 out1314.4346 XPM7.42 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.

7.392 × 10⁹³(94-digit number)
73926495340370331501…35266908570194424021
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
7.392 × 10⁹³(94-digit number)
73926495340370331501…35266908570194424021
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.478 × 10⁹⁴(95-digit number)
14785299068074066300…70533817140388848041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.957 × 10⁹⁴(95-digit number)
29570598136148132600…41067634280777696081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.914 × 10⁹⁴(95-digit number)
59141196272296265200…82135268561555392161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.182 × 10⁹⁵(96-digit number)
11828239254459253040…64270537123110784321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.365 × 10⁹⁵(96-digit number)
23656478508918506080…28541074246221568641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.731 × 10⁹⁵(96-digit number)
47312957017837012160…57082148492443137281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.462 × 10⁹⁵(96-digit number)
94625914035674024321…14164296984886274561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.892 × 10⁹⁶(97-digit number)
18925182807134804864…28328593969772549121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.785 × 10⁹⁶(97-digit number)
37850365614269609728…56657187939545098241
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,712,546 XPM·at block #6,808,560 · 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