Block #457,373

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/23/2014, 8:45:24 PM · Difficulty 10.4202 · 6,352,792 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3a7197d29ba5d0af46962e2c5d2ef48bf3d2aeea56491043ec900ed9f0472ef5

Height

#457,373

Difficulty

10.420195

Transactions

3

Size

1.23 KB

Version

2

Bits

0a6b91e4

Nonce

29,084

Timestamp

3/23/2014, 8:45:24 PM

Confirmations

6,352,792

Merkle Root

65af3746cbc91b39dd687385cb6b858bb2cae4200af0705a6d40f2f90abb4d49
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.471 × 10⁹⁸(99-digit number)
14716090931025508982…31489877428186303999
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.471 × 10⁹⁸(99-digit number)
14716090931025508982…31489877428186303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.943 × 10⁹⁸(99-digit number)
29432181862051017965…62979754856372607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.886 × 10⁹⁸(99-digit number)
58864363724102035931…25959509712745215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.177 × 10⁹⁹(100-digit number)
11772872744820407186…51919019425490431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.354 × 10⁹⁹(100-digit number)
23545745489640814372…03838038850980863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.709 × 10⁹⁹(100-digit number)
47091490979281628745…07676077701961727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.418 × 10⁹⁹(100-digit number)
94182981958563257490…15352155403923455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.883 × 10¹⁰⁰(101-digit number)
18836596391712651498…30704310807846911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.767 × 10¹⁰⁰(101-digit number)
37673192783425302996…61408621615693823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.534 × 10¹⁰⁰(101-digit number)
75346385566850605992…22817243231387647999
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,387 XPM·at block #6,810,164 · 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