Block #634,523

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/15/2014, 1:06:51 PM · Difficulty 10.9643 · 6,175,857 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f61b1edf1963d7673e20f374ea15b8c939cb8d7067381dce3fd3265e48d1533b

Height

#634,523

Difficulty

10.964299

Transactions

4

Size

1.36 KB

Version

5

Bits

0af6dc51

Nonce

2,363,296,795

Timestamp

7/15/2014, 1:06:51 PM

Confirmations

6,175,857

Merkle Root

960741a123b17cb438607ef335cf1488cf0871c9ec79798fb60091bf935af658
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.726 × 10⁹⁶(97-digit number)
17265699082338511191…72337793418263372799
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.726 × 10⁹⁶(97-digit number)
17265699082338511191…72337793418263372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.453 × 10⁹⁶(97-digit number)
34531398164677022382…44675586836526745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.906 × 10⁹⁶(97-digit number)
69062796329354044765…89351173673053491199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.381 × 10⁹⁷(98-digit number)
13812559265870808953…78702347346106982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.762 × 10⁹⁷(98-digit number)
27625118531741617906…57404694692213964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.525 × 10⁹⁷(98-digit number)
55250237063483235812…14809389384427929599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.105 × 10⁹⁸(99-digit number)
11050047412696647162…29618778768855859199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.210 × 10⁹⁸(99-digit number)
22100094825393294325…59237557537711718399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.420 × 10⁹⁸(99-digit number)
44200189650786588650…18475115075423436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.840 × 10⁹⁸(99-digit number)
88400379301573177300…36950230150846873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.768 × 10⁹⁹(100-digit number)
17680075860314635460…73900460301693747199
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,727,117 XPM·at block #6,810,379 · 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.

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