Block #2,291,993

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/11/2017, 11:24:32 AM · Difficulty 10.9550 · 4,540,566 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ea4df2d5239f3a849fd7cb027b224b71e69751ffd20bef2e3031515d9935c71d

Height

#2,291,993

Difficulty

10.955049

Transactions

2

Size

427 B

Version

2

Bits

0af47e17

Nonce

647,531,931

Timestamp

9/11/2017, 11:24:32 AM

Confirmations

4,540,566

Merkle Root

9977492b3872972ae92f2537df66e42ed8d1e145498573250e8c15578eedddd8
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.394 × 10⁹⁶(97-digit number)
13945986163656815328…04808497009316590079
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.394 × 10⁹⁶(97-digit number)
13945986163656815328…04808497009316590079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.789 × 10⁹⁶(97-digit number)
27891972327313630656…09616994018633180159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.578 × 10⁹⁶(97-digit number)
55783944654627261312…19233988037266360319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.115 × 10⁹⁷(98-digit number)
11156788930925452262…38467976074532720639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.231 × 10⁹⁷(98-digit number)
22313577861850904524…76935952149065441279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.462 × 10⁹⁷(98-digit number)
44627155723701809049…53871904298130882559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.925 × 10⁹⁷(98-digit number)
89254311447403618099…07743808596261765119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.785 × 10⁹⁸(99-digit number)
17850862289480723619…15487617192523530239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.570 × 10⁹⁸(99-digit number)
35701724578961447239…30975234385047060479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.140 × 10⁹⁸(99-digit number)
71403449157922894479…61950468770094120959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.428 × 10⁹⁹(100-digit number)
14280689831584578895…23900937540188241919
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,904,629 XPM·at block #6,832,558 · 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