Block #423,236

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/28/2014, 8:16:25 AM · Difficulty 10.3689 · 6,385,529 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a1a13059812aaf72d5893042a37610e53270efa3108e1637a4d2c36b8dc39985

Height

#423,236

Difficulty

10.368926

Transactions

2

Size

1.24 KB

Version

2

Bits

0a5e71f0

Nonce

237

Timestamp

2/28/2014, 8:16:25 AM

Confirmations

6,385,529

Merkle Root

52a0328ee72cc81947ef19d4250c33aa902186f3373566d033eceda8cba321bc
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.

9.628 × 10¹⁰⁰(101-digit number)
96281487033676204105…34473417370877265919
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
9.628 × 10¹⁰⁰(101-digit number)
96281487033676204105…34473417370877265919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.925 × 10¹⁰¹(102-digit number)
19256297406735240821…68946834741754531839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.851 × 10¹⁰¹(102-digit number)
38512594813470481642…37893669483509063679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.702 × 10¹⁰¹(102-digit number)
77025189626940963284…75787338967018127359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.540 × 10¹⁰²(103-digit number)
15405037925388192656…51574677934036254719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.081 × 10¹⁰²(103-digit number)
30810075850776385313…03149355868072509439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.162 × 10¹⁰²(103-digit number)
61620151701552770627…06298711736145018879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.232 × 10¹⁰³(104-digit number)
12324030340310554125…12597423472290037759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.464 × 10¹⁰³(104-digit number)
24648060680621108250…25194846944580075519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.929 × 10¹⁰³(104-digit number)
49296121361242216501…50389693889160151039
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,714,168 XPM·at block #6,808,764 · 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