Block #2,939,844

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/26/2018, 10:50:12 AM · Difficulty 11.3726 · 3,897,836 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0ccb9213ff5c1ca8610c615ef64a1fd0947a9139b405ad573ccb4f1b8aca3a42

Height

#2,939,844

Difficulty

11.372581

Transactions

3

Size

2.23 KB

Version

2

Bits

0b5f6179

Nonce

1,995,917,576

Timestamp

11/26/2018, 10:50:12 AM

Confirmations

3,897,836

Merkle Root

19425b218ef0674c91211da9753b280d685867e2f2d6fe06831bda3f56746f4e
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.

1.066 × 10⁹⁴(95-digit number)
10663435904648913514…68172330096265318419
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.066 × 10⁹⁴(95-digit number)
10663435904648913514…68172330096265318419
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.132 × 10⁹⁴(95-digit number)
21326871809297827029…36344660192530636839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.265 × 10⁹⁴(95-digit number)
42653743618595654059…72689320385061273679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.530 × 10⁹⁴(95-digit number)
85307487237191308119…45378640770122547359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.706 × 10⁹⁵(96-digit number)
17061497447438261623…90757281540245094719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.412 × 10⁹⁵(96-digit number)
34122994894876523247…81514563080490189439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.824 × 10⁹⁵(96-digit number)
68245989789753046495…63029126160980378879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.364 × 10⁹⁶(97-digit number)
13649197957950609299…26058252321960757759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.729 × 10⁹⁶(97-digit number)
27298395915901218598…52116504643921515519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.459 × 10⁹⁶(97-digit number)
54596791831802437196…04233009287843031039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.091 × 10⁹⁷(98-digit number)
10919358366360487439…08466018575686062079
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,945,765 XPM·at block #6,837,679 · 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