Block #335,664

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/30/2013, 10:11:07 AM · Difficulty 10.1437 · 6,482,272 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
896d942b7265c62bf4b0163442d63406e5ce8cd09586b3e5759d8a1ad1f0c1c2

Height

#335,664

Difficulty

10.143657

Transactions

1

Size

800 B

Version

2

Bits

0a24c6b8

Nonce

2,066

Timestamp

12/30/2013, 10:11:07 AM

Confirmations

6,482,272

Merkle Root

28ada57fc7cd66be02231f41b65319d987485d4a02d9fbb2db4d03f0ee04c498
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.162 × 10⁹⁷(98-digit number)
41622709463866169431…77160866584271605759
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.162 × 10⁹⁷(98-digit number)
41622709463866169431…77160866584271605759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.324 × 10⁹⁷(98-digit number)
83245418927732338862…54321733168543211519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.664 × 10⁹⁸(99-digit number)
16649083785546467772…08643466337086423039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.329 × 10⁹⁸(99-digit number)
33298167571092935545…17286932674172846079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.659 × 10⁹⁸(99-digit number)
66596335142185871090…34573865348345692159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.331 × 10⁹⁹(100-digit number)
13319267028437174218…69147730696691384319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.663 × 10⁹⁹(100-digit number)
26638534056874348436…38295461393382768639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.327 × 10⁹⁹(100-digit number)
53277068113748696872…76590922786765537279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.065 × 10¹⁰⁰(101-digit number)
10655413622749739374…53181845573531074559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.131 × 10¹⁰⁰(101-digit number)
21310827245499478748…06363691147062149119
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,787,553 XPM·at block #6,817,935 · 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