Block #661,665

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/4/2014, 3:45:57 AM · Difficulty 10.9565 · 6,153,260 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c2e523ec1dd7e2efd4416ffbbff5600c1862a815b3c2fd031939d44a6e7e50c6

Height

#661,665

Difficulty

10.956492

Transactions

5

Size

1.23 KB

Version

2

Bits

0af4dcb0

Nonce

35,694,162

Timestamp

8/4/2014, 3:45:57 AM

Confirmations

6,153,260

Merkle Root

3e26422170dfeb57947e424d9ec8acda3befe1d492949a8dbdaabcc3e9ec8706
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.188 × 10⁹⁴(95-digit number)
71885280413889815069…56982105717956661189
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.188 × 10⁹⁴(95-digit number)
71885280413889815069…56982105717956661189
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.437 × 10⁹⁵(96-digit number)
14377056082777963013…13964211435913322379
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.875 × 10⁹⁵(96-digit number)
28754112165555926027…27928422871826644759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.750 × 10⁹⁵(96-digit number)
57508224331111852055…55856845743653289519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.150 × 10⁹⁶(97-digit number)
11501644866222370411…11713691487306579039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.300 × 10⁹⁶(97-digit number)
23003289732444740822…23427382974613158079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.600 × 10⁹⁶(97-digit number)
46006579464889481644…46854765949226316159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.201 × 10⁹⁶(97-digit number)
92013158929778963289…93709531898452632319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.840 × 10⁹⁷(98-digit number)
18402631785955792657…87419063796905264639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.680 × 10⁹⁷(98-digit number)
36805263571911585315…74838127593810529279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.361 × 10⁹⁷(98-digit number)
73610527143823170631…49676255187621058559
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,763,494 XPM·at block #6,814,924 · 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