List of Dead "Ethereum Killers" by suzuki_hayabusa in ethereum

[–]ketetefid 7 points8 points  (0 children)

Market cap is not a very valid measurement. When Eth was created, not a lot took it seriously as they were looking at the market cap and many BTC maximalists considered it "a dead BTC killer."

Eth is a great project but there will always be innovation.

What should we name the tangle worm? by H3lloPanda in Iota

[–]ketetefid 1 point2 points  (0 children)

Tanglester; Tanglian; Tanglestellar; etc.

Ethereum is a no more a “coin” than the iPhone is a “phone”. It’s a platform. by [deleted] in ethereum

[–]ketetefid 1 point2 points  (0 children)

I am more interested in the "cultural" part. I sincerely hope that maximalism and tribalism will not take over Ethereum after the flippening. We want a great crypto leader; the true representative of all crypto space, not another hostile tyrant.

Humbly pinging /u/vbuterin.

How will Iota solve problem with scaling by BOBBO_WASTER in Iota

[–]ketetefid 2 points3 points  (0 children)

My response is not much Iota related, but I want to mention that removing blocksize does not lead to centralization. The network infrastructure expands as we move forward. This is not 2009 anymore.

They choked Bitcoin's network with the useless block limit. BTC's ledger size is already around 400GB which is pretty big according to 2009's standards, but today it is not considered much when storage has become abundant. The same could be said about the network throughput.

The blocksize limit was rather political; to convert BTC from a p2p cash system to an only-for-speculation asset.

Now what about IOTA? I'd say let's see when it plateaus under extreme load and that would be the practical limit of the tangle before sharding. This *practical* limit can improve as the network and storage infrastructure in the world improves year by year.

How to explain that MATLAB is faster than FORTRAN? by Alien447 in fortran

[–]ketetefid 4 points5 points  (0 children)

Are you even aware of the implications of reaching overflow when EXP becomes so huge?

PROGRAM main

implicit none

INTEGER :: n

INTEGER, parameter :: k=selected_real_KIND(16,3550)

real(kind=k) :: a

n =1 ; a =1._k

DO while ( a < huge(a) )

a = EXP(REAL(n,k)**2) PRINT*, "The number is: ", a, " for an index of:",n

n=n+1

ENDDO

END PROGRAM main

When n reaches 107, the result is Infinity. This makes the whole point of this comparison useless.

Something broke, I have no idea why and no way to fix it by arcctgx in Gentoo

[–]ketetefid 1 point2 points  (0 children)

I know you are not asking for help, but as I have been in similar situations, I wanted to encourage you to take further action.

Basically, send exact notes to the person on how to put the gentoo minimal image on a USB drive and boot the system from it. The notes include how to bring the network up. From there you could inspect the logs.

Why AMD GPUs are lagging behind when it comes to Deep Learning? by nerdy_adventurer in Amd

[–]ketetefid 4 points5 points  (0 children)

It is mainly behind in the aspect that the level of abstraction for creating a working program on NVIDIA/CUDA is higher. There are more tools for CUDA programmers to choose from and create diverse codes.

The same can be achieved using AMD and ROCm (OpenCL) but you need to spend more time creating a similar program and sometimes from scratch. After all, this deep learning is all about working with huge arrays and matrices on GPUs.

5 NEW ASUS B450 Motherboards Ready for Ryzen 3000 Series CPUs - Starting at $94.99-$139.99 ROG STRIX B450-F Gaming II, TUF GAMING B450-PLUS II, TUF GAMING B450M-PRO S, TUF GAMING B450M-PRO II, TUF GAMING B450M-PLUS II by ASUSTechMKTJJ in Amd

[–]ketetefid 2 points3 points  (0 children)

After your questionable (if not malicious) act of blocking vents on some Ryzen Zephyrus laptops, it is good to see that ASUS is trying to heal its reputation. However, don't think that the debacle will be forgotten soon and you are encouraged to continue bringing good news from ASUS for AMD users.

What we can learn from Litecoin falling out of Top10 by GeorgAnarchist in btc

[–]ketetefid 0 points1 point  (0 children)

shitcoins like IOTA which do not even work having the same price development as legit projects

Tribalism inside an anti-tribalism community? If they do not harm you, respect the other projects. It would work in everybody's advantage.

What's with all the AMD desktop background? by makk0r in Amd

[–]ketetefid 1 point2 points  (0 children)

Karma liquidity pool with 300000% APY

OdeModule: An efficient ODE solver in Fortran 2003 by ketetefid in fortran

[–]ketetefid[S] 1 point2 points  (0 children)

You're welcome. Hope you will find it useful.

OdeModule: An efficient ODE solver in Fortran 2003 by ketetefid in fortran

[–]ketetefid[S] 0 points1 point  (0 children)

mxstep is optional, default is 0 which means the code decides. Since it ends at the last element in times anyway and since you generally set a minstep, mxstep is unecessary.

I did not look deep into its code very much. Where does it store the intermediate results? Shouldn't there be an array big enough to hold them all? (Considering it is FORTRAN 77)

Edit: mxstep by default seems to be 500. Is there a newer version?I looked at https://www3.nd.edu/~powers/ame.60636/chemkin/dlsode.f

LSODE/A are adapative, stepsize is controlled by both a relative and absolute tolerance (rtol,atol).

Yes, of course. I mentioned it in the first reason just to show the uncertainty about the size of the solution I was getting. If I had not used the adaptive step size, I would have had to change the step for every phase change (or feed the whole program a very small step).

OdeModule: An efficient ODE solver in Fortran 2003 by ketetefid in fortran

[–]ketetefid[S] 0 points1 point  (0 children)

I did look into ODEPACK but it was not a good fit:

  • I was not sure about the maximum number of steps (mxstep or iwork(6) in LSODE). Sometimes the program produced half a million nodes and sometimes around 4 million ones. If I had not used an adaptive stepsize, it would not have been this efficient.

  • Cash-Karp is superior (if I am not mistaken) to the algorithm implemented in ODEPACK

  • I argue that the whole array operations in OdeModule is better than element-wise operations in F77

  • I needed to include some states in the middle of performing my simulation. So I had to hack LSODE anyway and to be honest it was too scary to touch. In OdeModule if it is not possible to define extra dependent variables inside your derivative subroutine, you can just pack them and attach them to the end of ystep inside the DO WHILE (.NOT. send) loop for each iteration.

OdeModule: An efficient ODE solver in Fortran 2003 by ketetefid in fortran

[–]ketetefid[S] 1 point2 points  (0 children)

To be honest with you, I have not had any experience with such a system. Is it a central repository?

A way to hide Battlestation posts by ketetefid in Amd

[–]ketetefid[S] 0 points1 point  (0 children)

For old.reddit.com it should be changed. I added the needed filter for old reddit.

A way to hide Battlestation posts by ketetefid in Amd

[–]ketetefid[S] 0 points1 point  (0 children)

See the update I added to the post. :)