Block #320,659

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2013, 7:33:10 PM · Difficulty 10.1839 · 6,504,796 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3f64d5f6f2008a6d4a7a533a9bb6e7137fd4d302880528bf11803d40c89a5cbc

Height

#320,659

Difficulty

10.183860

Transactions

22

Size

4.88 KB

Version

2

Bits

0a2f116c

Nonce

185,581

Timestamp

12/19/2013, 7:33:10 PM

Confirmations

6,504,796

Merkle Root

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

9.785 × 10⁹⁷(98-digit number)
97855525307819634416…14342411220125790801
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
9.785 × 10⁹⁷(98-digit number)
97855525307819634416…14342411220125790801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.957 × 10⁹⁸(99-digit number)
19571105061563926883…28684822440251581601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.914 × 10⁹⁸(99-digit number)
39142210123127853766…57369644880503163201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.828 × 10⁹⁸(99-digit number)
78284420246255707532…14739289761006326401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.565 × 10⁹⁹(100-digit number)
15656884049251141506…29478579522012652801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.131 × 10⁹⁹(100-digit number)
31313768098502283013…58957159044025305601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.262 × 10⁹⁹(100-digit number)
62627536197004566026…17914318088050611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.252 × 10¹⁰⁰(101-digit number)
12525507239400913205…35828636176101222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.505 × 10¹⁰⁰(101-digit number)
25051014478801826410…71657272352202444801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.010 × 10¹⁰⁰(101-digit number)
50102028957603652821…43314544704404889601
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,847,744 XPM·at block #6,825,454 · 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