Block #303,198

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2013, 6:22:20 AM · Difficulty 9.9929 · 6,510,768 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
075ea61a9ca703d1c6a83cc113ea65c61af4211f75df39de9a94774b3b4dc791

Height

#303,198

Difficulty

9.992914

Transactions

2

Size

722 B

Version

2

Bits

09fe2f9b

Nonce

53,824

Timestamp

12/10/2013, 6:22:20 AM

Confirmations

6,510,768

Merkle Root

4230f50f0c4f431ae92efde7d2620da4b6e3f20b681a8b0a79aee58f2aa6fdfa
Transactions (2)
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.441 × 10⁹²(93-digit number)
74416785568554920494…71969998506527325439
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.441 × 10⁹²(93-digit number)
74416785568554920494…71969998506527325439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.488 × 10⁹³(94-digit number)
14883357113710984098…43939997013054650879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.976 × 10⁹³(94-digit number)
29766714227421968197…87879994026109301759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.953 × 10⁹³(94-digit number)
59533428454843936395…75759988052218603519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.190 × 10⁹⁴(95-digit number)
11906685690968787279…51519976104437207039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.381 × 10⁹⁴(95-digit number)
23813371381937574558…03039952208874414079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.762 × 10⁹⁴(95-digit number)
47626742763875149116…06079904417748828159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.525 × 10⁹⁴(95-digit number)
95253485527750298233…12159808835497656319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.905 × 10⁹⁵(96-digit number)
19050697105550059646…24319617670995312639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.810 × 10⁹⁵(96-digit number)
38101394211100119293…48639235341990625279
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,755,806 XPM·at block #6,813,965 · 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