Block #252,170

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/9/2013, 10:18:38 AM · Difficulty 9.9709 · 6,573,515 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
96ddf35f50888e57f870f9f46771bcc6b1cf112b31e715488f47ec2f35b498c8

Height

#252,170

Difficulty

9.970861

Transactions

2

Size

601 B

Version

2

Bits

09f88a5e

Nonce

5,794

Timestamp

11/9/2013, 10:18:38 AM

Confirmations

6,573,515

Merkle Root

f7b26ba34538c787d1555d3383691ba9ab5c83d0ab7d6c39d462e2d684f8025b
Transactions (2)
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.

3.572 × 10⁹⁴(95-digit number)
35728978822533292147…27164178697686043909
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
3.572 × 10⁹⁴(95-digit number)
35728978822533292147…27164178697686043909
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.145 × 10⁹⁴(95-digit number)
71457957645066584295…54328357395372087819
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.429 × 10⁹⁵(96-digit number)
14291591529013316859…08656714790744175639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.858 × 10⁹⁵(96-digit number)
28583183058026633718…17313429581488351279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.716 × 10⁹⁵(96-digit number)
57166366116053267436…34626859162976702559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.143 × 10⁹⁶(97-digit number)
11433273223210653487…69253718325953405119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.286 × 10⁹⁶(97-digit number)
22866546446421306974…38507436651906810239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.573 × 10⁹⁶(97-digit number)
45733092892842613949…77014873303813620479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.146 × 10⁹⁶(97-digit number)
91466185785685227898…54029746607627240959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.829 × 10⁹⁷(98-digit number)
18293237157137045579…08059493215254481919
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,849,590 XPM·at block #6,825,684 · 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.
Privacy Policy·

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