Block #1,656,131

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/1/2016, 2:16:46 PM · Difficulty 10.7967 · 5,174,921 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
447e51f319033a799c7a9964f148d250ef0d87c44e5db829632a2e7a2cbbecf7

Height

#1,656,131

Difficulty

10.796704

Transactions

2

Size

3.59 KB

Version

2

Bits

0acbf4cd

Nonce

399,238,848

Timestamp

7/1/2016, 2:16:46 PM

Confirmations

5,174,921

Merkle Root

9d3ef728d3bb2c33db01e2428a23499331a3395bb63976608c3294bf2dce6ad6
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.527 × 10⁹⁶(97-digit number)
35273948081260997005…55954991314614553599
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.527 × 10⁹⁶(97-digit number)
35273948081260997005…55954991314614553599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.054 × 10⁹⁶(97-digit number)
70547896162521994010…11909982629229107199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.410 × 10⁹⁷(98-digit number)
14109579232504398802…23819965258458214399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.821 × 10⁹⁷(98-digit number)
28219158465008797604…47639930516916428799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.643 × 10⁹⁷(98-digit number)
56438316930017595208…95279861033832857599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.128 × 10⁹⁸(99-digit number)
11287663386003519041…90559722067665715199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.257 × 10⁹⁸(99-digit number)
22575326772007038083…81119444135331430399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.515 × 10⁹⁸(99-digit number)
45150653544014076166…62238888270662860799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.030 × 10⁹⁸(99-digit number)
90301307088028152333…24477776541325721599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.806 × 10⁹⁹(100-digit number)
18060261417605630466…48955553082651443199
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,892,553 XPM·at block #6,831,051 · 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