Block #439,155

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/11/2014, 11:57:44 AM · Difficulty 10.3597 · 6,370,631 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
45816267d1df9e2545566b2487ef5b7bfb0ff92c0e7567a82c6a03ecaf1af64b

Height

#439,155

Difficulty

10.359674

Transactions

2

Size

722 B

Version

2

Bits

0a5c1396

Nonce

21,107,621

Timestamp

3/11/2014, 11:57:44 AM

Confirmations

6,370,631

Merkle Root

bd71a8d13f2f00cc97afc54f6678a20f55584c4860e336d1ae0f3195e1ae8fa5
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.

5.785 × 10⁹⁵(96-digit number)
57850389315096854237…82286209858868057919
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
5.785 × 10⁹⁵(96-digit number)
57850389315096854237…82286209858868057919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.157 × 10⁹⁶(97-digit number)
11570077863019370847…64572419717736115839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.314 × 10⁹⁶(97-digit number)
23140155726038741695…29144839435472231679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.628 × 10⁹⁶(97-digit number)
46280311452077483390…58289678870944463359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.256 × 10⁹⁶(97-digit number)
92560622904154966780…16579357741888926719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.851 × 10⁹⁷(98-digit number)
18512124580830993356…33158715483777853439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.702 × 10⁹⁷(98-digit number)
37024249161661986712…66317430967555706879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.404 × 10⁹⁷(98-digit number)
74048498323323973424…32634861935111413759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.480 × 10⁹⁸(99-digit number)
14809699664664794684…65269723870222827519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.961 × 10⁹⁸(99-digit number)
29619399329329589369…30539447740445655039
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,722,368 XPM·at block #6,809,785 · 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