Block #330,028

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2013, 9:28:51 AM · Difficulty 10.1687 · 6,482,953 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
55ec12a51f6af12f2231e163bdf299c08c51bd613237c7121bffad643a0d571c

Height

#330,028

Difficulty

10.168718

Transactions

7

Size

1.95 KB

Version

2

Bits

0a2b3117

Nonce

26,697

Timestamp

12/26/2013, 9:28:51 AM

Confirmations

6,482,953

Merkle Root

ffa87fd911f88d0550938bc66a390b21b5df8c33dcb4db6f3a077140fa0b137b
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.353 × 10⁹⁸(99-digit number)
43535528652218277052…04914054361306654119
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.353 × 10⁹⁸(99-digit number)
43535528652218277052…04914054361306654119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.707 × 10⁹⁸(99-digit number)
87071057304436554105…09828108722613308239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.741 × 10⁹⁹(100-digit number)
17414211460887310821…19656217445226616479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.482 × 10⁹⁹(100-digit number)
34828422921774621642…39312434890453232959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.965 × 10⁹⁹(100-digit number)
69656845843549243284…78624869780906465919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.393 × 10¹⁰⁰(101-digit number)
13931369168709848656…57249739561812931839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.786 × 10¹⁰⁰(101-digit number)
27862738337419697313…14499479123625863679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.572 × 10¹⁰⁰(101-digit number)
55725476674839394627…28998958247251727359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.114 × 10¹⁰¹(102-digit number)
11145095334967878925…57997916494503454719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.229 × 10¹⁰¹(102-digit number)
22290190669935757850…15995832989006909439
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,747,885 XPM·at block #6,812,980 · 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