Block #298,770

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/7/2013, 1:03:12 PM · Difficulty 9.9920 · 6,526,764 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2124a04ba9ad0c79ecac3f67b81ea6b2f9d0828d2001dec1c994c295547a8230

Height

#298,770

Difficulty

9.992008

Transactions

4

Size

3.17 KB

Version

2

Bits

09fdf43b

Nonce

5,720

Timestamp

12/7/2013, 1:03:12 PM

Confirmations

6,526,764

Merkle Root

a79d737f65649b74f3bc84bde272d2ace0378dc473dcb6ca1ac77fe9ddcd3b15
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.284 × 10⁹¹(92-digit number)
12842442531336988130…07158176062537330799
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.284 × 10⁹¹(92-digit number)
12842442531336988130…07158176062537330799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.568 × 10⁹¹(92-digit number)
25684885062673976260…14316352125074661599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.136 × 10⁹¹(92-digit number)
51369770125347952520…28632704250149323199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.027 × 10⁹²(93-digit number)
10273954025069590504…57265408500298646399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.054 × 10⁹²(93-digit number)
20547908050139181008…14530817000597292799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.109 × 10⁹²(93-digit number)
41095816100278362016…29061634001194585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.219 × 10⁹²(93-digit number)
82191632200556724032…58123268002389171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.643 × 10⁹³(94-digit number)
16438326440111344806…16246536004778342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.287 × 10⁹³(94-digit number)
32876652880222689612…32493072009556684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.575 × 10⁹³(94-digit number)
65753305760445379225…64986144019113369599
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,848,370 XPM·at block #6,825,533 · 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