Block #359,231

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2014, 3:33:22 PM · Difficulty 10.3879 · 6,457,035 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
69d6d7dba097d0d0c944c85ebfb5d49326a483c16061214c11d8b3c88d4d6359

Height

#359,231

Difficulty

10.387898

Transactions

7

Size

5.36 KB

Version

2

Bits

0a634d43

Nonce

13,215

Timestamp

1/14/2014, 3:33:22 PM

Confirmations

6,457,035

Merkle Root

3d747e54b3a6fbed5abf0f3a34ef62532602b2497598b90a657f39860c596f62
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.118 × 10¹⁰¹(102-digit number)
11181407348342305635…19701074519723740159
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.118 × 10¹⁰¹(102-digit number)
11181407348342305635…19701074519723740159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.236 × 10¹⁰¹(102-digit number)
22362814696684611271…39402149039447480319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.472 × 10¹⁰¹(102-digit number)
44725629393369222543…78804298078894960639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.945 × 10¹⁰¹(102-digit number)
89451258786738445086…57608596157789921279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.789 × 10¹⁰²(103-digit number)
17890251757347689017…15217192315579842559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.578 × 10¹⁰²(103-digit number)
35780503514695378034…30434384631159685119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.156 × 10¹⁰²(103-digit number)
71561007029390756069…60868769262319370239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.431 × 10¹⁰³(104-digit number)
14312201405878151213…21737538524638740479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.862 × 10¹⁰³(104-digit number)
28624402811756302427…43475077049277480959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.724 × 10¹⁰³(104-digit number)
57248805623512604855…86950154098554961919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.144 × 10¹⁰⁴(105-digit number)
11449761124702520971…73900308197109923839
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,774,241 XPM·at block #6,816,265 · 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