Block #438,309

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2014, 9:49:43 PM · Difficulty 10.3598 · 6,379,165 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
539d40ea5815bba0ed30d3953f6044d51ba40cbc138da3a8e6f4961a634298d2

Height

#438,309

Difficulty

10.359811

Transactions

1

Size

1003 B

Version

2

Bits

0a5c1c8c

Nonce

150,877

Timestamp

3/10/2014, 9:49:43 PM

Confirmations

6,379,165

Merkle Root

fed0347c00f60283881a36bad8fcc0d969e7902d03883ecff198be21b397ae14
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.648 × 10⁹³(94-digit number)
36482832483223459582…63367953956040829839
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.648 × 10⁹³(94-digit number)
36482832483223459582…63367953956040829839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.296 × 10⁹³(94-digit number)
72965664966446919164…26735907912081659679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.459 × 10⁹⁴(95-digit number)
14593132993289383832…53471815824163319359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.918 × 10⁹⁴(95-digit number)
29186265986578767665…06943631648326638719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.837 × 10⁹⁴(95-digit number)
58372531973157535331…13887263296653277439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.167 × 10⁹⁵(96-digit number)
11674506394631507066…27774526593306554879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.334 × 10⁹⁵(96-digit number)
23349012789263014132…55549053186613109759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.669 × 10⁹⁵(96-digit number)
46698025578526028265…11098106373226219519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.339 × 10⁹⁵(96-digit number)
93396051157052056530…22196212746452439039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.867 × 10⁹⁶(97-digit number)
18679210231410411306…44392425492904878079
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,783,844 XPM·at block #6,817,473 · 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