Block #776,567

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/20/2014, 9:16:23 AM · Difficulty 10.9813 · 6,030,912 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
df6ce144127b03754ecc6a270fbffc2a2382ea153da6845ec6ffb73de6fea626

Height

#776,567

Difficulty

10.981326

Transactions

3

Size

659 B

Version

2

Bits

0afb3826

Nonce

517,294,271

Timestamp

10/20/2014, 9:16:23 AM

Confirmations

6,030,912

Merkle Root

15d81dc3702a4f11ca4fd2df35ff7878d9da6532135222d6609191c14a4a72b5
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.111 × 10⁹⁵(96-digit number)
21110126293352131382…57647867512298049441
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.111 × 10⁹⁵(96-digit number)
21110126293352131382…57647867512298049441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.222 × 10⁹⁵(96-digit number)
42220252586704262764…15295735024596098881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.444 × 10⁹⁵(96-digit number)
84440505173408525528…30591470049192197761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.688 × 10⁹⁶(97-digit number)
16888101034681705105…61182940098384395521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.377 × 10⁹⁶(97-digit number)
33776202069363410211…22365880196768791041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.755 × 10⁹⁶(97-digit number)
67552404138726820423…44731760393537582081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.351 × 10⁹⁷(98-digit number)
13510480827745364084…89463520787075164161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.702 × 10⁹⁷(98-digit number)
27020961655490728169…78927041574150328321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.404 × 10⁹⁷(98-digit number)
54041923310981456338…57854083148300656641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.080 × 10⁹⁸(99-digit number)
10808384662196291267…15708166296601313281
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,703,858 XPM·at block #6,807,478 · 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