Block #927,108

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/8/2015, 1:35:16 AM · Difficulty 10.9070 · 5,889,567 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f175bdbec18c9fe115f8c5fca32f3e97661e57af46d34326a44fd76a4ecfeee9

Height

#927,108

Difficulty

10.907025

Transactions

7

Size

4.85 KB

Version

2

Bits

0ae832ca

Nonce

168,613,241

Timestamp

2/8/2015, 1:35:16 AM

Confirmations

5,889,567

Merkle Root

aa4976377af39207cdb740ce31106403489e35d1ad4193737adfcfae84bdb6f4
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.994 × 10⁹⁶(97-digit number)
19944137570247807715…01855638107900768479
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.994 × 10⁹⁶(97-digit number)
19944137570247807715…01855638107900768479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.988 × 10⁹⁶(97-digit number)
39888275140495615431…03711276215801536959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.977 × 10⁹⁶(97-digit number)
79776550280991230863…07422552431603073919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.595 × 10⁹⁷(98-digit number)
15955310056198246172…14845104863206147839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.191 × 10⁹⁷(98-digit number)
31910620112396492345…29690209726412295679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.382 × 10⁹⁷(98-digit number)
63821240224792984690…59380419452824591359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.276 × 10⁹⁸(99-digit number)
12764248044958596938…18760838905649182719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.552 × 10⁹⁸(99-digit number)
25528496089917193876…37521677811298365439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.105 × 10⁹⁸(99-digit number)
51056992179834387752…75043355622596730879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.021 × 10⁹⁹(100-digit number)
10211398435966877550…50086711245193461759
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,777,519 XPM·at block #6,816,674 · 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