Block #2,647,829

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/4/2018, 3:41:01 AM · Difficulty 11.7629 · 4,183,897 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
723ea9ca1afe32d847bbe31efddf8af8979978332e05bb8cc80b0db8e1696cf0

Height

#2,647,829

Difficulty

11.762854

Transactions

43

Size

12.88 KB

Version

2

Bits

0bc34a64

Nonce

1,028,819,753

Timestamp

5/4/2018, 3:41:01 AM

Confirmations

4,183,897

Merkle Root

de7ed87eaed93f0fb286a11036c5370a5d1d7a632bac253434124c8cab5c76fe
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.334 × 10⁹⁴(95-digit number)
33341663539656430853…60673280782703672001
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.334 × 10⁹⁴(95-digit number)
33341663539656430853…60673280782703672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.668 × 10⁹⁴(95-digit number)
66683327079312861706…21346561565407344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.333 × 10⁹⁵(96-digit number)
13336665415862572341…42693123130814688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.667 × 10⁹⁵(96-digit number)
26673330831725144682…85386246261629376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.334 × 10⁹⁵(96-digit number)
53346661663450289365…70772492523258752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.066 × 10⁹⁶(97-digit number)
10669332332690057873…41544985046517504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.133 × 10⁹⁶(97-digit number)
21338664665380115746…83089970093035008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.267 × 10⁹⁶(97-digit number)
42677329330760231492…66179940186070016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.535 × 10⁹⁶(97-digit number)
85354658661520462984…32359880372140032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.707 × 10⁹⁷(98-digit number)
17070931732304092596…64719760744280064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.414 × 10⁹⁷(98-digit number)
34141863464608185193…29439521488560128001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,897,911 XPM·at block #6,831,725 · 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