Block #776,604

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/20/2014, 10:05:50 AM · Difficulty 10.9813 · 6,039,377 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2625ea66d0074723c3d377e7554f4425bb24874a836f6346d7fb497164c6d386

Height

#776,604

Difficulty

10.981282

Transactions

4

Size

1.87 KB

Version

2

Bits

0afb354f

Nonce

448,303,113

Timestamp

10/20/2014, 10:05:50 AM

Confirmations

6,039,377

Merkle Root

2f45e446866c368f3f95870e0f98a0eb940daf0e2e83f84f009a1c0cf1915355
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.684 × 10⁹⁷(98-digit number)
16849833294315866152…81251695137853258301
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.684 × 10⁹⁷(98-digit number)
16849833294315866152…81251695137853258301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.369 × 10⁹⁷(98-digit number)
33699666588631732305…62503390275706516601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.739 × 10⁹⁷(98-digit number)
67399333177263464610…25006780551413033201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.347 × 10⁹⁸(99-digit number)
13479866635452692922…50013561102826066401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.695 × 10⁹⁸(99-digit number)
26959733270905385844…00027122205652132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.391 × 10⁹⁸(99-digit number)
53919466541810771688…00054244411304265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.078 × 10⁹⁹(100-digit number)
10783893308362154337…00108488822608531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.156 × 10⁹⁹(100-digit number)
21567786616724308675…00216977645217062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.313 × 10⁹⁹(100-digit number)
43135573233448617350…00433955290434124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.627 × 10⁹⁹(100-digit number)
86271146466897234701…00867910580868249601
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,771,961 XPM·at block #6,815,980 · 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