Block #436,031

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/9/2014, 8:19:04 AM · Difficulty 10.3548 · 6,381,998 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
71fd2e12a05c674b853742352fcb275ebfb90d21e0d4503a85faabbf65233139

Height

#436,031

Difficulty

10.354799

Transactions

2

Size

460 B

Version

2

Bits

0a5ad415

Nonce

19,935

Timestamp

3/9/2014, 8:19:04 AM

Confirmations

6,381,998

Merkle Root

51d152a7421e007f45b52ed722f65da07618d189393f8793af7da412dffc7303
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.

3.551 × 10⁹⁴(95-digit number)
35511424546995674421…77760946724895316479
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.551 × 10⁹⁴(95-digit number)
35511424546995674421…77760946724895316479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.102 × 10⁹⁴(95-digit number)
71022849093991348843…55521893449790632959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.420 × 10⁹⁵(96-digit number)
14204569818798269768…11043786899581265919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.840 × 10⁹⁵(96-digit number)
28409139637596539537…22087573799162531839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.681 × 10⁹⁵(96-digit number)
56818279275193079074…44175147598325063679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.136 × 10⁹⁶(97-digit number)
11363655855038615814…88350295196650127359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.272 × 10⁹⁶(97-digit number)
22727311710077231629…76700590393300254719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.545 × 10⁹⁶(97-digit number)
45454623420154463259…53401180786600509439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.090 × 10⁹⁶(97-digit number)
90909246840308926519…06802361573201018879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.818 × 10⁹⁷(98-digit number)
18181849368061785303…13604723146402037759
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,788,300 XPM·at block #6,818,028 · 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