Block #1,041,971

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2015, 6:13:16 PM · Difficulty 10.7228 · 5,800,962 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
42d9c483d64918624e3190f54dc96bffc29bfea4a03be16de743d905cc2eb3f3

Height

#1,041,971

Difficulty

10.722799

Transactions

5

Size

2.09 KB

Version

2

Bits

0ab90960

Nonce

2,044,792,147

Timestamp

5/2/2015, 6:13:16 PM

Confirmations

5,800,962

Merkle Root

065f47f97b423e73bebce504dd31ed2db35a71a3f7d79eb787c286442e45cff1
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.

8.359 × 10⁹⁵(96-digit number)
83593114303366367661…57843397202514565119
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
8.359 × 10⁹⁵(96-digit number)
83593114303366367661…57843397202514565119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.671 × 10⁹⁶(97-digit number)
16718622860673273532…15686794405029130239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.343 × 10⁹⁶(97-digit number)
33437245721346547064…31373588810058260479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.687 × 10⁹⁶(97-digit number)
66874491442693094128…62747177620116520959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.337 × 10⁹⁷(98-digit number)
13374898288538618825…25494355240233041919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.674 × 10⁹⁷(98-digit number)
26749796577077237651…50988710480466083839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.349 × 10⁹⁷(98-digit number)
53499593154154475303…01977420960932167679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.069 × 10⁹⁸(99-digit number)
10699918630830895060…03954841921864335359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.139 × 10⁹⁸(99-digit number)
21399837261661790121…07909683843728670719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.279 × 10⁹⁸(99-digit number)
42799674523323580242…15819367687457341439
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,987,813 XPM·at block #6,842,932 · 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