Block #395,319

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/8/2014, 3:32:09 PM · Difficulty 10.4109 · 6,412,598 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d45e5f7abd142313d2f9fe38d72d08c5376e5aa20f2074cc6474db4033d5110f

Height

#395,319

Difficulty

10.410931

Transactions

3

Size

2.95 KB

Version

2

Bits

0a6932ca

Nonce

64,457

Timestamp

2/8/2014, 3:32:09 PM

Confirmations

6,412,598

Merkle Root

d82f869b2bcf69db13e44fcee3383b87288b2c12405d5b93f2cd489e996df749
Transactions (3)
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.

8.206 × 10⁹⁴(95-digit number)
82063555758600770973…02916742014050966429
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
8.206 × 10⁹⁴(95-digit number)
82063555758600770973…02916742014050966429
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.641 × 10⁹⁵(96-digit number)
16412711151720154194…05833484028101932859
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.282 × 10⁹⁵(96-digit number)
32825422303440308389…11666968056203865719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.565 × 10⁹⁵(96-digit number)
65650844606880616779…23333936112407731439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.313 × 10⁹⁶(97-digit number)
13130168921376123355…46667872224815462879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.626 × 10⁹⁶(97-digit number)
26260337842752246711…93335744449630925759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.252 × 10⁹⁶(97-digit number)
52520675685504493423…86671488899261851519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.050 × 10⁹⁷(98-digit number)
10504135137100898684…73342977798523703039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.100 × 10⁹⁷(98-digit number)
21008270274201797369…46685955597047406079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.201 × 10⁹⁷(98-digit number)
42016540548403594738…93371911194094812159
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,707,371 XPM·at block #6,807,916 · 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