Block #733,414

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/21/2014, 12:15:51 PM · Difficulty 10.9730 · 6,092,272 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
47dcac0f98896205aece0f26b86c443471fe0770e757b887f25b0402b0f0054f

Height

#733,414

Difficulty

10.972986

Transactions

4

Size

884 B

Version

2

Bits

0af915a4

Nonce

320,931,215

Timestamp

9/21/2014, 12:15:51 PM

Confirmations

6,092,272

Merkle Root

eb400b4ddea656ec6fd87eb34ee12e4d0b582c74e6d82445edf6ed15009bd426
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.

2.853 × 10⁹⁴(95-digit number)
28533952143622703242…45967471890311025819
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
2.853 × 10⁹⁴(95-digit number)
28533952143622703242…45967471890311025819
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.706 × 10⁹⁴(95-digit number)
57067904287245406485…91934943780622051639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.141 × 10⁹⁵(96-digit number)
11413580857449081297…83869887561244103279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.282 × 10⁹⁵(96-digit number)
22827161714898162594…67739775122488206559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.565 × 10⁹⁵(96-digit number)
45654323429796325188…35479550244976413119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.130 × 10⁹⁵(96-digit number)
91308646859592650376…70959100489952826239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.826 × 10⁹⁶(97-digit number)
18261729371918530075…41918200979905652479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.652 × 10⁹⁶(97-digit number)
36523458743837060150…83836401959811304959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.304 × 10⁹⁶(97-digit number)
73046917487674120301…67672803919622609919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.460 × 10⁹⁷(98-digit number)
14609383497534824060…35345607839245219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.921 × 10⁹⁷(98-digit number)
29218766995069648120…70691215678490439679
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,849,598 XPM·at block #6,825,685 · 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