Block #906,943

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/23/2015, 6:20:47 PM · Difficulty 10.9353 · 5,909,482 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0ff73d64cb5d6dab4d7eabf71a0dfc09f179aa1d43b47db739a6218acaa33466

Height

#906,943

Difficulty

10.935285

Transactions

5

Size

2.96 KB

Version

2

Bits

0aef6ed8

Nonce

7,634,712

Timestamp

1/23/2015, 6:20:47 PM

Confirmations

5,909,482

Merkle Root

58d39e76429cbe6ecd9a51b5a30fa296a6ba3b17a500320efa24991ff7f5d7fd
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.152 × 10⁹⁶(97-digit number)
91520429742643157345…63244806100068209919
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.152 × 10⁹⁶(97-digit number)
91520429742643157345…63244806100068209919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.830 × 10⁹⁷(98-digit number)
18304085948528631469…26489612200136419839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.660 × 10⁹⁷(98-digit number)
36608171897057262938…52979224400272839679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.321 × 10⁹⁷(98-digit number)
73216343794114525876…05958448800545679359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.464 × 10⁹⁸(99-digit number)
14643268758822905175…11916897601091358719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.928 × 10⁹⁸(99-digit number)
29286537517645810350…23833795202182717439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.857 × 10⁹⁸(99-digit number)
58573075035291620700…47667590404365434879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.171 × 10⁹⁹(100-digit number)
11714615007058324140…95335180808730869759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.342 × 10⁹⁹(100-digit number)
23429230014116648280…90670361617461739519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.685 × 10⁹⁹(100-digit number)
46858460028233296560…81340723234923479039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.371 × 10⁹⁹(100-digit number)
93716920056466593121…62681446469846958079
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,775,528 XPM·at block #6,816,424 · 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