Block #299,736

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/8/2013, 4:07:24 AM · Difficulty 9.9921 · 6,516,661 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e6bd271f17aca9fe0c98ab5931ee10bc7b96cacd5fd66abc544a7a98f9edb8c4

Height

#299,736

Difficulty

9.992142

Transactions

1

Size

1.15 KB

Version

2

Bits

09fdfd0a

Nonce

157,970

Timestamp

12/8/2013, 4:07:24 AM

Confirmations

6,516,661

Merkle Root

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

3.589 × 10⁹⁴(95-digit number)
35892010554996020340…51625904307304579199
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
3.589 × 10⁹⁴(95-digit number)
35892010554996020340…51625904307304579199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.178 × 10⁹⁴(95-digit number)
71784021109992040681…03251808614609158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.435 × 10⁹⁵(96-digit number)
14356804221998408136…06503617229218316799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.871 × 10⁹⁵(96-digit number)
28713608443996816272…13007234458436633599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.742 × 10⁹⁵(96-digit number)
57427216887993632545…26014468916873267199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.148 × 10⁹⁶(97-digit number)
11485443377598726509…52028937833746534399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.297 × 10⁹⁶(97-digit number)
22970886755197453018…04057875667493068799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.594 × 10⁹⁶(97-digit number)
45941773510394906036…08115751334986137599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.188 × 10⁹⁶(97-digit number)
91883547020789812072…16231502669972275199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.837 × 10⁹⁷(98-digit number)
18376709404157962414…32463005339944550399
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,775,299 XPM·at block #6,816,396 · 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