Block #2,276,178

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/31/2017, 10:16:35 AM · Difficulty 10.9554 · 4,555,059 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5bcd7a8a03003f8ca21cc07af32614f2f602ee34dbdeaece5412763868419262

Height

#2,276,178

Difficulty

10.955381

Transactions

3

Size

650 B

Version

2

Bits

0af493dc

Nonce

19,730,607

Timestamp

8/31/2017, 10:16:35 AM

Confirmations

4,555,059

Merkle Root

86f813051f57c1b3aeac163c28c7beed490049661f93f781f06e893b057886e7
Transactions (3)
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.

6.732 × 10⁹³(94-digit number)
67327607199288429355…03913579357124686719
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
6.732 × 10⁹³(94-digit number)
67327607199288429355…03913579357124686719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.346 × 10⁹⁴(95-digit number)
13465521439857685871…07827158714249373439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.693 × 10⁹⁴(95-digit number)
26931042879715371742…15654317428498746879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.386 × 10⁹⁴(95-digit number)
53862085759430743484…31308634856997493759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.077 × 10⁹⁵(96-digit number)
10772417151886148696…62617269713994987519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.154 × 10⁹⁵(96-digit number)
21544834303772297393…25234539427989975039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.308 × 10⁹⁵(96-digit number)
43089668607544594787…50469078855979950079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.617 × 10⁹⁵(96-digit number)
86179337215089189574…00938157711959900159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.723 × 10⁹⁶(97-digit number)
17235867443017837914…01876315423919800319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.447 × 10⁹⁶(97-digit number)
34471734886035675829…03752630847839600639
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,894,045 XPM·at block #6,831,236 · 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