Block #2,947,562

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/1/2018, 4:32:08 PM · Difficulty 11.3943 · 3,894,512 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d48c75a34113c133f47dd111fb9316faa22d330ec85825501a54b10804f48f6c

Height

#2,947,562

Difficulty

11.394257

Transactions

2

Size

573 B

Version

2

Bits

0b64ee0a

Nonce

99,811,593

Timestamp

12/1/2018, 4:32:08 PM

Confirmations

3,894,512

Merkle Root

2282c9b5e18c3a278921d1848754491b6e2de494b9043101f2089491f3982559
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.

1.631 × 10⁹⁴(95-digit number)
16316495192763924843…45974651848106351359
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.631 × 10⁹⁴(95-digit number)
16316495192763924843…45974651848106351359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.263 × 10⁹⁴(95-digit number)
32632990385527849686…91949303696212702719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.526 × 10⁹⁴(95-digit number)
65265980771055699372…83898607392425405439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.305 × 10⁹⁵(96-digit number)
13053196154211139874…67797214784850810879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.610 × 10⁹⁵(96-digit number)
26106392308422279748…35594429569701621759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.221 × 10⁹⁵(96-digit number)
52212784616844559497…71188859139403243519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.044 × 10⁹⁶(97-digit number)
10442556923368911899…42377718278806487039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.088 × 10⁹⁶(97-digit number)
20885113846737823799…84755436557612974079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.177 × 10⁹⁶(97-digit number)
41770227693475647598…69510873115225948159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.354 × 10⁹⁶(97-digit number)
83540455386951295196…39021746230451896319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.670 × 10⁹⁷(98-digit number)
16708091077390259039…78043492460903792639
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,980,977 XPM·at block #6,842,073 · 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