Block #624,535

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/9/2014, 2:54:00 AM · Difficulty 10.9584 · 6,189,663 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f85af8f75448bb9beaeb15c4735aa93cc432fb3705623b711c6551050b06a79b

Height

#624,535

Difficulty

10.958358

Transactions

6

Size

4.05 KB

Version

2

Bits

0af556ed

Nonce

70,438,524

Timestamp

7/9/2014, 2:54:00 AM

Confirmations

6,189,663

Merkle Root

b3aa252d1d0ffcd56cccb775e63d7f93227077ab65875b58493fc2961596079f
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.536 × 10⁹⁷(98-digit number)
15369931277047109055…75869056057763831839
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.536 × 10⁹⁷(98-digit number)
15369931277047109055…75869056057763831839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.073 × 10⁹⁷(98-digit number)
30739862554094218110…51738112115527663679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.147 × 10⁹⁷(98-digit number)
61479725108188436220…03476224231055327359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.229 × 10⁹⁸(99-digit number)
12295945021637687244…06952448462110654719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.459 × 10⁹⁸(99-digit number)
24591890043275374488…13904896924221309439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.918 × 10⁹⁸(99-digit number)
49183780086550748976…27809793848442618879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.836 × 10⁹⁸(99-digit number)
98367560173101497952…55619587696885237759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.967 × 10⁹⁹(100-digit number)
19673512034620299590…11239175393770475519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.934 × 10⁹⁹(100-digit number)
39347024069240599180…22478350787540951039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.869 × 10⁹⁹(100-digit number)
78694048138481198361…44956701575081902079
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,757,659 XPM·at block #6,814,197 · 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