Block #1,577,170

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2016, 6:54:43 AM · Difficulty 10.6825 · 5,249,500 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d7966dac51d8696b919dde7036d6fd3b6341add9aecb65dd8fe0702665d1095d

Height

#1,577,170

Difficulty

10.682543

Transactions

2

Size

1019 B

Version

2

Bits

0aaebb21

Nonce

413,099,451

Timestamp

5/9/2016, 6:54:43 AM

Confirmations

5,249,500

Merkle Root

4b9dbaa08b11a86e14ebc0423acb8e6b7408d704de647766c64660c75b7d8551
Transactions (2)
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.899 × 10⁹⁶(97-digit number)
28992803152181241390…90186517484107289601
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.899 × 10⁹⁶(97-digit number)
28992803152181241390…90186517484107289601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.798 × 10⁹⁶(97-digit number)
57985606304362482781…80373034968214579201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.159 × 10⁹⁷(98-digit number)
11597121260872496556…60746069936429158401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.319 × 10⁹⁷(98-digit number)
23194242521744993112…21492139872858316801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.638 × 10⁹⁷(98-digit number)
46388485043489986225…42984279745716633601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.277 × 10⁹⁷(98-digit number)
92776970086979972450…85968559491433267201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.855 × 10⁹⁸(99-digit number)
18555394017395994490…71937118982866534401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.711 × 10⁹⁸(99-digit number)
37110788034791988980…43874237965733068801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.422 × 10⁹⁸(99-digit number)
74221576069583977960…87748475931466137601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.484 × 10⁹⁹(100-digit number)
14844315213916795592…75496951862932275201
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,857,507 XPM·at block #6,826,669 · 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