Block #1,606,581

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/30/2016, 11:06:01 AM · Difficulty 10.6080 · 5,224,537 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3a39e968aab387f3e954ef8bae3f9959dd0ec4c93a5cc1bdf5f17415c27089d7

Height

#1,606,581

Difficulty

10.608002

Transactions

2

Size

1.05 KB

Version

2

Bits

0a9ba607

Nonce

281,718,327

Timestamp

5/30/2016, 11:06:01 AM

Confirmations

5,224,537

Merkle Root

9fb04db735a1955adf08ab8c4da89550c24003089d51308486213a8c50b55c47
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.

3.768 × 10⁹⁵(96-digit number)
37687720369060702368…11723513484484445601
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
3.768 × 10⁹⁵(96-digit number)
37687720369060702368…11723513484484445601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.537 × 10⁹⁵(96-digit number)
75375440738121404737…23447026968968891201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.507 × 10⁹⁶(97-digit number)
15075088147624280947…46894053937937782401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.015 × 10⁹⁶(97-digit number)
30150176295248561894…93788107875875564801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.030 × 10⁹⁶(97-digit number)
60300352590497123789…87576215751751129601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.206 × 10⁹⁷(98-digit number)
12060070518099424757…75152431503502259201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.412 × 10⁹⁷(98-digit number)
24120141036198849515…50304863007004518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.824 × 10⁹⁷(98-digit number)
48240282072397699031…00609726014009036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.648 × 10⁹⁷(98-digit number)
96480564144795398063…01219452028018073601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.929 × 10⁹⁸(99-digit number)
19296112828959079612…02438904056036147201
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,893,090 XPM·at block #6,831,117 · 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