Block #223,984

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/23/2013, 10:53:50 AM · Difficulty 9.9372 · 6,594,012 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1f9a3bc0532c011f8c75ad3fa182c12935112cb325cf3cba7b1f95160924c920

Height

#223,984

Difficulty

9.937215

Transactions

5

Size

1.30 KB

Version

2

Bits

09efed56

Nonce

68,012

Timestamp

10/23/2013, 10:53:50 AM

Confirmations

6,594,012

Merkle Root

f26998ad2b0d630a12bcc50385e00cbc3b27705a7908fb69d8d8f24b43bddbec
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.126 × 10⁹⁶(97-digit number)
81260314736316541113…48731684009233976319
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.126 × 10⁹⁶(97-digit number)
81260314736316541113…48731684009233976319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.625 × 10⁹⁷(98-digit number)
16252062947263308222…97463368018467952639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.250 × 10⁹⁷(98-digit number)
32504125894526616445…94926736036935905279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.500 × 10⁹⁷(98-digit number)
65008251789053232891…89853472073871810559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.300 × 10⁹⁸(99-digit number)
13001650357810646578…79706944147743621119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.600 × 10⁹⁸(99-digit number)
26003300715621293156…59413888295487242239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.200 × 10⁹⁸(99-digit number)
52006601431242586312…18827776590974484479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.040 × 10⁹⁹(100-digit number)
10401320286248517262…37655553181948968959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.080 × 10⁹⁹(100-digit number)
20802640572497034525…75311106363897937919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.160 × 10⁹⁹(100-digit number)
41605281144994069050…50622212727795875839
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,788,041 XPM·at block #6,817,995 · 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