Block #630,777

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/13/2014, 4:35:28 AM · Difficulty 10.9616 · 6,202,557 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
79db2babbeb778720e64ab0b7aed9417e0e29e975e0811e15b8808d71ede5500

Height

#630,777

Difficulty

10.961571

Transactions

4

Size

1.47 KB

Version

2

Bits

0af6297c

Nonce

246,240,227

Timestamp

7/13/2014, 4:35:28 AM

Confirmations

6,202,557

Merkle Root

22b643a719dfb827fc2324a5a93023002a02e69b2bbcb1b33013da8acfde9f00
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.

2.097 × 10⁹⁶(97-digit number)
20972023347248489428…48921891315475732481
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
2.097 × 10⁹⁶(97-digit number)
20972023347248489428…48921891315475732481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.194 × 10⁹⁶(97-digit number)
41944046694496978856…97843782630951464961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.388 × 10⁹⁶(97-digit number)
83888093388993957712…95687565261902929921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.677 × 10⁹⁷(98-digit number)
16777618677798791542…91375130523805859841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.355 × 10⁹⁷(98-digit number)
33555237355597583085…82750261047611719681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.711 × 10⁹⁷(98-digit number)
67110474711195166170…65500522095223439361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.342 × 10⁹⁸(99-digit number)
13422094942239033234…31001044190446878721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.684 × 10⁹⁸(99-digit number)
26844189884478066468…62002088380893757441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.368 × 10⁹⁸(99-digit number)
53688379768956132936…24004176761787514881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.073 × 10⁹⁹(100-digit number)
10737675953791226587…48008353523575029761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.147 × 10⁹⁹(100-digit number)
21475351907582453174…96016707047150059521
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,910,867 XPM·at block #6,833,333 · 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