Block #434,733

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/8/2014, 11:09:44 AM · Difficulty 10.3504 · 6,375,492 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3f5b9be9685ff486a995f9af45008e3752b6fc58c8f5f14a2f9f44522a0391f1

Height

#434,733

Difficulty

10.350384

Transactions

1

Size

971 B

Version

2

Bits

0a59b2bf

Nonce

141,188

Timestamp

3/8/2014, 11:09:44 AM

Confirmations

6,375,492

Merkle Root

1422dcd21ec63075be1a617dbe2dbedec0ecce9cea64fdfdd43c3c079f70a34b
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.688 × 10⁹⁹(100-digit number)
56883843061432659681…18969279851450193919
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.688 × 10⁹⁹(100-digit number)
56883843061432659681…18969279851450193919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.137 × 10¹⁰⁰(101-digit number)
11376768612286531936…37938559702900387839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.275 × 10¹⁰⁰(101-digit number)
22753537224573063872…75877119405800775679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.550 × 10¹⁰⁰(101-digit number)
45507074449146127745…51754238811601551359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.101 × 10¹⁰⁰(101-digit number)
91014148898292255490…03508477623203102719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.820 × 10¹⁰¹(102-digit number)
18202829779658451098…07016955246406205439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.640 × 10¹⁰¹(102-digit number)
36405659559316902196…14033910492812410879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.281 × 10¹⁰¹(102-digit number)
72811319118633804392…28067820985624821759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.456 × 10¹⁰²(103-digit number)
14562263823726760878…56135641971249643519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.912 × 10¹⁰²(103-digit number)
29124527647453521757…12271283942499287039
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,725,876 XPM·at block #6,810,224 · 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