Block #2,241,966

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/8/2017, 4:32:08 AM · Difficulty 10.9471 · 4,572,333 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d27156d43854474ce62d3fb4a7dd1753ec94e1dd56680a82b00f4c508f23d571

Height

#2,241,966

Difficulty

10.947142

Transactions

3

Size

948 B

Version

2

Bits

0af277e0

Nonce

277,025,548

Timestamp

8/8/2017, 4:32:08 AM

Confirmations

4,572,333

Merkle Root

5de6d6384da78ce0bd518a28ea0133753b89124c6cb380be080bfc3a02eb0bb1
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.

8.291 × 10⁹⁴(95-digit number)
82919283565312238932…37991699314539459199
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
8.291 × 10⁹⁴(95-digit number)
82919283565312238932…37991699314539459199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.658 × 10⁹⁵(96-digit number)
16583856713062447786…75983398629078918399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.316 × 10⁹⁵(96-digit number)
33167713426124895573…51966797258157836799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.633 × 10⁹⁵(96-digit number)
66335426852249791146…03933594516315673599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.326 × 10⁹⁶(97-digit number)
13267085370449958229…07867189032631347199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.653 × 10⁹⁶(97-digit number)
26534170740899916458…15734378065262694399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.306 × 10⁹⁶(97-digit number)
53068341481799832916…31468756130525388799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.061 × 10⁹⁷(98-digit number)
10613668296359966583…62937512261050777599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.122 × 10⁹⁷(98-digit number)
21227336592719933166…25875024522101555199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.245 × 10⁹⁷(98-digit number)
42454673185439866333…51750049044203110399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.490 × 10⁹⁷(98-digit number)
84909346370879732666…03500098088406220799
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,758,456 XPM·at block #6,814,298 · 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