Block #637,729

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/17/2014, 11:31:11 PM · Difficulty 10.9622 · 6,177,086 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1641c7ce513e39301bcf0fc8ef6d7f93ae6f624568e5b55a7c77bbeef8091a9b

Height

#637,729

Difficulty

10.962238

Transactions

3

Size

954 B

Version

2

Bits

0af65541

Nonce

1,425,672,407

Timestamp

7/17/2014, 11:31:11 PM

Confirmations

6,177,086

Merkle Root

c58b000089f669683bd54e4fccff6413a230b7d35846ea53299cc4cbaaebc67f
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.

1.909 × 10⁹⁶(97-digit number)
19095878098915893363…57176177889502339201
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
1.909 × 10⁹⁶(97-digit number)
19095878098915893363…57176177889502339201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.819 × 10⁹⁶(97-digit number)
38191756197831786726…14352355779004678401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.638 × 10⁹⁶(97-digit number)
76383512395663573452…28704711558009356801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.527 × 10⁹⁷(98-digit number)
15276702479132714690…57409423116018713601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.055 × 10⁹⁷(98-digit number)
30553404958265429380…14818846232037427201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.110 × 10⁹⁷(98-digit number)
61106809916530858761…29637692464074854401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.222 × 10⁹⁸(99-digit number)
12221361983306171752…59275384928149708801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.444 × 10⁹⁸(99-digit number)
24442723966612343504…18550769856299417601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.888 × 10⁹⁸(99-digit number)
48885447933224687009…37101539712598835201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.777 × 10⁹⁸(99-digit number)
97770895866449374018…74203079425197670401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.955 × 10⁹⁹(100-digit number)
19554179173289874803…48406158850395340801
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,762,607 XPM·at block #6,814,814 · 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