Block #636,167

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/16/2014, 5:36:25 PM · Difficulty 10.9639 · 6,195,985 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ef57ff904b5f083d1e67ac67223d673cf8a96ab000098b8c39075129c996871f

Height

#636,167

Difficulty

10.963886

Transactions

5

Size

1.55 KB

Version

2

Bits

0af6c135

Nonce

74,853,886

Timestamp

7/16/2014, 5:36:25 PM

Confirmations

6,195,985

Merkle Root

5a3d1a46b7e580d884d11787fa5ca6a85933114e5087c5c3555b02a92a8f6eb8
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.

7.014 × 10⁹⁴(95-digit number)
70140525950955072735…21956709112946087201
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
7.014 × 10⁹⁴(95-digit number)
70140525950955072735…21956709112946087201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.402 × 10⁹⁵(96-digit number)
14028105190191014547…43913418225892174401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.805 × 10⁹⁵(96-digit number)
28056210380382029094…87826836451784348801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.611 × 10⁹⁵(96-digit number)
56112420760764058188…75653672903568697601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.122 × 10⁹⁶(97-digit number)
11222484152152811637…51307345807137395201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.244 × 10⁹⁶(97-digit number)
22444968304305623275…02614691614274790401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.488 × 10⁹⁶(97-digit number)
44889936608611246550…05229383228549580801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.977 × 10⁹⁶(97-digit number)
89779873217222493101…10458766457099161601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.795 × 10⁹⁷(98-digit number)
17955974643444498620…20917532914198323201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.591 × 10⁹⁷(98-digit number)
35911949286888997240…41835065828396646401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.182 × 10⁹⁷(98-digit number)
71823898573777994481…83670131656793292801
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,901,354 XPM·at block #6,832,151 · 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