Block #2,948,047

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/2/2018, 12:27:16 AM · Difficulty 11.3955 · 3,883,054 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cc55acf0edafd13eb1040f1c03a86f60d9e353e4fc0c6388a71142ba925b487f

Height

#2,948,047

Difficulty

11.395472

Transactions

27

Size

8.30 KB

Version

2

Bits

0b653daa

Nonce

984,565,769

Timestamp

12/2/2018, 12:27:16 AM

Confirmations

3,883,054

Merkle Root

4e762b7b3cee1c910b167c3426d0c63a8d662c5f69f9b3b9784e60d2a988e1fa
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.523 × 10⁹⁵(96-digit number)
15239148095127292607…03438277349252581119
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.523 × 10⁹⁵(96-digit number)
15239148095127292607…03438277349252581119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.047 × 10⁹⁵(96-digit number)
30478296190254585214…06876554698505162239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.095 × 10⁹⁵(96-digit number)
60956592380509170428…13753109397010324479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.219 × 10⁹⁶(97-digit number)
12191318476101834085…27506218794020648959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.438 × 10⁹⁶(97-digit number)
24382636952203668171…55012437588041297919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.876 × 10⁹⁶(97-digit number)
48765273904407336342…10024875176082595839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.753 × 10⁹⁶(97-digit number)
97530547808814672685…20049750352165191679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.950 × 10⁹⁷(98-digit number)
19506109561762934537…40099500704330383359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.901 × 10⁹⁷(98-digit number)
39012219123525869074…80199001408660766719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.802 × 10⁹⁷(98-digit number)
78024438247051738148…60398002817321533439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.560 × 10⁹⁸(99-digit number)
15604887649410347629…20796005634643066879
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,892,951 XPM·at block #6,831,100 · 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