Block #1,502,973

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/19/2016, 2:06:35 AM · Difficulty 10.6481 · 5,321,525 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
296c4e759334f7a03c68ee115cd1c014be9a273399bc5742a9994ba6576eba2d

Height

#1,502,973

Difficulty

10.648124

Transactions

2

Size

1004 B

Version

2

Bits

0aa5eb72

Nonce

173,397,234

Timestamp

3/19/2016, 2:06:35 AM

Confirmations

5,321,525

Merkle Root

55ca10e64e4722dd0cea15ea43b000dcf7d5e36678510f597bb9884837a2a511
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.481 × 10⁹⁶(97-digit number)
14818325041677416605…35040755132771788801
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.481 × 10⁹⁶(97-digit number)
14818325041677416605…35040755132771788801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.963 × 10⁹⁶(97-digit number)
29636650083354833210…70081510265543577601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.927 × 10⁹⁶(97-digit number)
59273300166709666421…40163020531087155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.185 × 10⁹⁷(98-digit number)
11854660033341933284…80326041062174310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.370 × 10⁹⁷(98-digit number)
23709320066683866568…60652082124348620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.741 × 10⁹⁷(98-digit number)
47418640133367733137…21304164248697241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.483 × 10⁹⁷(98-digit number)
94837280266735466274…42608328497394483201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.896 × 10⁹⁸(99-digit number)
18967456053347093254…85216656994788966401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.793 × 10⁹⁸(99-digit number)
37934912106694186509…70433313989577932801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.586 × 10⁹⁸(99-digit number)
75869824213388373019…40866627979155865601
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,840,057 XPM·at block #6,824,497 · 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