Block #1,438,622

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/1/2016, 3:44:04 PM · Difficulty 10.7844 · 5,378,040 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f35f947c09fedf4bacefb54a6c76a57906e23f7df38b71dc839ef9bd625e96b8

Height

#1,438,622

Difficulty

10.784384

Transactions

6

Size

1.36 KB

Version

2

Bits

0ac8cd69

Nonce

40,425,827

Timestamp

2/1/2016, 3:44:04 PM

Confirmations

5,378,040

Merkle Root

43df29f2bcfe18a04b0c27c5cb59bbaa734af2c1b7f5eb91d9afeee291223761
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.

1.241 × 10⁹⁶(97-digit number)
12410148174339150941…06170072257640243199
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
1.241 × 10⁹⁶(97-digit number)
12410148174339150941…06170072257640243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.482 × 10⁹⁶(97-digit number)
24820296348678301883…12340144515280486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.964 × 10⁹⁶(97-digit number)
49640592697356603767…24680289030560972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.928 × 10⁹⁶(97-digit number)
99281185394713207535…49360578061121945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.985 × 10⁹⁷(98-digit number)
19856237078942641507…98721156122243891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.971 × 10⁹⁷(98-digit number)
39712474157885283014…97442312244487782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.942 × 10⁹⁷(98-digit number)
79424948315770566028…94884624488975564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.588 × 10⁹⁸(99-digit number)
15884989663154113205…89769248977951129599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.176 × 10⁹⁸(99-digit number)
31769979326308226411…79538497955902259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.353 × 10⁹⁸(99-digit number)
63539958652616452822…59076995911804518399
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,777,414 XPM·at block #6,816,661 · 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