Block #305,936

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2013, 6:32:30 PM · Difficulty 9.9938 · 6,518,559 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4a515c51e1f732bef5eeea538d7f436dd22f8d6387c7ba0e26d0fc8bb7814304

Height

#305,936

Difficulty

9.993752

Transactions

10

Size

2.61 KB

Version

2

Bits

09fe6682

Nonce

59,915

Timestamp

12/11/2013, 6:32:30 PM

Confirmations

6,518,559

Merkle Root

6230b8396adb188c2e741fcb8b77ba31acafeaf10110c9a11bf33e6dd12c2dc6
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.317 × 10⁹⁴(95-digit number)
73170419659927581316…70721881737101919999
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.317 × 10⁹⁴(95-digit number)
73170419659927581316…70721881737101919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.463 × 10⁹⁵(96-digit number)
14634083931985516263…41443763474203839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.926 × 10⁹⁵(96-digit number)
29268167863971032526…82887526948407679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.853 × 10⁹⁵(96-digit number)
58536335727942065053…65775053896815359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.170 × 10⁹⁶(97-digit number)
11707267145588413010…31550107793630719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.341 × 10⁹⁶(97-digit number)
23414534291176826021…63100215587261439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.682 × 10⁹⁶(97-digit number)
46829068582353652042…26200431174522879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.365 × 10⁹⁶(97-digit number)
93658137164707304085…52400862349045759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.873 × 10⁹⁷(98-digit number)
18731627432941460817…04801724698091519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.746 × 10⁹⁷(98-digit number)
37463254865882921634…09603449396183039999
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,840,032 XPM·at block #6,824,494 · 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