Block #331,615

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/27/2013, 11:59:06 AM · Difficulty 10.1686 · 6,484,589 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8a07005e20206a46dc139088fcdce7a8672b02fd32458cba2a9bdd29a98c762d

Height

#331,615

Difficulty

10.168563

Transactions

10

Size

3.02 KB

Version

2

Bits

0a2b26f5

Nonce

141,386

Timestamp

12/27/2013, 11:59:06 AM

Confirmations

6,484,589

Merkle Root

64354b94c3e92c76296c2aa651be881e6b3f6e4fcfc870ae9d215d7e07f4ab80
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.

1.864 × 10⁹⁸(99-digit number)
18641506137666459047…03371092481489644799
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
1.864 × 10⁹⁸(99-digit number)
18641506137666459047…03371092481489644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.728 × 10⁹⁸(99-digit number)
37283012275332918095…06742184962979289599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.456 × 10⁹⁸(99-digit number)
74566024550665836190…13484369925958579199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.491 × 10⁹⁹(100-digit number)
14913204910133167238…26968739851917158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.982 × 10⁹⁹(100-digit number)
29826409820266334476…53937479703834316799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.965 × 10⁹⁹(100-digit number)
59652819640532668952…07874959407668633599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.193 × 10¹⁰⁰(101-digit number)
11930563928106533790…15749918815337267199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.386 × 10¹⁰⁰(101-digit number)
23861127856213067580…31499837630674534399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.772 × 10¹⁰⁰(101-digit number)
47722255712426135161…62999675261349068799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.544 × 10¹⁰⁰(101-digit number)
95444511424852270323…25999350522698137599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.908 × 10¹⁰¹(102-digit number)
19088902284970454064…51998701045396275199
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,773,758 XPM·at block #6,816,203 · 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