Block #374,765

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/25/2014, 6:46:41 AM · Difficulty 10.4195 · 6,434,938 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e1fd1ab00bc64f88a40a7412bf09b6d1449947072e99ee5722d1e77bd60cb57b

Height

#374,765

Difficulty

10.419533

Transactions

9

Size

3.36 KB

Version

2

Bits

0a6b668a

Nonce

42,487

Timestamp

1/25/2014, 6:46:41 AM

Confirmations

6,434,938

Merkle Root

143d2f53d57bc759c264a9028ec2d159b204e7e06ee1db37195f07f964126a7c
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.

5.583 × 10⁹⁸(99-digit number)
55835047234941999164…20967194782904792881
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
5.583 × 10⁹⁸(99-digit number)
55835047234941999164…20967194782904792881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.116 × 10⁹⁹(100-digit number)
11167009446988399832…41934389565809585761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.233 × 10⁹⁹(100-digit number)
22334018893976799665…83868779131619171521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.466 × 10⁹⁹(100-digit number)
44668037787953599331…67737558263238343041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.933 × 10⁹⁹(100-digit number)
89336075575907198663…35475116526476686081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.786 × 10¹⁰⁰(101-digit number)
17867215115181439732…70950233052953372161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.573 × 10¹⁰⁰(101-digit number)
35734430230362879465…41900466105906744321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.146 × 10¹⁰⁰(101-digit number)
71468860460725758930…83800932211813488641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.429 × 10¹⁰¹(102-digit number)
14293772092145151786…67601864423626977281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.858 × 10¹⁰¹(102-digit number)
28587544184290303572…35203728847253954561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.717 × 10¹⁰¹(102-digit number)
57175088368580607144…70407457694507909121
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,721,702 XPM·at block #6,809,702 · 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.

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