Block #429,772

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/5/2014, 1:14:17 AM · Difficulty 10.3420 · 6,376,846 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
44e9d346caafdf1a2b19fab6a82abd5b0118c599b6c2be7e9f0e6b2b07903102

Height

#429,772

Difficulty

10.341961

Transactions

5

Size

1.63 KB

Version

2

Bits

0a578abc

Nonce

101,832

Timestamp

3/5/2014, 1:14:17 AM

Confirmations

6,376,846

Merkle Root

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

6.938 × 10¹⁰⁰(101-digit number)
69380841477734403424…87613186341698078719
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
6.938 × 10¹⁰⁰(101-digit number)
69380841477734403424…87613186341698078719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.387 × 10¹⁰¹(102-digit number)
13876168295546880684…75226372683396157439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.775 × 10¹⁰¹(102-digit number)
27752336591093761369…50452745366792314879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.550 × 10¹⁰¹(102-digit number)
55504673182187522739…00905490733584629759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.110 × 10¹⁰²(103-digit number)
11100934636437504547…01810981467169259519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.220 × 10¹⁰²(103-digit number)
22201869272875009095…03621962934338519039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.440 × 10¹⁰²(103-digit number)
44403738545750018191…07243925868677038079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.880 × 10¹⁰²(103-digit number)
88807477091500036383…14487851737354076159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.776 × 10¹⁰³(104-digit number)
17761495418300007276…28975703474708152319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.552 × 10¹⁰³(104-digit number)
35522990836600014553…57951406949416304639
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,697,044 XPM·at block #6,806,617 · 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