Block #303,026

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2013, 3:42:37 AM · Difficulty 9.9929 · 6,523,878 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
803312efacabbe24364919a4766a1f6f1c181c3bb87f617d95920c875f305105

Height

#303,026

Difficulty

9.992892

Transactions

1

Size

1.08 KB

Version

2

Bits

09fe2e2f

Nonce

207,061

Timestamp

12/10/2013, 3:42:37 AM

Confirmations

6,523,878

Merkle Root

961dfab51d6819c5dd673debcaa15169be234affaa0f2d6dc3b09672b189fe25
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.

5.169 × 10⁹¹(92-digit number)
51692207551668402109…77653866483229529319
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
5.169 × 10⁹¹(92-digit number)
51692207551668402109…77653866483229529319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.033 × 10⁹²(93-digit number)
10338441510333680421…55307732966459058639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.067 × 10⁹²(93-digit number)
20676883020667360843…10615465932918117279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.135 × 10⁹²(93-digit number)
41353766041334721687…21230931865836234559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.270 × 10⁹²(93-digit number)
82707532082669443374…42461863731672469119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.654 × 10⁹³(94-digit number)
16541506416533888674…84923727463344938239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.308 × 10⁹³(94-digit number)
33083012833067777349…69847454926689876479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.616 × 10⁹³(94-digit number)
66166025666135554699…39694909853379752959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.323 × 10⁹⁴(95-digit number)
13233205133227110939…79389819706759505919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.646 × 10⁹⁴(95-digit number)
26466410266454221879…58779639413519011839
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,859,399 XPM·at block #6,826,903 · 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