Block #457,294

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/23/2014, 7:17:41 PM · Difficulty 10.4210 · 6,351,810 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
52cd1204e645d195aeb1f8648bd2ed0bddbe37cfc4e94cb687ed35142706afc0

Height

#457,294

Difficulty

10.420958

Transactions

4

Size

1.88 KB

Version

2

Bits

0a6bc3e2

Nonce

199,630

Timestamp

3/23/2014, 7:17:41 PM

Confirmations

6,351,810

Merkle Root

3fd16f0192d5bde5410a2d2e2d5f9ec3ac4818a4d777d3a844990a467ce3fcaa
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.

2.227 × 10¹⁰⁰(101-digit number)
22272560348507071308…50640882919501902079
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
2.227 × 10¹⁰⁰(101-digit number)
22272560348507071308…50640882919501902079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.454 × 10¹⁰⁰(101-digit number)
44545120697014142617…01281765839003804159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.909 × 10¹⁰⁰(101-digit number)
89090241394028285234…02563531678007608319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.781 × 10¹⁰¹(102-digit number)
17818048278805657046…05127063356015216639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.563 × 10¹⁰¹(102-digit number)
35636096557611314093…10254126712030433279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.127 × 10¹⁰¹(102-digit number)
71272193115222628187…20508253424060866559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.425 × 10¹⁰²(103-digit number)
14254438623044525637…41016506848121733119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.850 × 10¹⁰²(103-digit number)
28508877246089051274…82033013696243466239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.701 × 10¹⁰²(103-digit number)
57017754492178102549…64066027392486932479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.140 × 10¹⁰³(104-digit number)
11403550898435620509…28132054784973864959
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,716,887 XPM·at block #6,809,103 · 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