Block #301,705

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/9/2013, 9:29:02 AM · Difficulty 9.9925 · 6,515,154 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
240dd91d0ffa0ce415ded01f074cc3e1eb23ff5814f964c32a1ddc03ecc323f4

Height

#301,705

Difficulty

9.992522

Transactions

9

Size

5.58 KB

Version

2

Bits

09fe15f1

Nonce

150,264

Timestamp

12/9/2013, 9:29:02 AM

Confirmations

6,515,154

Merkle Root

8d689004fbb9fcb1e71a59f20e46d5e40979b9a97525a46b15389118c78d521a
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.

1.283 × 10⁹⁴(95-digit number)
12837704322622179851…96738060108419147199
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
1.283 × 10⁹⁴(95-digit number)
12837704322622179851…96738060108419147199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.567 × 10⁹⁴(95-digit number)
25675408645244359702…93476120216838294399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.135 × 10⁹⁴(95-digit number)
51350817290488719404…86952240433676588799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.027 × 10⁹⁵(96-digit number)
10270163458097743880…73904480867353177599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.054 × 10⁹⁵(96-digit number)
20540326916195487761…47808961734706355199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.108 × 10⁹⁵(96-digit number)
41080653832390975523…95617923469412710399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.216 × 10⁹⁵(96-digit number)
82161307664781951046…91235846938825420799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.643 × 10⁹⁶(97-digit number)
16432261532956390209…82471693877650841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.286 × 10⁹⁶(97-digit number)
32864523065912780418…64943387755301683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.572 × 10⁹⁶(97-digit number)
65729046131825560837…29886775510603366399
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,778,916 XPM·at block #6,816,858 · 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