Block #2,932,947

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/21/2018, 12:24:15 PM · Difficulty 11.3979 · 3,906,190 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a7fe6386f49044fd5049cbd97757b598aa56e0b989fc1eeb285a5b4c09771ef7

Height

#2,932,947

Difficulty

11.397902

Transactions

2

Size

4.32 KB

Version

2

Bits

0b65dce9

Nonce

224,439,590

Timestamp

11/21/2018, 12:24:15 PM

Confirmations

3,906,190

Merkle Root

d454b79d1eb811d47984d49038bb118044f7cc9b45e904f20542171f1d285263
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.617 × 10⁹⁵(96-digit number)
16179792813520900976…90598718628014594559
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.617 × 10⁹⁵(96-digit number)
16179792813520900976…90598718628014594559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.235 × 10⁹⁵(96-digit number)
32359585627041801952…81197437256029189119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.471 × 10⁹⁵(96-digit number)
64719171254083603905…62394874512058378239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.294 × 10⁹⁶(97-digit number)
12943834250816720781…24789749024116756479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.588 × 10⁹⁶(97-digit number)
25887668501633441562…49579498048233512959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.177 × 10⁹⁶(97-digit number)
51775337003266883124…99158996096467025919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.035 × 10⁹⁷(98-digit number)
10355067400653376624…98317992192934051839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.071 × 10⁹⁷(98-digit number)
20710134801306753249…96635984385868103679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.142 × 10⁹⁷(98-digit number)
41420269602613506499…93271968771736207359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.284 × 10⁹⁷(98-digit number)
82840539205227012999…86543937543472414719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.656 × 10⁹⁸(99-digit number)
16568107841045402599…73087875086944829439
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,957,374 XPM·at block #6,839,136 · 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