Block #2,792,850

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/13/2018, 11:29:06 PM · Difficulty 11.6787 · 4,025,111 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d98170e613c38fca096bea3906c9c79f5bd8e84585850026a10c43a3047b1e4e

Height

#2,792,850

Difficulty

11.678693

Transactions

3

Size

846 B

Version

2

Bits

0badbecb

Nonce

1,112,904,346

Timestamp

8/13/2018, 11:29:06 PM

Confirmations

4,025,111

Merkle Root

b837effd46194be2d6937e01690cd83b048dc8fd27266bc80106588501a07f48
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.

5.566 × 10⁹⁵(96-digit number)
55668972865944767895…98889041383376030719
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
5.566 × 10⁹⁵(96-digit number)
55668972865944767895…98889041383376030719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.113 × 10⁹⁶(97-digit number)
11133794573188953579…97778082766752061439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.226 × 10⁹⁶(97-digit number)
22267589146377907158…95556165533504122879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.453 × 10⁹⁶(97-digit number)
44535178292755814316…91112331067008245759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.907 × 10⁹⁶(97-digit number)
89070356585511628632…82224662134016491519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.781 × 10⁹⁷(98-digit number)
17814071317102325726…64449324268032983039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.562 × 10⁹⁷(98-digit number)
35628142634204651453…28898648536065966079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.125 × 10⁹⁷(98-digit number)
71256285268409302906…57797297072131932159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.425 × 10⁹⁸(99-digit number)
14251257053681860581…15594594144263864319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.850 × 10⁹⁸(99-digit number)
28502514107363721162…31189188288527728639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.700 × 10⁹⁸(99-digit number)
57005028214727442324…62378376577055457279
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,787,757 XPM·at block #6,817,960 · 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