Block #678,641

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/15/2014, 8:49:20 AM · Difficulty 10.9637 · 6,137,974 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d43d8e33e32702af7904ff71c551e0582bca43e26f52f21e947ac55b9bb24b1d

Height

#678,641

Difficulty

10.963656

Transactions

6

Size

1.31 KB

Version

2

Bits

0af6b231

Nonce

374,885,884

Timestamp

8/15/2014, 8:49:20 AM

Confirmations

6,137,974

Merkle Root

6a0a72d46dbaff8400be61bac79ab38a1b993a734d34cd477c65ebdcffda3fe7
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.783 × 10⁹⁶(97-digit number)
17835646916704791180…67659571464318668239
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.783 × 10⁹⁶(97-digit number)
17835646916704791180…67659571464318668239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.567 × 10⁹⁶(97-digit number)
35671293833409582360…35319142928637336479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.134 × 10⁹⁶(97-digit number)
71342587666819164720…70638285857274672959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.426 × 10⁹⁷(98-digit number)
14268517533363832944…41276571714549345919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.853 × 10⁹⁷(98-digit number)
28537035066727665888…82553143429098691839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.707 × 10⁹⁷(98-digit number)
57074070133455331776…65106286858197383679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.141 × 10⁹⁸(99-digit number)
11414814026691066355…30212573716394767359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.282 × 10⁹⁸(99-digit number)
22829628053382132710…60425147432789534719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.565 × 10⁹⁸(99-digit number)
45659256106764265420…20850294865579069439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.131 × 10⁹⁸(99-digit number)
91318512213528530841…41700589731158138879
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,777,042 XPM·at block #6,816,614 · 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