Block #310,760

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/14/2013, 5:39:50 AM · Difficulty 9.9953 · 6,496,024 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4372a62b7b2ac5684350dec9d5ab10a1f8cfa37766bb59182819601e4575b007

Height

#310,760

Difficulty

9.995283

Transactions

3

Size

686 B

Version

2

Bits

09fecad8

Nonce

739

Timestamp

12/14/2013, 5:39:50 AM

Confirmations

6,496,024

Merkle Root

df4b38530905544a141038aca55610c8bd3a905fa815757c17694d2019a062be
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.

2.201 × 10¹⁰³(104-digit number)
22013014446953626651…62700547404218399999
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
2.201 × 10¹⁰³(104-digit number)
22013014446953626651…62700547404218399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.402 × 10¹⁰³(104-digit number)
44026028893907253303…25401094808436799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.805 × 10¹⁰³(104-digit number)
88052057787814506606…50802189616873599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.761 × 10¹⁰⁴(105-digit number)
17610411557562901321…01604379233747199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.522 × 10¹⁰⁴(105-digit number)
35220823115125802642…03208758467494399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.044 × 10¹⁰⁴(105-digit number)
70441646230251605285…06417516934988799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.408 × 10¹⁰⁵(106-digit number)
14088329246050321057…12835033869977599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.817 × 10¹⁰⁵(106-digit number)
28176658492100642114…25670067739955199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.635 × 10¹⁰⁵(106-digit number)
56353316984201284228…51340135479910399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.127 × 10¹⁰⁶(107-digit number)
11270663396840256845…02680270959820799999
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,698,376 XPM·at block #6,806,783 · 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