Block #296,023

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2013, 6:37:15 PM · Difficulty 9.9916 · 6,521,803 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7e28f9e8903c1dd35e349b2a950c7f263aad8ae4e9d56fd83fd47de1d68aa5be

Height

#296,023

Difficulty

9.991599

Transactions

1

Size

1.18 KB

Version

2

Bits

09fdd970

Nonce

221,787

Timestamp

12/5/2013, 6:37:15 PM

Confirmations

6,521,803

Merkle Root

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

7.131 × 10⁹⁴(95-digit number)
71315112306525562064…48892776003607983999
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
7.131 × 10⁹⁴(95-digit number)
71315112306525562064…48892776003607983999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.426 × 10⁹⁵(96-digit number)
14263022461305112412…97785552007215967999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.852 × 10⁹⁵(96-digit number)
28526044922610224825…95571104014431935999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.705 × 10⁹⁵(96-digit number)
57052089845220449651…91142208028863871999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.141 × 10⁹⁶(97-digit number)
11410417969044089930…82284416057727743999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.282 × 10⁹⁶(97-digit number)
22820835938088179860…64568832115455487999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.564 × 10⁹⁶(97-digit number)
45641671876176359721…29137664230910975999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.128 × 10⁹⁶(97-digit number)
91283343752352719442…58275328461821951999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.825 × 10⁹⁷(98-digit number)
18256668750470543888…16550656923643903999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.651 × 10⁹⁷(98-digit number)
36513337500941087776…33101313847287807999
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,786,672 XPM·at block #6,817,825 · 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