Block #449,306

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/18/2014, 12:22:01 PM · Difficulty 10.3714 · 6,360,857 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
67c275c7a6300a330ce81af6b10cf0f07a3d53378665f8ef26b31c1a6be406e8

Height

#449,306

Difficulty

10.371367

Transactions

1

Size

1004 B

Version

2

Bits

0a5f11ef

Nonce

130,084

Timestamp

3/18/2014, 12:22:01 PM

Confirmations

6,360,857

Merkle Root

85de19c27599aea4af8106228f236d96640b91e058bd9b82d99f1e6f05a7c17c
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.

3.279 × 10⁹⁶(97-digit number)
32794344969550421525…47336513956912184669
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
3.279 × 10⁹⁶(97-digit number)
32794344969550421525…47336513956912184669
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.558 × 10⁹⁶(97-digit number)
65588689939100843050…94673027913824369339
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.311 × 10⁹⁷(98-digit number)
13117737987820168610…89346055827648738679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.623 × 10⁹⁷(98-digit number)
26235475975640337220…78692111655297477359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.247 × 10⁹⁷(98-digit number)
52470951951280674440…57384223310594954719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.049 × 10⁹⁸(99-digit number)
10494190390256134888…14768446621189909439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.098 × 10⁹⁸(99-digit number)
20988380780512269776…29536893242379818879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.197 × 10⁹⁸(99-digit number)
41976761561024539552…59073786484759637759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.395 × 10⁹⁸(99-digit number)
83953523122049079105…18147572969519275519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.679 × 10⁹⁹(100-digit number)
16790704624409815821…36295145939038551039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.358 × 10⁹⁹(100-digit number)
33581409248819631642…72590291878077102079
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,725,370 XPM·at block #6,810,162 · 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