Block #306,350

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2013, 11:55:01 PM · Difficulty 9.9939 · 6,509,688 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
858a9b7998b62c64515ac3e35714c6d511c1b2339539e8fd94392cd1cabf4ee0

Height

#306,350

Difficulty

9.993877

Transactions

16

Size

4.71 KB

Version

2

Bits

09fe6eb2

Nonce

20,388

Timestamp

12/11/2013, 11:55:01 PM

Confirmations

6,509,688

Merkle Root

94153df6bc8da31ce40461a7637c1e1a967039a0b7859879734ec39e1e52fd42
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.

4.662 × 10⁹⁰(91-digit number)
46628443092761028542…53559551682589971919
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
4.662 × 10⁹⁰(91-digit number)
46628443092761028542…53559551682589971919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.325 × 10⁹⁰(91-digit number)
93256886185522057084…07119103365179943839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.865 × 10⁹¹(92-digit number)
18651377237104411416…14238206730359887679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.730 × 10⁹¹(92-digit number)
37302754474208822833…28476413460719775359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.460 × 10⁹¹(92-digit number)
74605508948417645667…56952826921439550719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.492 × 10⁹²(93-digit number)
14921101789683529133…13905653842879101439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.984 × 10⁹²(93-digit number)
29842203579367058267…27811307685758202879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.968 × 10⁹²(93-digit number)
59684407158734116534…55622615371516405759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.193 × 10⁹³(94-digit number)
11936881431746823306…11245230743032811519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.387 × 10⁹³(94-digit number)
23873762863493646613…22490461486065623039
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,772,418 XPM·at block #6,816,037 · 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