Block #434,742

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/8/2014, 11:18:22 AM · Difficulty 10.3508 · 6,374,157 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
03c0dd2bee07795ab8d325b06470dec5b731b592f243a3c58fac53d4b95283e6

Height

#434,742

Difficulty

10.350819

Transactions

3

Size

1.19 KB

Version

2

Bits

0a59cf3f

Nonce

24,963

Timestamp

3/8/2014, 11:18:22 AM

Confirmations

6,374,157

Merkle Root

e5e4f763e9f739861cceb72f2a0a4fa2615d42515edd678af9598ea01a15bab4
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.868 × 10⁹⁸(99-digit number)
38688559228918607757…01464433241655555439
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.868 × 10⁹⁸(99-digit number)
38688559228918607757…01464433241655555439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.737 × 10⁹⁸(99-digit number)
77377118457837215514…02928866483311110879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.547 × 10⁹⁹(100-digit number)
15475423691567443102…05857732966622221759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.095 × 10⁹⁹(100-digit number)
30950847383134886205…11715465933244443519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.190 × 10⁹⁹(100-digit number)
61901694766269772411…23430931866488887039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.238 × 10¹⁰⁰(101-digit number)
12380338953253954482…46861863732977774079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.476 × 10¹⁰⁰(101-digit number)
24760677906507908964…93723727465955548159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.952 × 10¹⁰⁰(101-digit number)
49521355813015817929…87447454931911096319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.904 × 10¹⁰⁰(101-digit number)
99042711626031635858…74894909863822192639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.980 × 10¹⁰¹(102-digit number)
19808542325206327171…49789819727644385279
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,715,245 XPM·at block #6,808,898 · 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