Block #667,647

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/7/2014, 6:27:25 PM · Difficulty 10.9629 · 6,149,321 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
898d0e44052862413309b74710c981b0c46bd39f7d7e5fa06008a5cb3d8b9439

Height

#667,647

Difficulty

10.962898

Transactions

3

Size

953 B

Version

2

Bits

0af68083

Nonce

625,943,908

Timestamp

8/7/2014, 6:27:25 PM

Confirmations

6,149,321

Merkle Root

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

4.912 × 10⁹⁵(96-digit number)
49128675351215618698…97433779368177701279
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
4.912 × 10⁹⁵(96-digit number)
49128675351215618698…97433779368177701279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.825 × 10⁹⁵(96-digit number)
98257350702431237396…94867558736355402559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.965 × 10⁹⁶(97-digit number)
19651470140486247479…89735117472710805119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.930 × 10⁹⁶(97-digit number)
39302940280972494958…79470234945421610239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.860 × 10⁹⁶(97-digit number)
78605880561944989916…58940469890843220479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.572 × 10⁹⁷(98-digit number)
15721176112388997983…17880939781686440959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.144 × 10⁹⁷(98-digit number)
31442352224777995966…35761879563372881919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.288 × 10⁹⁷(98-digit number)
62884704449555991933…71523759126745763839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.257 × 10⁹⁸(99-digit number)
12576940889911198386…43047518253491527679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.515 × 10⁹⁸(99-digit number)
25153881779822396773…86095036506983055359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.030 × 10⁹⁸(99-digit number)
50307763559644793546…72190073013966110719
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,779,781 XPM·at block #6,816,967 · 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