Block #635,362

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/16/2014, 4:05:27 AM · Difficulty 10.9639 · 6,174,489 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
84f707d3a0a2810fd087836f64d1a501705661378a6dfcf31078bd04174297c2

Height

#635,362

Difficulty

10.963896

Transactions

10

Size

2.73 KB

Version

2

Bits

0af6c1e2

Nonce

118,334,077

Timestamp

7/16/2014, 4:05:27 AM

Confirmations

6,174,489

Merkle Root

2b039167d30f65b05034f5f2d024da94a1b113c2a8b3ce7c23ac20f5601ae7e5
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.069 × 10⁹⁷(98-digit number)
10695157109166093503…92442570265545605121
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.069 × 10⁹⁷(98-digit number)
10695157109166093503…92442570265545605121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.139 × 10⁹⁷(98-digit number)
21390314218332187006…84885140531091210241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.278 × 10⁹⁷(98-digit number)
42780628436664374013…69770281062182420481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.556 × 10⁹⁷(98-digit number)
85561256873328748027…39540562124364840961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.711 × 10⁹⁸(99-digit number)
17112251374665749605…79081124248729681921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.422 × 10⁹⁸(99-digit number)
34224502749331499211…58162248497459363841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.844 × 10⁹⁸(99-digit number)
68449005498662998422…16324496994918727681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.368 × 10⁹⁹(100-digit number)
13689801099732599684…32648993989837455361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.737 × 10⁹⁹(100-digit number)
27379602199465199368…65297987979674910721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.475 × 10⁹⁹(100-digit number)
54759204398930398737…30595975959349821441
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

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

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,722,895 XPM·at block #6,809,850 · 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