Block #300,299

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/8/2013, 12:26:58 PM · Difficulty 9.9923 · 6,510,315 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6353d294a6acb98fceb74e19fc80c6cead8bf3118ed1142c3ca2e831869ad592

Height

#300,299

Difficulty

9.992258

Transactions

8

Size

3.89 KB

Version

2

Bits

09fe049d

Nonce

10,935

Timestamp

12/8/2013, 12:26:58 PM

Confirmations

6,510,315

Merkle Root

858df7711e2f7e0dfaccefe2c0023969e630b9840f4d2242ca33507ea3508975
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.349 × 10¹⁰⁷(108-digit number)
73493345719856272120…31611241092959928319
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.349 × 10¹⁰⁷(108-digit number)
73493345719856272120…31611241092959928319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.469 × 10¹⁰⁸(109-digit number)
14698669143971254424…63222482185919856639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.939 × 10¹⁰⁸(109-digit number)
29397338287942508848…26444964371839713279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.879 × 10¹⁰⁸(109-digit number)
58794676575885017696…52889928743679426559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.175 × 10¹⁰⁹(110-digit number)
11758935315177003539…05779857487358853119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.351 × 10¹⁰⁹(110-digit number)
23517870630354007078…11559714974717706239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.703 × 10¹⁰⁹(110-digit number)
47035741260708014157…23119429949435412479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.407 × 10¹⁰⁹(110-digit number)
94071482521416028314…46238859898870824959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.881 × 10¹¹⁰(111-digit number)
18814296504283205662…92477719797741649919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.762 × 10¹¹⁰(111-digit number)
37628593008566411325…84955439595483299839
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,728,996 XPM·at block #6,810,613 · 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.

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