Block #673,959

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/11/2014, 10:24:48 PM · Difficulty 10.9653 · 6,137,046 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
154af2fa5631c90389a1f733af9900a243f349576b5964180c24c175c90ea1ed

Height

#673,959

Difficulty

10.965330

Transactions

2

Size

432 B

Version

2

Bits

0af71fdf

Nonce

463,912,104

Timestamp

8/11/2014, 10:24:48 PM

Confirmations

6,137,046

Merkle Root

87eedcd7db85ac2e4cb754211da643bfd3f0e750b4ef704df897e80a707bceee
Transactions (2)
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.

9.571 × 10⁹³(94-digit number)
95711428759398976062…68316936923128484619
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
9.571 × 10⁹³(94-digit number)
95711428759398976062…68316936923128484619
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.914 × 10⁹⁴(95-digit number)
19142285751879795212…36633873846256969239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.828 × 10⁹⁴(95-digit number)
38284571503759590424…73267747692513938479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.656 × 10⁹⁴(95-digit number)
76569143007519180849…46535495385027876959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.531 × 10⁹⁵(96-digit number)
15313828601503836169…93070990770055753919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.062 × 10⁹⁵(96-digit number)
30627657203007672339…86141981540111507839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.125 × 10⁹⁵(96-digit number)
61255314406015344679…72283963080223015679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.225 × 10⁹⁶(97-digit number)
12251062881203068935…44567926160446031359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.450 × 10⁹⁶(97-digit number)
24502125762406137871…89135852320892062719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.900 × 10⁹⁶(97-digit number)
49004251524812275743…78271704641784125439
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,732,144 XPM·at block #6,811,004 · 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