Block #676,665

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/13/2014, 8:08:20 PM · Difficulty 10.9652 · 6,132,657 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1f349c6ebf013e30be8b73dde75d9e04bf6a5f35e2f7f4c524d53ccd6bf908fa

Height

#676,665

Difficulty

10.965164

Transactions

9

Size

2.11 KB

Version

2

Bits

0af71502

Nonce

1,025,407,778

Timestamp

8/13/2014, 8:08:20 PM

Confirmations

6,132,657

Merkle Root

47e2dc709c0436ed2e56df5edfa7267b5c17230a0004a68ff42831994a7f4a9c
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.

3.583 × 10⁹⁵(96-digit number)
35839696697889389987…94975753106413156661
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
3.583 × 10⁹⁵(96-digit number)
35839696697889389987…94975753106413156661
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.167 × 10⁹⁵(96-digit number)
71679393395778779975…89951506212826313321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.433 × 10⁹⁶(97-digit number)
14335878679155755995…79903012425652626641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.867 × 10⁹⁶(97-digit number)
28671757358311511990…59806024851305253281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.734 × 10⁹⁶(97-digit number)
57343514716623023980…19612049702610506561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.146 × 10⁹⁷(98-digit number)
11468702943324604796…39224099405221013121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.293 × 10⁹⁷(98-digit number)
22937405886649209592…78448198810442026241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.587 × 10⁹⁷(98-digit number)
45874811773298419184…56896397620884052481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.174 × 10⁹⁷(98-digit number)
91749623546596838369…13792795241768104961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.834 × 10⁹⁸(99-digit number)
18349924709319367673…27585590483536209921
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,718,643 XPM·at block #6,809,321 · 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