Block #472,657

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/3/2014, 10:17:51 AM · Difficulty 10.4368 · 6,336,686 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
650ba7f03978dddf417de669ddd9fc1cb775b6a4f0feb83f264d301aa16eb443

Height

#472,657

Difficulty

10.436813

Transactions

10

Size

3.16 KB

Version

2

Bits

0a6fd2fa

Nonce

1,033,052,713

Timestamp

4/3/2014, 10:17:51 AM

Confirmations

6,336,686

Merkle Root

8f53745edd73a0e9062767f902dc42cd654c7cf675edc2e86fa750b44f39a5a7
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.287 × 10⁹⁴(95-digit number)
12879957807892262829…53367325063581575079
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.287 × 10⁹⁴(95-digit number)
12879957807892262829…53367325063581575079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.575 × 10⁹⁴(95-digit number)
25759915615784525658…06734650127163150159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.151 × 10⁹⁴(95-digit number)
51519831231569051316…13469300254326300319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.030 × 10⁹⁵(96-digit number)
10303966246313810263…26938600508652600639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.060 × 10⁹⁵(96-digit number)
20607932492627620526…53877201017305201279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.121 × 10⁹⁵(96-digit number)
41215864985255241053…07754402034610402559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.243 × 10⁹⁵(96-digit number)
82431729970510482106…15508804069220805119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.648 × 10⁹⁶(97-digit number)
16486345994102096421…31017608138441610239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.297 × 10⁹⁶(97-digit number)
32972691988204192842…62035216276883220479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.594 × 10⁹⁶(97-digit number)
65945383976408385685…24070432553766440959
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,718,810 XPM·at block #6,809,342 · 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