Block #929,045

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/9/2015, 12:45:00 PM · Difficulty 10.9039 · 5,879,974 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
48d4960d7510ba3882ced19cc45237507f144880d526345fdf8678f7d41d8d83

Height

#929,045

Difficulty

10.903854

Transactions

10

Size

6.38 KB

Version

2

Bits

0ae76301

Nonce

2,438,827,137

Timestamp

2/9/2015, 12:45:00 PM

Confirmations

5,879,974

Merkle Root

3018984a817f35aa7d77e6d42cc2ea94dc4fd138ae4c3fa68aba14e3b6aa595c
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.

9.723 × 10⁹⁴(95-digit number)
97239772085961199825…06268148020174042199
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
9.723 × 10⁹⁴(95-digit number)
97239772085961199825…06268148020174042199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.944 × 10⁹⁵(96-digit number)
19447954417192239965…12536296040348084399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.889 × 10⁹⁵(96-digit number)
38895908834384479930…25072592080696168799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.779 × 10⁹⁵(96-digit number)
77791817668768959860…50145184161392337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.555 × 10⁹⁶(97-digit number)
15558363533753791972…00290368322784675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.111 × 10⁹⁶(97-digit number)
31116727067507583944…00580736645569350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.223 × 10⁹⁶(97-digit number)
62233454135015167888…01161473291138700799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.244 × 10⁹⁷(98-digit number)
12446690827003033577…02322946582277401599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.489 × 10⁹⁷(98-digit number)
24893381654006067155…04645893164554803199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.978 × 10⁹⁷(98-digit number)
49786763308012134310…09291786329109606399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.957 × 10⁹⁷(98-digit number)
99573526616024268621…18583572658219212799
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,716,214 XPM·at block #6,809,018 · 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.

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