Block #362,058

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/16/2014, 11:36:51 AM · Difficulty 10.4104 · 6,454,751 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7eca35aeefd36c00dd616f56c0b77954de785111ec163dfc54566b084d9cb3d9

Height

#362,058

Difficulty

10.410442

Transactions

1

Size

1.01 KB

Version

2

Bits

0a6912be

Nonce

102,419

Timestamp

1/16/2014, 11:36:51 AM

Confirmations

6,454,751

Merkle Root

208cce4e69321589dee29eb6c563669d88164d1c642b60cccd309c8f201dd18b
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.439 × 10⁹⁶(97-digit number)
14395641873500875066…70061448597183775359
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.439 × 10⁹⁶(97-digit number)
14395641873500875066…70061448597183775359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.879 × 10⁹⁶(97-digit number)
28791283747001750132…40122897194367550719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.758 × 10⁹⁶(97-digit number)
57582567494003500264…80245794388735101439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.151 × 10⁹⁷(98-digit number)
11516513498800700052…60491588777470202879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.303 × 10⁹⁷(98-digit number)
23033026997601400105…20983177554940405759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.606 × 10⁹⁷(98-digit number)
46066053995202800211…41966355109880811519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.213 × 10⁹⁷(98-digit number)
92132107990405600422…83932710219761623039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.842 × 10⁹⁸(99-digit number)
18426421598081120084…67865420439523246079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.685 × 10⁹⁸(99-digit number)
36852843196162240169…35730840879046492159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.370 × 10⁹⁸(99-digit number)
73705686392324480338…71461681758092984319
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,778,509 XPM·at block #6,816,808 · 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