Block #435,045

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/8/2014, 3:40:04 PM · Difficulty 10.3557 · 6,371,260 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f26b6b7598b85e50db15a8c4ecf5bea3e92f7869b3ea0a186c70a0811dc3fb13

Height

#435,045

Difficulty

10.355729

Transactions

1

Size

939 B

Version

2

Bits

0a5b1113

Nonce

84,990

Timestamp

3/8/2014, 3:40:04 PM

Confirmations

6,371,260

Merkle Root

8d43a70026271bf503183c628c91c57052f5ec01f858da7ecdc405db1c46363c
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.160 × 10¹⁰³(104-digit number)
11600353030593416776…38763172720981048239
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.160 × 10¹⁰³(104-digit number)
11600353030593416776…38763172720981048239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.320 × 10¹⁰³(104-digit number)
23200706061186833553…77526345441962096479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.640 × 10¹⁰³(104-digit number)
46401412122373667107…55052690883924192959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.280 × 10¹⁰³(104-digit number)
92802824244747334214…10105381767848385919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.856 × 10¹⁰⁴(105-digit number)
18560564848949466842…20210763535696771839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.712 × 10¹⁰⁴(105-digit number)
37121129697898933685…40421527071393543679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.424 × 10¹⁰⁴(105-digit number)
74242259395797867371…80843054142787087359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.484 × 10¹⁰⁵(106-digit number)
14848451879159573474…61686108285574174719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.969 × 10¹⁰⁵(106-digit number)
29696903758319146948…23372216571148349439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.939 × 10¹⁰⁵(106-digit number)
59393807516638293897…46744433142296698879
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,694,529 XPM·at block #6,806,304 · 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